Galerkin method and optimal error algorithms in Hilbert spaces

DOI10.1007/BF01386393zbMath0672.65030MaRDI QIDQ1120253

Zbigniew Leyk

Publication date: 1990

Published in: Numerische Mathematik (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/133431

zbMATH Keywords

algorithmGalerkin methodHilbert spaceoptimal errorchoice of subspacelinear coercive operator

Mathematics Subject Classification ID

Numerical solutions to equations with linear operators (65J10) Equations and inequalities involving linear operators, with vector unknowns (47A50)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite element methods are not always optimal
• Complexity of Indefinite Elliptic Problems
• Optimal Error Properties of Finite Element Methods for Second Order Elliptic Dirichlet Problems