scientific article; zbMATH DE number 3879987

From MaRDI portal
Publication:3345669





[For the entire collection see Zbl 0546.00028.] Newly developed approximate factorization methods based on approximations of the inverses of diagonal block matrices, are vectorizable to a large extent and at the same time possess a low order of computational complexity. Two variants of such methods are discussed: i) For block matrices ordered lexicographically; ii) For block matrices ordered according to a cyclic reduction (odd-even) method. We extend these methods for the application to partial differential equations in three space dimensions.











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