Greedy and randomized versions of the multiplicative Schwarz method
DOI10.1016/J.LAA.2012.04.052zbMATH Open1251.65048OpenAlexW2074130980MaRDI QIDQ445816FDOQ445816
Authors: Michael Griebel, Peter Oswald 
Publication date: 27 August 2012
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.04.052
Recommendations
- A sharp convergence estimate for the method of subspace corrections for singular systems of equations
- The method of subspace corrections
- On the nonlinear domain decomposition method
- Randomized and fault-tolerant method of subspace corrections
- New estimates for the rate of convergence of the method of subspace corrections
- A theoretical overview of Krylov subspace methods
- Global and uniform convergence of subspace correction methods for some convex optimization problems
- Optimal scaling parameters for sparse grid discretizations.
- Stochastic subspace correction methods and fault tolerance
- Multigrid methods for symmetric variational problems: A general theory and convergence estimates for usual smoothers
numerical resultsfinite elementsPoisson equationexponential convergenceToeplitz systemgreedy and randomized ordersHilbert space splittingslarge linear systemmultiplicative Schwarz methodsSouthwell methodsubspace corrections
Iterative numerical methods for linear systems (65F10) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Toeplitz, Cauchy, and related matrices (15B05) Stability and convergence of numerical methods for boundary value problems involving PDEs (65N12) Numerical solution of discretized equations for boundary value problems involving PDEs (65N22) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites Work
- Asynchronous Fast Adaptive Composite-Grid Methods: Numerical Results
- A randomized Kaczmarz algorithm with exponential convergence
- Approximation and learning by greedy algorithms
- Title not available (Why is that?)
- Nonlinear methods of approximation
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Randomized methods for linear constraints: convergence rates and conditioning
- Greedy approximation
- Iterative Methods by Space Decomposition and Subspace Correction
- The method of alternating projections and the method of subspace corrections in Hilbert space
- Multilevel Algorithms Considered as Iterative Methods on Semidefinite Systems
- Title not available (Why is that?)
- Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach
- Acceleration of randomized Kaczmarz method via the Johnson-Lindenstrauss lemma
- Randomized Kaczmarz solver for noisy linear systems
- Asynchronous Fast Adaptive Composite-Grid Methods for Elliptic Problems: Theoretical Foundations
- Gradient Pursuits
- Title not available (Why is that?)
- On the convergence of the coordinate descent method for convex differentiable minimization
- On the abstract theory of additive and multiplicative Schwarz algorithms
- On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
- On the convergence rate of SOR: A worst case estimate
- Fully Adaptive Multigrid Methods
- Title not available (Why is that?)
- Convergence rate analysis of an asynchronous space decomposition method for convex Minimization
- Stagewise Weak Gradient Pursuits
- Title not available (Why is that?)
Cited In (22)
- Schwarz iterative methods: infinite space splittings
- Greedy randomized sampling nonlinear Kaczmarz methods
- Convergence of a randomized Douglas-Rachford method for linear system
- Stochastic subspace correction in Hilbert space
- On Adaptive Sketch-and-Project for Solving Linear Systems
- On multi-step randomized extended Kaczmarz method for solving large sparse inconsistent linear systems
- Stochastic subspace correction methods and fault tolerance
- On convergence rates of Kaczmarz-type methods with different selection rules of working rows
- Greedy PSB methods with explicit superlinear convergence
- Convergence analysis for Kaczmarz-type methods in a Hilbert space framework
- Fault Resilient Domain Decomposition Preconditioner for PDEs
- On the convergence of randomized and greedy relaxation schemes for solving nonsingular linear systems of equations
- Greedy algorithms for optimizing multivariate Horner schemes
- Subspace correction methods in algebraic multi-level frames
- Adaptively sketched Bregman projection methods for linear systems
- Triangular truncation and its extremal matrices
- A Sampling Kaczmarz--Motzkin Algorithm for Linear Feasibility
- On convergence rate of the randomized Gauss-Seidel method
- Randomized and fault-tolerant method of subspace corrections
- On the algebraic construction of sparse multilevel approximations of elliptic tensor product problems
- Optimal scaling parameters for sparse grid discretizations
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
Uses Software
This page was built for publication: Greedy and randomized versions of the multiplicative Schwarz method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q445816)
