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.
Recommendations
- Fully vectorizable block preconditionings with approximate inverses for non-symmetric systems of equations
- Finite-element based sparse approximate inverses for block-factorized preconditioners
- Vectorizable preconditioners for elliptic difference equations in three space dimensions
- Explicit preconditioned methods for solving 3d boundary-value problems by approximate inverse finite element matrix techniques
- scientific article; zbMATH DE number 4074338
Cited in
(15)- A survey of preconditioned iterative methods for linear systems of algebraic equations
- On approximate factorization methods for block matrices suitable for vector and parallel processors
- Analysis of incomplete matrix factorizations as multigrid smoothers for vector and parallel computers
- A general incomplete block-matrix factorization method
- Vectorizable preconditioners for elliptic difference equations in three space dimensions
- Scalable preconditioned conjugate gradient inversion of vector finite element mass matrices
- Macro-elementwise preconditioning methods
- Incomplete blockwise factorizations of (block) H-matrices
- Efficient preconditioning of \(h p\)-FEM matrix sequences with slowly-varying coefficients: an application to topology optimization
- Algorithms for construction of preconditioners based on incomplete block-factorizations of the matrix
- Adaptation of a Two-Point Boundary Value Problem Solver to a Vector-Multiprocessor Environment
- High-performance equation solvers and their impact on finite element analysis
- Numerical comparison of preconditionings for large sparse finite element problems
- An introduction to the NSPCG software package
- Finite-element based sparse approximate inverses for block-factorized preconditioners
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)