Explicit semi-direct methods based on approximate inverse matrix techniques for solving boundary-value problems on parallel processors

DOI10.1016/0378-4754(87)90062-0zbMath0625.65019OpenAlexW2046444904MaRDI QIDQ579835

Elias A. Lipitakis, David J. Evans

Publication date: 1987

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-4754(87)90062-0

zbMATH Keywords

preconditioningLU-factorizationGauss-Jordan eliminationgeneralized approximate inverse matrix techniqueincomplete direct methodsparallel processor

Mathematics Subject Classification ID

Factorization of matrices (15A23) Numerical computation of matrix norms, conditioning, scaling (65F35) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22)

Related Items

High performance inverse preconditioning, Explicit preconditioned iterative methods for solving large unsymmetric finite element systems, Parallel \(N\)-body simulation based on the PM and P3M methods using multigrid schemes in conjunction with generic approximate sparse inverses, Numerical solution of three-dimensional boundary-value problems by generalized approximate inverse matrix techniques, A class of explicit preconditioned conjugate gradient methods for solving large finite element systems, Explicit approximate inverse preconditioning techniques, GENERIC APPROXIMATE SPARSE INVERSE MATRIX TECHNIQUES, Explicit preconditioned methods for solving 3d boundary-value problems by approximate inverse finite element matrix techniques, On the GPGPU parallelization issues of finite element approximate inverse preconditioning, The rate of convergence of explicit 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, A Class of Symmetric Factored Approximate Inverses and Hybrid Two-Level Solver, A three-dimensional explicit preconditioned solver, Solving elliptic boundary-value problems on parallel processors by approximate inverse matrix semi-direct methods based on the multiple explicit Jacobi iteration

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized extended to the limit sparse factorization techniques for solving unsymmetric finite element systems
• Solving non-linear elliptic difference equations by extendable sparse factorization procedures
• The rate of convergence of an approximate matrix factorization semi- direct method
• 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
• Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
• An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
• A class of first order factorization methods
• Iterative Solution of Implicit Approximations of Multidimensional Partial Differential Equations
• On the Product Form of Inverses of Sparse Matrices
• The Product Form for the Inverse in the Simplex Method