Bi-CG: An effective solver for three fields domain decomposition method in parallel environments
DOI10.1016/J.AMC.2005.06.009zbMATH Open1091.65033OpenAlexW2054089597MaRDI QIDQ2489360FDOQ2489360
Authors: Yanyan Li
Publication date: 16 May 2006
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2005.06.009
Recommendations
- Suitable iterative methods for solving the linear system arising in the three fields domain decomposition method
- scientific article; zbMATH DE number 549877
- A domain decomposition method using efficient interface-acting preconditioners
- scientific article; zbMATH DE number 554605
- scientific article; zbMATH DE number 4213376
numerical examplespreconditioningGalerkin methodelliptic boundary value problemscomparison of methodsBi-Conjugate Gradient methodThree fields domain decomposition method
Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Substructuring preconditioners for the three fields domain decomposition method
- Iterative Solution Methods
- The Construction of Preconditioners for Elliptic Problems by Substructuring. I
- Multilevel preconditioning
- Title not available (Why is that?)
Cited In (2)
This page was built for publication: Bi-CG: An effective solver for three fields domain decomposition method in parallel environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489360)