Multipreconditioning for nonsymmetric problems: the case of orthomin and biCG

DOI10.1016/j.crma.2017.01.010zbMath1360.65091OpenAlexW2586373973MaRDI QIDQ517508

Pierre Gosselet, Christophe Bovet, Nicole Spillane

Publication date: 23 March 2017

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.crma.2017.01.010

zbMATH Keywords

algorithmpreconditioningKrylov subspace methodsbi-conjugate gradientfinite element tearing and interconnecting domain decomposition methodorthomin

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Preconditioners for iterative methods (65F08)

Related Items (2)

On the use of graph centralities to compute generalized inverse of singular finite element operators: Applications to the analysis of floating substructures ⋮ Analysis, improvement and limits of the multiscale Latin method

Cites Work

• Automatic spectral coarse spaces for robust finite element tearing and interconnecting and balanced domain decomposition algorithms
• Simultaneous FETI and block FETI: Robust domain decomposition with multiple search directions
• A method of finite element tearing and interconnecting and its parallel solution algorithm
• Algebraic Adaptive Multipreconditioning Applied to Restricted Additive Schwarz
• A Multipreconditioned Conjugate Gradient Algorithm
• An Adaptive MultiPreconditioned Conjugate Gradient Algorithm
• Unnamed Item

This page was built for publication: Multipreconditioning for nonsymmetric problems: the case of orthomin and biCG