Gaussian elimination as an iterative algorithm
Gaussian elimination (GE) for solving an $n \times n$ linear system of equations $Ax=b$ is the archetypical direct method of numerical linear algebra, as opposed to iterative. In this note we want to point out that GE has an iterative side too.
Main Authors: | Townsend, A, Trefethen, L |
---|---|
Format: | Report |
Published: |
SIAM
2013
|
Similar Items
-
Smoothed analysis of Gaussian elimination
by: Sankar, Arvind, 1976-
Published: (2005) -
A new iterative initialization of EM algorithm for Gaussian mixture models.
by: Jie You, et al.
Published: (2023-01-01) -
A new iterative initialization of EM algorithm for Gaussian mixture models
by: Jie You, et al.
Published: (2023-01-01) -
Safety guarantees for iterative predictions with Gaussian Processes
by: Polymenakos, K, et al.
Published: (2021) -
Smooth random functions, random ODEs, and Gaussian processes
by: Filip, S, et al.
Published: (2019)