Domain decomposition for parallel row projection algorithms

DOI10.1016/0168-9274(91)90071-7MaRDI QIDQ1181532zbMATH OpenOpenAlexFDO

Authors S. Singh

Publication date 27 June 1992

Published in Applied Numerical Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0168-9274(91)90071-7

zbMATH Keywords

domain decompositionfinite differencesfinite elementsnonsymmetric matricesparallel computationrow projection methodstest problem

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Iterative numerical methods for linear systems (65F10) Finite difference methods for boundary value problems involving PDEs (65N06) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Parallel numerical computation (65Y05)

Review text

It is shown that for nonsymmetric matrices arising from finite differences or finite elements applied to partial differential equations a domain decomposition approach gives row projection methods and allows parallelism in computing orthogonal projections \(P_ iv=A_ i(A^ T_ iA_ i)^{-1}A^ T_ iv\). (\(A\) is partitioned into block rows \(A^ T_ i\)). Criteria for suitable row partitioning are discussed. Suitable row partitioning allows parallelism in the computation, creates subproblems that can be solved efficiently and gives numerically well behaved subproblems. The domain decomposition approach provides row partitionings that satisfy all of the criteria. Four test problems involving second order elliptic partial differential equations are computed and the results tabulated.

Recommendations

• PROJECTION DOMAIN DECOMPOSITION METHOD
• scientific article; zbMATH DE number 4115936
• scientific article; zbMATH DE number 218295
• Domain decomposition techniques for the parallel solution of nonsymmetric systems of elliptic boundary value problems

Cites work

• A projection method for solving nonsymmetric linear systems on multiprocessors
• Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
• scientific article; zbMATH DE number 3856876 (Why is no real title available?)
• scientific article; zbMATH DE number 3727495 (Why is no real title available?)
• Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
• Iterative Methods for Cyclically Reduced Non-Self-Adjoint Linear Systems
• On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
• Row Projection Methods for Large Nonsymmetric Linear Systems
• Row-Action Methods for Huge and Sparse Systems and Their Applications

Cited in

(6)

• The row/column pivoting strategy on multicomputers
• Dimension-wise decompositions and their efficient parallelization
• Explicitly preconditioned conjugate gradient method for the solution of unsymmetric linear systems
• Parallel ART for image reconstruction in CT using processor arrays
• GPU computing with Kaczmarz's and other iterative algorithms for linear systems
• CARP-CG: A robust and efficient parallel solver for linear systems, applied to strongly convection dominated PDEs

Describes a project that uses

Uses Software

• LSODA

This page was built for publication: Domain decomposition for parallel row projection algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1181532)