Marching Algorithms and Block Gaussian Elimination
Review articleOpen access

AbstractFast direct methods incorporating marching techniques are considered from the viewpoint of sparse Gaussian elimination. It is shown that the algorithms correspond to the nonstandard block backsolution of particular LU decompositions.

Request full text

References (0)

Cited By (0)

No reference data.
No citation data.
Join Copernicus Academic and get access to over 12 million papers authored by 7+ million academics.
Join for free!