How can we speed up matrix multiplication?
SIAM Review
The algebraic eigenvalue problem
The algebraic eigenvalue problem
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Growth factor and expected growth factor of some pivoting strategies
Journal of Computational and Applied Mathematics
| Hi-index | 0.02 |
If numerical analysts understand anything, surely it must be Gaussian elimination. This is the oldest and truest of numerical algorithms. To be precise, I am speaking of Gaussian elimination with partial pivoting, the universal method for solving a dense, unstructured n X n linear system of equations Ax = b on a serial computer. This algorithm has been so successful that to many of us, Gaussian elimination and Ax = b are more or less synonymous. The chapter headings in the book by Golub and Van Loan [3] are typical -- along with "Orthogonalization and Least Squares Methods," "The Symetric Eigenvalue Problem," and the rest, one finds "Gaussian Elimination," not "Linear Systems of Equations."