Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ SIAM Journal on Scie...arrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
SIAM Journal on Scientific Computing
Article . 2001 . Peer-reviewed
Data sources: Crossref
DBLP
Article
Data sources: DBLP
versions View all 3 versions
addClaim

This Research product is the result of merged Research products in OpenAIRE.

You have already added 0 works in your ORCID record related to the merged Research product.

Robust Parallel Smoothing for Multigrid Via Sparse Approximate Inverses

Robust parallel smoothing for multigrid via sparse approximate inverses
Authors: Oliver Bröker; Marcus J. Grote; Carsten Mayer; Arnold Reusken;

Robust Parallel Smoothing for Multigrid Via Sparse Approximate Inverses

Abstract

Sparse approximate inverses (SPAI) are matrices \(M=(m_1 , m_2, \ldots , m_n)\) with a given sparsity pattern such that \(|e_k - A m_k|\) is minimal for each \(k\). Explicitly known smoothers (or preconditioners) have the advantage that they are suitable for parallel computers in contrast to Gauss-Seidel or ILU. It is shown that SPAI(0), i.e. diagonal matrices of this type are better than damped Jacobi although there is no parameter in SPAI(0). There are also some results for lesss sparse cases.

Keywords

Iterative numerical methods for linear systems, Multigrid methods; domain decomposition for boundary value problems involving PDEs, Numerical computation of matrix norms, conditioning, scaling, Parallel numerical computation, Gauss-Seidel method, comparison of methods, smoothers, incomplete LU-factorization, preconditioners, Computational methods for sparse matrices, smoothing property, parallel computation, multigrid, sparse approximate inverses, damped Jacobi method

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    36
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
36
Top 10%
Top 10%
Top 10%
bronze