Towards computability of elliptic boundary value problems in variational formulation

21Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

We present computable versions of the Fréchet-Riesz Representation Theorem and the Lax-Milgram Theorem. The classical versions of these theorems play important roles in various problems of mathematical analysis, including boundary value problems of elliptic equations. We demonstrate how their computable versions yield computable solutions of the Neumann and Dirichlet boundary value problems for a simple non-symmetric elliptic differential equation in the one-dimensional case. For the discussion of these elementary boundary value problems, we also provide a computable version of the Theorem of Schauder, which shows that the adjoint of a computably compact operator on Hilbert spaces is computably compact again. © 2006 Elsevier Inc. All rights reserved.

Cite

CITATION STYLE

APA

Brattka, V., & Yoshikawa, A. (2006). Towards computability of elliptic boundary value problems in variational formulation. Journal of Complexity, 22(6), 858–880. https://doi.org/10.1016/j.jco.2006.04.007

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free