Towards computability of elliptic boundary value problems in variational formulation

DOI10.1016/j.jco.2006.04.007zbMath1126.03052OpenAlexW2018804289MaRDI QIDQ864435

Atsushi Yoshikawa, Vasco Brattka

Publication date: 8 February 2007

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jco.2006.04.007

zbMATH Keywords

boundary value problemsfunctional analysiscomputable analysisLax-Milgram theoremFréchet-Riesz representation theoremtheorem of Schauder

Mathematics Subject Classification ID

Boundary value problems for second-order elliptic equations (35J25) Nonlinear boundary value problems for ordinary differential equations (34B15) Constructive and recursive analysis (03F60) General theory of partial differential operators (47F05) Constructive operator theory (47S30)

Related Items

Computability and Analysis, a Historical Approach ⋮ Unnamed Item ⋮ On the computational complexity of the Dirichlet Problem for Poisson's Equation ⋮ Signal reconstruction for the diffusion transport equation using tensorial spline Galerkin approximation ⋮ On computability of the Galerkin procedure ⋮ Quantitative continuity and Computable Analysis in Coq ⋮ Are unbounded linear operators computable on the average for Gaussian measures? ⋮ A numerical method for one-dimensional diffusion problem using Fourier transform and the B-spline Galerkin method ⋮ On the Effective Existence of Schauder Bases ⋮ Computable Riesz Representation for Locally Compact Hausdorff Spaces ⋮ Computability of Solutions of Operator Equations ⋮ On Computable Compact Operators on Banach Spaces ⋮ Variational formulation of a damped Dirichlet impulsive problem ⋮ Computable structures and operations on the space of continuous functions ⋮ Computability of Differential Equations ⋮ Weihrauch Complexity in Computable Analysis ⋮ A wavelet multi-scale method for the inverse problem of diffuse optical tomography

Cites Work

• The bit-complexity of discrete solutions of partial differential equations: Compact multigrid
• Complexity of differential and integral equations
• Computability structure of the Sobolev spaces and its applications
• On an ad hoc computability structure in a Hilbert space
• Interpolation functor and computability.
• Computable sequences in the Sobolev spaces
• Type‐2 computability on spaces of integrable functions
• On the computational complexity of ordinary differential equations
• Computability theory of generalized functions
• L^p‐Computability
• Effective representations of the space of linear bounded operators
• Computer Science Logic
• Equivalent Norms for Sobolev Spaces
• The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item