Explicit preconditioned iterative methods for solving large unsymmetric finite element systems

DOI10.1007/BF02238130zbMath0823.65033OpenAlexW1564269962MaRDI QIDQ1345431

George A. Gravvanis, Elias A. Lipitakis

Publication date: 6 November 1995

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02238130

zbMATH Keywords

numerical resultsfinite elementparallel computationinitial-boundary value problemsmultiprocessor systemslarge sparse unsymmetric matricesexplicit preconditioned iterative methodsgeneralized approximate inverse matrixLU-sparse factorization

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) Initial value problems for second-order parabolic equations (35K15)

Related Items (7)

High performance inverse preconditioning ⋮ 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 ⋮ High performance finite element approximate inverse preconditioning ⋮ A performance study of normalized explicit finite element approximate inverse preconditioning on uniprocessor and multicomputer systems

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

This page was built for publication: Explicit preconditioned iterative methods for solving large unsymmetric finite element systems