A unified approach to parallel space decomposition methods

DOI10.1016/S0377-0427(99)00235-6zbMath0936.65071WikidataQ126773539 ScholiaQ126773539MaRDI QIDQ1807777

Rosemary A. Renaut, Andreas Frommer

Publication date: 22 May 2000

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

convergencefinite elementsparallel computationminimizationsplitting methodsblock Jacobi methodlinear least squaresblock SOR methodmultisplittingsconvex functionalscoordinate descent methodalgebraic Schwarz methodsspace decomposition methodsvariable distribution method

Mathematics Subject Classification ID

Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items

A scalable quasi-Newton estimation algorithm for dynamic generalised linear models, Decomposition in derivative-free optimization, FEM and BEM parallel processing: theory and applications – a bibliography (1996‐2002)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of relaxed parallel multisplitting methods
• On the theory and practice of multisplitting methods in parallel computation
• New inexact parallel variable distribution algorithms
• Multisplitting of a Symmetric Positive Definite Matrix
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Parallel Constraint Distribution
• Iterative Methods by Space Decomposition and Subspace Correction
• Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
• Parallel Variable Distribution
• On the Convergence of Constrained Parallel Variable Distribution Algorithms
• A parallel multisplitting solution of the least squares problem