Category:Numerical linear algebra
From HandWiki
Revision as of 08:32, 30 May 2021 by imported>LinXED (fixing)
Here is a list of articles in the Numerical linear algebra category of the Computing portal that unifies foundations of mathematics and computations using computers. 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 5 subcategories, out of 5 total.
D
- Domain decomposition methods (15 P)
E
- Exchange algorithms (12 P)
L
- Least squares (45 P)
M
S
- Sparse matrices (22 P)
Pages in category "Numerical linear algebra"
The following 127 pages are in this category, out of 127 total.
A
B
C
D
G
I
J
L
M
- Software:Mathcad
- Software:MATLAB
- Matrix multiplication
- Frobenius inner product
- Matrix multiplication algorithm
- Matrix splitting
- Matrix-free methods
- Method of Four Russians
- Minimal residual method
- Minimum degree algorithm
- MINRES
- Modal analysis using FEM
- Modified Richardson iteration
- Moore–Penrose inverse
P
R
S
- Samuelson–Berkowitz algorithm
- Software:SequenceL
- Singular value decomposition
- SLEPc
- Sparse approximation
- Software:Speakeasy (computational environment)
- SPIKE algorithm
- Stein-Rosenberg theorem
- Stieltjes matrix
- Stone method
- Stone's method
- Successive over-relaxation
- Symmetric successive over-relaxation
- System of linear equations
