On computability of the Galerkin procedure

DOI10.3792/PJAA.83.69zbMath1143.03022OpenAlexW1964135267MaRDI 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 approximationLax-Milgram theoremcomputable Hilbert space

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Constructive and recursive analysis (03F60) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Applications of computability and recursion theory (03D80) Constructive functional analysis (46S30) Theory of numerations, effectively presented structures (03D45)

Related Items (1)

Galerkin schemes and inverse boundary value problems in reflexive Banach spaces

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

This page was built for publication: On computability of the Galerkin procedure