Block steepest descent method based on nonoverlapping domain decomposition. I

DOI10.1515/rnam-2016-0017zbMath1339.65176OpenAlexW2477191153MaRDI QIDQ291191

Yuri A. Kuznetsov

Publication date: 7 June 2016

Published in: Russian Journal of Numerical Analysis and Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/rnam-2016-0017

zbMATH Keywords

convergenceiterative methodsteepest descentsystem of linear algebraic equationsdiffusion equations finite element methodnonoverlapping domain decompositionquasi-uniform meshes

Mathematics Subject Classification ID

Heat equation (35K05) Iterative numerical methods for linear systems (65F10) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50)

Cites Work

• Unnamed Item
• Iterative Methods for Linear Systems
• The Construction of Preconditioners for Elliptic Problems by Substructuring. II
• Mixed and Hybrid Finite Element Methods
• Two-level preconditioners with projectors for unstructured grids
• Efficient iterative solvers for elliptic finite element problems on nonmatching grids

This page was built for publication: Block steepest descent method based on nonoverlapping domain decomposition. I