User:Amatdiou/Books/Numerical linear algebra




WikiProject Wikipedia-Books (questions and assistance). Edit this book: Book Creator · Wikitext Order a printed copy from: PediaPress [ About ] [ Advanced ] [ FAQ ] [ Feedback ] [ Help ] [ WikiProject ] [ Recent Changes ]

Numerical linear algebra

Category: Numerical linear algebra; Numerical linear algebra; ABS methods; Arnoldi iteration; Walter Edwin Arnoldi; Automatically Tuned Linear Algebra Software; Backfitting algorithm; Bareiss algorithm; Basic Linear Algebra Subprograms; Basis function; Biconjugate gradient method; Biconjugate gradient stabilized method; Bidiagonalization; Block Lanczos algorithm; Block matrix pseudoinverse; Block Wiedemann algorithm; BLOPEX; Cannon's algorithm; Chebyshev iteration; Cholesky decomposition; Circulant matrix; Conjugate gradient method; Conjugate residual method; Convergent matrix; Coppersmith–Winograd algorithm; Derivation of the conjugate gradient method; Diagonally dominant matrix; DIIS; Divide-and-conquer eigenvalue algorithm; Eigenvalue algorithm; EISPACK; Folded spectrum method; Freivalds' algorithm; Frontal solver; Gauss–Seidel method; Gaussian elimination; Generalized minimal residual method; Givens rotation; GotoBLAS; Gradient method; Hilbert matrix; Householder operator; Householder transformation; Hypre; In-place matrix transposition; Incomplete Cholesky factorization; Incomplete LU factorization; Inverse iteration; Iterative refinement; Jacket (software); Jacobi eigenvalue algorithm; Jacobi method; Jacobi method for complex Hermitian matrices; Jacobi rotation; Julia (programming language); Kaczmarz method; Kernel (linear algebra); Krylov subspace; Lanczos algorithm; LAPACK; Linear least squares (mathematics); LINPACK; Lis (linear algebra library); LOBPCG; Low-rank approximation; LU decomposition; LU reduction; Math Kernel Library; MATLAB; Matrix multiplication; Matrix splitting; Matrix-free methods; Method of Four Russians; Minimum degree algorithm; Modal analysis using FEM; Modified Richardson iteration; Moore–Penrose pseudoinverse; Nested dissection; Pivot element; Portable, Extensible Toolkit for Scientific Computation; Power iteration; Preconditioner; Pseudospectrum; QR algorithm; QR decomposition; Rayleigh quotient iteration; Relaxation (iterative method); Row echelon form; RRQR factorization; Singular value decomposition; SLEPc; Sparse approximation; Speakeasy (computational environment); SPIKE algorithm; Stieltjes matrix; Stone method; Strassen algorithm; Successive over-relaxation; Symmetric successive overrelaxation; System of linear equations; Triangular matrix; Tridiagonal matrix algorithm; Vandermonde matrix; Wilkinson matrix
Category: Exchange algorithms; Bland's rule; Criss-cross algorithm; Greedy algorithm; Simplex algorithm
Category: Matrix decompositions; Block LU decomposition; Crout matrix decomposition; Dynamic mode decomposition; Eigendecomposition of a matrix; Jordan normal form; Jordan–Chevalley decomposition; Matrix decomposition; Polar decomposition; Principal component analysis; Rank factorization; Schur decomposition; Symbolic Cholesky decomposition
Category: Singular value decomposition; Blind signal separation; Eigenvalues and eigenvectors; Generalized singular value decomposition; Gene H. Golub; Ervand Kogbetliantz; Non-linear iterative partial least squares; Normal mode; Orthogonal Procrustes problem; Schmidt decomposition; Singular value; Spectral theorem; Two-dimensional singular value decomposition
Category: Relaxation (iterative methods)
Category: Sparse matrices; Anti-diagonal matrix; Band matrix; Bidiagonal matrix; Block matrix; Cuthill–McKee algorithm; Diagonal matrix; Generalized permutation matrix; Identity matrix; Pentadiagonal matrix; Permutation matrix; Reverse Cuthill-McKee algorithm; Shear matrix; Shift matrix; Single-entry matrix; Skyline matrix; Sparse matrix; Tridiagonal matrix; Zero matrix