Advanced Search
Home > Journals > Proc. Japan Acad. Ser. A Math. Sci. > Volume 83 > Issue 5 > Article
Open Access
May 2007 On computability of the Galerkin procedure
Atsushi Yoshikawa
Proc. Japan Acad. Ser. A Math. Sci. 83(5): 69-72 (May 2007). DOI: 10.3792/pjaa.83.69

Abstract

It is shown that the Galerkin approximation procedure is an effective representation of the solution of a computable coercive variational problem in a computable Hilbert space.

Citation

Download Citation

Atsushi Yoshikawa. "On computability of the Galerkin procedure." Proc. Japan Acad. Ser. A Math. Sci. 83 (5) 69 - 72, May 2007. https://doi.org/10.3792/pjaa.83.69

Information

Published: May 2007
First available in Project Euclid: 5 June 2007

zbMATH: 1143.03022
MathSciNet: MR2334373
Digital Object Identifier: 10.3792/pjaa.83.69

Subjects:
Primary: 03D80 , 41A65 , 46C05 , 65J10

Keywords: computable Hilbert space , Galerkin approximation , Lax-Milgram theorem

Rights: Copyright © 2007 The Japan Academy

JOURNAL ARTICLE
 4 PAGES
DOWNLOAD PDF + SAVE TO MY LIBRARY
GET CITATION
< Previous Article
|
Vol.83 • No. 5 • May 2007
The Japan Academy
Subscribe to Project Euclid
Receive erratum alerts for this article
Back to Top