Linear and multilinear algebra; matrix theory Systems of linear equations Concept
System of linear equations
Summary
A system of linear equations is a finite collection of linear equations in the same unknowns. A solution of the system is a solution of all the equations at the same time.
Where this leads
24 pages build on this one.
- Derivation of the conjugate gradient method
- Conjugate residual method
- Minimal residual method
- Levinson recursion
- Successive over-relaxation
- Modified Richardson iteration
- Alternating-direction implicit method
- Generalized minimal residual method
- Multigrid method
- Conjugate gradient method
- Jacobi method
- Iterative method
- Kaczmarz method
- Tridiagonal matrix algorithm
- Gauss–Seidel method
- Biconjugate gradient method
- Sparse approximation
- Biconjugate gradient stabilized method
- Radial basis function interpolation
- Chebyshev iteration
- Iterative refinement
- Domain decomposition methods
- Preconditioner
- Symmetric successive over-relaxation
Further reading
About this page
| Tag | 0GT4WWGWH2 |
|---|---|
| URI | m2://0GT4WWGWH2 |
| Kind | concept |
| Writing | W1 stated |
| MSC | 15A06 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
Special cases
Definitions
Results about this
Used by
- Levinson recursion
- Successive over-relaxation
- Modified Richardson iteration
- Conjugate gradient method
- Jacobi method
- Iterative method
- Kaczmarz method
- Tridiagonal matrix algorithm
- Gauss–Seidel method
- Sparse approximation
- Radial basis function interpolation
- Chebyshev iteration
- Iterative refinement
- Domain decomposition methods
- Preconditioner
- Symmetric successive over-relaxation