The rate of convergence of explicit approximate inverse preconditioning
From MaRDI portal
Publication:2710748
DOI10.1080/00207169608804476zbMath1001.65521OpenAlexW2064211634MaRDI QIDQ2710748
Publication date: 19 December 2002
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169608804476
rate of convergencepreconditioningapproximate factorizationboundary-value problemsapproximate inverses
Related Items
An approximate inverse matrix technique for arrowhead matrices, High performance inverse preconditioning, A Distributed Normalized Explicit Preconditioned Conjugate Gradient Method, Parallel \(N\)-body simulation based on the PM and P3M methods using multigrid schemes in conjunction with generic approximate sparse inverses, Explicit approximate inverse preconditioning techniques, GENERIC APPROXIMATE SPARSE INVERSE MATRIX TECHNIQUES, Explicit preconditioned domain decomposition schemes for solving nonlinear boundary value problems., On the GPGPU parallelization issues of finite element approximate inverse preconditioning, Preconditioning by approximations of the discrete Laplacian for 2‐D non‐linear free convection elliptic equations, Explicit isomorphic iterative methods for solving arrow-type linear systems, Approximate inverse banded matrix techniques, Explicit preconditioned conjugate gradient schemes for solving biharmonic equations
Cites Work
- Unnamed Item
- Unnamed Item
- Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors
- Implicit semi-direct methods based on root-free sparse factorization procedures
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- The rate of convergence of an approximate matrix factorization semi- direct method
- A class of explicit preconditioned conjugate gradient methods for solving large finite element systems
- A class of first order factorization methods
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES