A unified approach to parallel space decomposition methods
The authors consider (relaxed) additive and multiplicative iterative space decomposition methods for the minimization of sufficiently smooth functionals without constraints. They develop a general framework which unifies existing approaches from both parallel optimization and finite elements. Especially this work unifies earlier research on the parallel variable distribution method in minimization, space decomposition methods for convex functionals, algebraic Schwarz methods for linear systems and splitting methods for linear least squares. The authors develop a general convergence theory within this framework, which provides several new results as well as including known convergence results.
- scientific article; zbMATH DE number 701866
- scientific article; zbMATH DE number 2110678
- Parallel Processing and Applied Mathematics
- Dimension-wise decompositions and their efficient parallelization
- Parallel synchronous and asynchronous space-decomposition algorithms for large-scale minimization problems
- Parallel Space Decomposition of the Mesh Adaptive Direct Search Algorithm
- Parallel algorithm for unconstrained optimization based on decomposition techniques
- A nested decomposition algorithm for parallel computations of very large sparse systems
- Parallelization of triangular decompositions: techniques and implementation
- Publication:4945814
- A parallel multisplitting solution of the least squares problem
- Convergence of relaxed parallel multisplitting methods
- scientific article; zbMATH DE number 989459 (Why is no real title available?)
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Iterative Methods by Space Decomposition and Subspace Correction
- Multi-Splittings of Matrices and Parallel Solution of Linear Systems
- Multisplitting of a Symmetric Positive Definite Matrix
- New inexact parallel variable distribution algorithms
- On the Convergence of Constrained Parallel Variable Distribution Algorithms
- On the theory and practice of multisplitting methods in parallel computation
- Parallel Constraint Distribution
- Parallel Variable Distribution
- Rate of Convergence of Some Space Decomposition Methods for Linear and Nonlinear Problems
- Decomposition in derivative-free optimization
- Non-monotone space decomposition methods for minimization problems
- scientific article; zbMATH DE number 701866 (Why is no real title available?)
- FEM and BEM parallel processing: theory and applications – a bibliography (1996‐2002)
- scientific article; zbMATH DE number 2152069 (Why is no real title available?)
- scientific article; zbMATH DE number 1424565 (Why is no real title available?)
- A scalable quasi-Newton estimation algorithm for dynamic generalised linear models
- Parallel Processing and Applied Mathematics
- A novel parallel approach for solving some free boundary value problems
This page was built for publication: A unified approach to parallel space decomposition methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807777)
