About the Book
Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Pages: 115. Chapters: Gaussian elimination, System of linear equations, Basis function, Kernel, MATLAB, Matrix multiplication, Singular value decomposition, Cholesky decomposition, QR decomposition, Givens rotation, Linear least squares, Moore-Penrose pseudoinverse, Conjugate gradient method, Biconjugate gradient stabilized method, Jacobi eigenvalue algorithm, Triangular matrix, SPIKE algorithm, In-place matrix transposition, LU decomposition, Preconditioner, Gauss-Seidel method, Derivation of the conjugate gradient method, Generalized minimal residual method, Lanczos algorithm, Inverse iteration, Arnoldi iteration, Power iteration, Block matrix pseudoinverse, Tridiagonal matrix algorithm, Divide-and-conquer eigenvalue algorithm, LAPACK, Automatically Tuned Linear Algebra Software, QR algorithm, Basic Linear Algebra Subprograms, Modal analysis using FEM, Circulant matrix, Jacobi method, Backfitting algorithm, Vandermonde matrix, Strassen algorithm, Successive over-relaxation, Householder transformation, Diagonally dominant matrix, Speakeasy, Pivot element, Gauss-Jordan elimination, Montante's method, General Matrix Multiply, Jacobi method for complex Hermitian matrices, Jacobi rotation, Kaczmarz method, Hilbert matrix, Portable, Extensible Toolkit for Scientific Computation, Biconjugate gradient method, LINPACK, Lis, Row echelon form, Jacket, Iterative refinement, ABS methods, Block Wiedemann algorithm, Freivald's algorithm, LOBPCG, Nested dissection, Stone method, Minimum degree algorithm, BLOPEX, Rayleigh quotient iteration, Hypre, Modified Richardson iteration, Math Kernel Library, Krylov subspace, Coppersmith-Winograd algorithm, Frontal solver, Conjugate residual method, AMD Core Math Library, SAXPY, Matrix-free methods, Chebyshev iteration, Block Lanczos algorithm for nullspace of a matrix over a finite field, Sparse...
