Comparison of Two Algorithms for Solving Large Linear Systems

DOI10.1137/0903032zbMath0491.65017OpenAlexW1977449075MaRDI QIDQ3953081

Jerzy Wasniewski, Kjeld Schaumburg, Zahari Zlatev

Publication date: 1982

Published in: SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0903032

zbMATH Keywords

sparse matricesGaussian eliminationmatrix generatorsiterative refinementleast-squares problemsfill-inspivotal strategyaugmented matricesaccuracy requirementsdrop- tolerancetest- matrices

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items

A survey of the advances in the exploitation of the sparsity in the solution of large problems, Solving large and sparse linear least-squares problems by conjugate gradient algorithms, Efficient implementation of stable Richardson extrapolation algorithms, Implementation of sparse matrix algorithms in an advection-diffusion-chemistry module, Comparison of two pivotal strategies in sparse plane rotations, A locally refined rectangular grid finite element method: Application to computational fluid dynamics and computational physics, General scheme for solving linear algebraic problems by direct methods, Exploiting the sparsity in the solution of linear ordinary differential equations

Uses Software

• Y12M