Explicit preconditioned iterative methods for solving large unsymmetric finite element systems
DOI10.1007/BF02238130zbMath0823.65033MaRDI QIDQ1345431
Elias A. Lipitakis, George A. Gravvanis
Publication date: 6 November 1995
Published in: Computing (Search for Journal in Brave)
numerical results; finite element; parallel computation; initial-boundary value problems; multiprocessor systems; large sparse unsymmetric matrices; explicit preconditioned iterative methods; generalized approximate inverse matrix; LU-sparse factorization
65F50: Computational methods for sparse matrices
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
65M60: Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs
35K15: Initial value problems for second-order parabolic equations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors
- Solving elliptic boundary-value problems on parallel processors by approximate inverse matrix semi-direct methods based on the multiple explicit Jacobi iteration
- Solving non-linear elliptic difference equations by extendable sparse factorization procedures
- Approximating the inverse of a matrix for use in iterative algorithms on vector processors
- A normalized implicit conjugate gradient method for the solution of large sparse systems of linear equations
- On computing the inverse of a sparse matrix
- On a class of preconditioned iterative methods on parallel computers
- Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- Compact Computation of the Inverse of a Matrix
