1998Purdue e-Pubs (Purdue University System)Open access

Parallel Solution of Large Sparse Linear Systems by a Balance Scheme Preconditioner

Tzvetan Ostromsky, Ahmed Sameh, V. Sarin

Open full text 0 citations

Abstract

A parallel algorithm for preconditioning large and sparse linear systems is proposed.Both structural and numerical dropping are used to construct a prcconditioner with proper structure.The Balance method is used to solve the linear system involving such preconditioner in each iteration.The algorithm can be used together with any iterative method (GMRES is used for the experiments in this paper).As shown by numerical experiments, this approach is quite robust Imd has attractive parallel performance.It has been sllccessful in solving quickly, and accurately, some ill-conditioned systems, which proved to be difficult for othcr preconditioned iterativc methods.

Open-access reader

About this research paper

What this paper is about

A parallel algorithm for preconditioning large and sparse linear systems is proposed.Both structural and numerical dropping are used to construct a prcconditioner with proper structure.The Balance method is used to solve the linear system involving such preconditioner in each iteration.The algorithm can be used together with any iterative method (GMRES is used for the experiments in this paper).As shown by numerical experiments, this approach is quite robust Imd has attractive parallel performance.It has been sllccessful in solving quickly, and accurately, some ill-conditioned systems, which proved to be difficult for othcr preconditioned iterativc methods.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

A parallel algorithm for preconditioning large and sparse linear systems is proposed.Both structural and numerical dropping are used to construct a prcconditioner with proper structure.The Balance method is used to solve the linear system involving such preconditioner in each iteration.The algorithm can be used together with any iterative method (GMRES is used for the experiments in this paper).As shown by numerical experiments, this approach is quite robust Imd has attractive parallel performance.It has been sllccessful in solving quickly, and accurately, some ill-conditioned systems, which proved to be difficult for othcr preconditioned iterativc methods.

Key concepts: Preconditioner, Generalized minimal residual method, Linear system, Iterative method, Computer science, Algorithm, Mathematics, Mathematical optimization

Related papers

Back to paper searchBrowse research topicsOriginal source
Parallel Solution of Large Sparse Linear Systems by a Balance Scheme Preconditioner — Research Paper | ScholarLens