scientific article; zbMATH DE number 176382

From MaRDI portal
Publication:4035530





[For the entire collection see Zbl 0753.00017.] A method for solving triangular systems of algebraic equations with a sparse matrix structure is presented. The partitioning principle is adopted with introducing a best ordering. The optimality of the algorithm for the case when the inverse is represented as a product of a few sparse factors is proved. The solver is applied to several problems where sparse solvers occur. The algorithm is implemented on a Connection Machine.











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 Q4035530)