Block steepest descent method based on nonoverlapping domain decomposition. I
convergenceiterative methoddiffusion equations finite element methodnonoverlapping domain decompositionquasi-uniform meshessteepest descentsystem of linear algebraic equations
Iterative numerical methods for linear systems (65F10) Heat equation (35K05) Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs (65M50) Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs (65M55) Finite element, Rayleigh-Ritz and Galerkin methods for initial value and initial-boundary value problems involving PDEs (65M60)
- scientific article; zbMATH DE number 3303571 (Why is no real title available?)
- Efficient iterative solvers for elliptic finite element problems on nonmatching grids
- Iterative methods for linear systems. Theory and applications
- Mixed and Hybrid Finite Element Methods
- The Construction of Preconditioners for Elliptic Problems by Substructuring. II
- Two-level preconditioners with projectors for unstructured grids
This page was built for publication: Block steepest descent method based on nonoverlapping domain decomposition. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q291191)