Explicit preconditioned methods for solving 3d boundary-value problems by approximate inverse finite element matrix techniques
From MaRDI portal
Publication:4876342
DOI10.1080/00207169508804389zbMath0846.65009OpenAlexW2135471024MaRDI QIDQ4876342
Publication date: 1 May 1996
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169508804389
finite element methodpreconditioningfactorization algorithmslarge scale symmetric matrices of irregular structure
Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)
Related Items
An approximate inverse matrix technique for arrowhead matrices, Explicit approximate inverse preconditioning techniques, Explicit preconditioned domain decomposition schemes for solving nonlinear boundary value problems., 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
- Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors
- A survey of preconditioned iterative methods for linear systems of algebraic equations
- Parallel S.O.R. iterative methods
- On computing the inverse of a sparse matrix
- On a class of preconditioned iterative methods on parallel computers
- Block Preconditioning for the Conjugate Gradient Method
- A class of explicit preconditioned conjugate gradient methods for solving large finite element systems
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
- Compact Computation of the Inverse of a Matrix
