Y12M. Solution of large and sparse systems of linear algebraic equations. Documentation of subroutines

zbMath0461.65023MaRDI QIDQ1152682

Kjeld Schaumburg, Jerzy Wasniewski, Zahari Zlatev

Publication date: 1981

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

error estimatescondition numberGaussian eliminationiterative refinementdocumentation of subroutinespivotal interchangessoftware for large sparse systems

Mathematics Subject Classification ID

Factorization of matrices (15A23) Searching and sorting (68P10) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Linear transformations, semilinear transformations (15A04) Direct numerical methods for linear systems and matrix inversion (65F05) Linear equations (linear algebraic aspects) (15A06) Software, source code, etc. for problems pertaining to numerical analysis (65-04)

Related Items

A survey of the advances in the exploitation of the sparsity in the solution of large problems, Sparse linear problems and the least squares method, Experiences with sparse matrix solvers in parallel ODE software, Efficient implementation of stable Richardson extrapolation algorithms, Comparison of two pivotal strategies in sparse plane rotations, Minimal energy surfaces using parametric splines, Y12M, Maintaining LU factors of a general sparse matrix, Testing subroutines solving advection-diffusion equations in atmospheric environments, Practical quasi-Newton methods for solving nonlinear systems, Report on test matrices for generalized inverses, General scheme for solving linear algebraic problems by direct methods, Exploiting the sparsity in the solution of linear ordinary differential equations

Uses Software

• SPARSKS