On computability of the Galerkin procedure

DOI10.3792/pjaa.83.69zbMath1143.03022MaRDI QIDQ935651

Atsushi Yoshikawa

Publication date: 12 August 2008

Published in: Proceedings of the Japan Academy. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3792/pjaa.83.69

zbMATH Keywords

Galerkin approximation; Lax-Milgram theorem; computable Hilbert space

Mathematics Subject Classification ID

65K10: Numerical optimization and variational techniques

46C05: Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product)

03F60: Constructive and recursive analysis

41A65: Abstract approximation theory (approximation in normed linear spaces and other abstract spaces)

03D80: Applications of computability and recursion theory

46S30: Constructive functional analysis

03D45: Theory of numerations, effectively presented structures

Cites Work

• Towards computability of elliptic boundary value problems in variational formulation
• On an ad hoc computability structure in a Hilbert space
• Approximation variationnelle des problèmes aux limites
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item