Galerkin method and optimal error algorithms in Hilbert spaces
From MaRDI portal
Publication:1120253
DOI10.1007/BF01386393zbMath0672.65030MaRDI QIDQ1120253
Publication date: 1990
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133431
algorithm; Galerkin method; Hilbert space; optimal error; choice of subspace; linear coercive operator
65J10: Numerical solutions to equations with linear operators
47A50: Equations and inequalities involving linear operators, with vector unknowns
Cites Work