Efficient domain decomposition preconditioning for the hierarchical \(p\)-version. I

DOI10.3103/S1066369X0905003XzbMath0983.65132OpenAlexW2019338898MaRDI QIDQ1589038

R. Smith

Publication date: 7 March 2001

Published in: Russian Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1066369x0905003x

zbMATH Keywords

algorithmsSchur complementdomain decompositionpreconditionersDirichlet boundary value problemcondition numberssecond-order elliptic equations\(p\)-version finite element method

Mathematics Subject Classification ID

Multigrid methods; domain decomposition for boundary value problems involving PDEs (65N55) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35)

Cites Work

• Guiding-like functions for periodic or bounded solutions of ordinary differential equations.
• Periodic or bounded solutions of Carathéodory systems of ordinary differential equations
• Nonsmooth generalized guiding functions for periodic differential inclusions
• Topological degree methods in multi-valued boundary value problems
• Topological degree and periodic solutions of differential inclusions
• Guiding Functions and Periodic Solutions to Functional Differential Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient domain decomposition preconditioning for the hierarchical \(p\)-version. I