Category
page 1Numerical linear algebra
MATLAB
MATLAB (Matrix Laboratory) is a proprietary multi-paradigm programming language and numeric computing environment developed by MathWorks. MATLAB allows matrix manipulations, plotting of functions and data, implementation of algorithms, creation of user interfaces, and interfacing with programs written in other languages.
system of linear equations
collection of linear equations involving the same set of variables

Gaussian elimination
algorithm for solving systems of linear equations
triangular matrix
special kind of square matrix
matrix multiplication
mathematical operation in linear algebra
Julia
high-performance dynamic programming language
kernel
inverse image of zero under a linear map
LU decomposition
matrix decomposition
Vandermonde matrix
Mathematical concept
Gauss–Seidel method
iterative method used to solve a linear system of equations
Mathcad
Mathcad is computer software for the verification, validation, documentation and re-use of mathematical calculations in engineering and science, notably mechanical, chemical, electrical, and civil engineering. Released in 1986 for MS-DOS, it introduced live editing (WYSIWYG) of typeset mathematical notation in an interactive notebook, combined with automatic computations. It was originally developed by Mathsoft, and since 2006 has been a product of Parametric Technology Corporation.
QR decomposition
matrix decomposition
singular value decomposition
matrix decomposition
Jacobi method
iterative method used to solve a linear system of equations
numerical linear algebra
subfield of numerical analysis and a type of linear algebra
LINPACK
LINPACK is a software library for performing numerical linear algebra on digital computers.
Cholesky decomposition
matrix decomposition
Householder transformation
linear transformation that describes a reflection about a plane or hyperplane containing the origin
Hilbert matrix
square matrix whose entries are unit fractions of special form
row echelon form
possible form of a matrix
diagonally dominant matrix
matrix in which the magnitude of the diagonal entry in a row is no less than the sum of the magnitudes of the nondiagonal entries in that row
conjugate gradient method
method to compute systems of linear equations whose matrix is symmetric positive-definite
circulant matrix
matrix in which each row is rotated one position to the right from the previous row
LAPACK
LAPACK ("Linear Algebra Package") is a standard software library for numerical linear algebra. It provides routines for solving systems of linear equations and linear least squares, eigenvalue problems, and singular value decomposition. It also includes routines to implement the associated matrix factorizations such as LU, QR, Cholesky and Schur decomposition. LAPACK was originally written in FORTRAN 77, but moved to Fortran 90 in version 3.2 (2008). The routines handle both real and complex matrices in both single and double precision. LAPACK relies on an underlying BLAS implementation to pro
Basic Linear Algebra Subprograms
routines for performing common linear algebra operations
basis function
element of a basis for a function space
Givens rotation
rotation in the plane spanned by two coordinates axes
tridiagonal matrix algorithm
variant of Gaussian elimination for solving tridiagonal systems of equations
QR algorithm
numerical linear algebra algorithm
successive over-relaxation
method of solving a linear system of equations
Krylov subspace
Moore–Penrose inverse
given a matrix A, the unique matrix B such that ABA = A, BAB = B, and that AB and BA are both Hermitian
power iteration
eigenvalue algorithm
Jacobi eigenvalue algorithm
iterative method for computing eigenvalues and eigenvectors of a real symmetric matrix
Lanczos algorithm
numerical method for find eigenvalues
Inverse iteration
Mathematical algorithm
eigenvalue algorithm
efficient and stable algorithms for finding the eigenvalues of a matrix
preconditioner
In mathematics, preconditioning is the application of a transformation, called the preconditioner, that conditions a given problem into a form that is more suitable for numerical solving methods. Preconditioning is typically related to reducing a condition number of the problem. The preconditioned problem is then usually solved by an iterative method.
pivot element
non-zero element of a matrix selected by an algorithm
matrix multiplication algorithm
algorithm to multiply matrices
least-squares spectral analysis
frequency-domain analysis method

Frobenius inner product
Binary operation, takes two matrices and returns a scalar

matrix splitting
representation of a matrix as a sum
Bareiss algorithm
Algorithm for calculating determinants
Gradient method
Generalized minimal residual method
iterative method for the numerical solution of a nonsymmetric system of linear equations