Category:Numerical linear algebra
Wikimedia Commons has media related to Numerical linear algebra.
Numerical linear algebra is the intersection of numerical analysis and linear algebra: its purpose is the design and analysis of algorithms for the numerical solution of matrix problems. The most important problems are the solution of a system of linear equations and the determination of eigenvalues.
Subcategories
This category has the following 7 subcategories, out of 7 total.
D
- Domain decomposition methods (15 P)
E
- Exchange algorithms (10 P)
L
- Least squares (40 P)
M
R
S
- Sparse matrices (20 P)
Pages in category "Numerical linear algebra"
The following 122 pages are in this category, out of 122 total. This list may not reflect recent changes.
A
B
C
D
G
I
L
M
O
P
R
S
- Samuelson–Berkowitz algorithm
- SequenceL
- Singular value decomposition
- SLEPc
- Sparse approximation
- Speakeasy (computational environment)
- SPIKE algorithm
- Stein-Rosenberg theorem
- Stieltjes matrix
- Stone's method
- Successive over-relaxation
- Symbolic Cholesky decomposition
- Symmetric successive over-relaxation
- System of linear equations
