On computability of the Galerkin procedure
Yoshikawa, Atsushi
Proc. Japan Acad. Ser. A Math. Sci., Tome 83 (2007) no. 1, p. 69-72 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 2007-05-14
Classification:  computable Hilbert space,  Galerkin approximation,  Lax-Milgram theorem,  03D80,  65J10,  46C05,  41A65 
@article{1181050956,
     author = {Yoshikawa, Atsushi},
     title = {On computability of the Galerkin procedure},
     journal = {Proc. Japan Acad. Ser. A Math. Sci.},
     volume = {83},
     number = {1},
     year = {2007},
     pages = { 69-72},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1181050956}
}

Yoshikawa, Atsushi. On computability of the Galerkin procedure. Proc. Japan Acad. Ser. A Math. Sci., Tome 83 (2007) no. 1, pp.  69-72. http://gdmltest.u-ga.fr/item/1181050956/