On the theory and practice of multisplitting methods in parallel computation

DOI10.1007/BF02238650zbMath0763.65019OpenAlexW1575473552MaRDI QIDQ1195794

Günter Mayer, Andreas Frommer

Publication date: 13 January 1993

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02238650

zbMATH Keywords

convergencenumerical resultsparallel computationcomparison theoremsGauss-Seidel methodsGauss-Seidel multisplittingsparallel multisplitting methods

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items

ROBUST PRECONDITIONERS FOR LINEAR ELASTICITY FEM ANALYSES, A multisplitting method for symmetric linear complementarity problems, Nonstationary parallel relaxed multisplitting methods, A note on the inner-outer iterative method for solving the linear equation \(Ax = b\), Convergence theorems for parallel alternating iterative methods., Unnamed Item, A note on parallel multisplitting TOR method forH-matrices, Convergence of non-stationary parallel multisplitting methods for hermitian positive definite matrices, Asynchronous multisplitting iteration with different weighting schemes, Global relaxed non-stationary multisplitting multi-parameter methods, The spectral analysis of the matrix multisplitting method for the one-dimensional model problem, A unified approach to parallel space decomposition methods, Sequential and parallel synchronous alternating iterative methods, GRPM-style methods and comparisons of convergent and divergent rates, Convergence of relaxed parallel multisplitting methods with different weighting schemes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of parallel multisplitting iterative methods for M-matrices
• On the convergence of the parallel multisplitting AOR algorithm
• Block colouring schemes for the SOR method on local memory parallel computers
• Models of parallel chaotic iteration methods
• Additive polynomial preconditions for parallel computers
• Comparisons of weak regular splittings and multisplitting methods
• Convergence of relaxed parallel multisplitting methods
• Parallel algorithms and architectures for multisplitting iterative methods
• Efficiency of some parallel numerical algorithms on distributed systems
• Parallel interval multisplittings
• NOTE ON M-MATRICES
• Multisplitting of a Symmetric Positive Definite Matrix
• Multi-Splittings of Matrices and Parallel Solution of Linear Systems
• Multisplitting with Different Weighting Schemes