A three-dimensional explicit preconditioned solver
DOI10.1016/0898-1221(96)00108-3zbMath0858.65037OpenAlexW2058780824MaRDI QIDQ1816685
George A. Gravvanis, Elias A. Lipitakis
Publication date: 25 March 1997
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(96)00108-3
preconditioningelliptic partial differential equationsgeneralized inverseFortran subroutinesfinite difference systemslarge sparse unsymmetric matricesexplicit preconditioned iterative methods\(LU\)-sparse factorizationapproximate matrix inversiongeneralized approximate inverse matrix techniques
Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite difference methods for boundary value problems involving PDEs (65N06) Software, source code, etc. for problems pertaining to linear algebra (15-04)
Related Items (6)
Uses Software
Cites Work
- Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors
- Solving non-linear elliptic difference equations by extendable sparse factorization procedures
- A sparse linear equations solver for 3D-regular domains
- On computing the inverse of a sparse matrix
- On a class of preconditioned iterative methods on parallel computers
- CGS, A Fast Lanczos-Type Solver for Nonsymmetric Linear systems
- A class of explicit preconditioned conjugate gradient methods for solving large finite element systems
This page was built for publication: A three-dimensional explicit preconditioned solver