- Algebra
- >
- Linear algebra
- >
- Numerical linear algebra
- >
- Relaxation (iterative methods)

- Algorithms
- >
- Numerical analysis
- >
- Iterative methods
- >
- Relaxation (iterative methods)

- Algorithms
- >
- Numerical analysis
- >
- Numerical linear algebra
- >
- Relaxation (iterative methods)

- Approximations
- >
- Numerical analysis
- >
- Iterative methods
- >
- Relaxation (iterative methods)

- Approximations
- >
- Numerical analysis
- >
- Numerical linear algebra
- >
- Relaxation (iterative methods)

- Computational mathematics
- >
- Numerical analysis
- >
- Iterative methods
- >
- Relaxation (iterative methods)

- Computational mathematics
- >
- Numerical analysis
- >
- Numerical linear algebra
- >
- Relaxation (iterative methods)

- Fields of mathematical analysis
- >
- Numerical analysis
- >
- Iterative methods
- >
- Relaxation (iterative methods)

- Fields of mathematical analysis
- >
- Numerical analysis
- >
- Numerical linear algebra
- >
- Relaxation (iterative methods)

- Mathematics of computing
- >
- Numerical analysis
- >
- Iterative methods
- >
- Relaxation (iterative methods)

- Mathematics of computing
- >
- Numerical analysis
- >
- Numerical linear algebra
- >
- Relaxation (iterative methods)

Relaxation (iterative method)

In numerical mathematics, relaxation methods are iterative methods for solving systems of equations, including nonlinear systems. Relaxation methods were developed for solving large sparse linear syst

Successive over-relaxation

In numerical linear algebra, the method of successive over-relaxation (SOR) is a variant of the Gauss–Seidel method for solving a linear system of equations, resulting in faster convergence. A similar

Jacobi method

In numerical linear algebra, the Jacobi method is an iterative algorithm for determining the solutions of a strictly diagonally dominant system of linear equations. Each diagonal element is solved for

Convergent matrix

In linear algebra, a convergent matrix is a matrix that converges to the zero matrix under matrix exponentiation.

Matrix splitting

In the mathematical discipline of numerical linear algebra, a matrix splitting is an expression which represents a given matrix as a sum or difference of matrices. Many iterative methods (for example,

Gauss–Seidel method

In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a system of linear equations. It

© 2023 Useful Links.