scientific article; zbMATH DE number 4117735

From MaRDI portal
Publication:4732027





[For the entire collection see Zbl 0676.00007.] Current techniques for the general-purpose treatment of sparse matrices are reviewed. Both direct and iterative methods for solving large sparse sets of linear algebraic equations are considered. Choosing suitable storage schemes, organizing the computation, finding permutations yielding a desirable form, numerical stability and checking the validity of the result are included. Eigenvalue problems (Lanczos algorithm) and least-squares calculations are mentioned.





Cited in
(74)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4732027)