Numerical Methods in Matrix Computations
By Å. Björck. 2014
299 citations recorded by the source corpus.
Subfields: Atomic and Molecular Physics, and Optics, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/db78143ea1726bf05e82f8d64364f3f8f9c32a1c
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Atomic and Molecular Physics, and Optics
In Computational Theory and Mathematics
Citations in the corpus
- Energy-Efficient Hybrid Analog and Digital Precoding for MmWave MIMO Systems With Large Antenna Arrays (2015, methodology): “To solve this problem, we propose to utilize the Aitken acceleration method [29] to further increase the convergence rate of the power iteration algorithm.”
- Spatially Common Sparsity Based Adaptive Channel Estimation and Feedback for FDD Massive MIMO (2015, background): “(cid:0) (cid:1) Identifying or Pruning ( lines 8 and 10 ): The cost to locate the largest T entries of a size-M vector is O ( M ) [24]. operation LS ( lines 9 and 11 ): LS solution has the computational complexity on the order of O P (2 G 2 + T 3 ) due to the joint recovery of P sparse signals [27].”