Towards computability of elliptic boundary value problems in variational formulation

DOI10.1016/J.JCO.2006.04.007zbMATH Open1126.03052OpenAlexW2018804289MaRDI QIDQ864435FDOQ864435

Authors: Vasco Brattka, Atsushi Yoshikawa 

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

Recommendations

• Variational discretization of elliptic boundary value problems.
• Publication:3497388
• Variational Methods for the Numerical Solution of Nonlinear Elliptic Problems
• On computation of solutions of elliptic systems
• scientific article; zbMATH DE number 1894642
• On computation of solutions of fully nonlinear elliptic problems
• On the Use of Elliptic Regularity Theory for the Numerical Solution of Variational Problems
• Variational study of an elliptic boundary problem
• Computer-assisted proofs for semilinear elliptic boundary value problems
• The computational complexity of elliptic partial differential equations

zbMATH Keywords

functional analysisboundary value problemscomputable analysisLax-Milgram theorem[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Fr%EF%BF%BD%EF%BF%BDchet-Riesz+representation+theorem&go=Go Fr��chet-Riesz representation theorem]theorem of Schauder

Mathematics Subject Classification ID

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

Cites Work

• Equivalent Norms for Sobolev Spaces
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computability theory of generalized functions
• On the computational complexity of ordinary differential equations
• The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations
• Title not available (Why is that?)
• 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
• Computability and models. Perspectives east and west
• Title not available (Why is that?)
• L^p‐Computability
• Effective representations of the space of linear bounded operators
• Computability of the spectrum of self-adjoint operators
• Computer Science Logic
• Title not available (Why is that?)
• The bit-complexity of discrete solutions of partial differential equations: Compact multigrid

Cited In (19)

• On the Effective Existence of Schauder Bases
• Computable Riesz representation for locally compact Hausdorff spaces
• Signal reconstruction for the diffusion transport equation using tensorial spline Galerkin approximation
• Variational formulation of a damped Dirichlet impulsive problem
• A wavelet multi-scale method for the inverse problem of diffuse optical tomography
• Splines finite element solver for one-dimensional time-dependent Maxwell's equations via Fourier transform discretization
• On computable compact operators on Banach spaces
• A numerical method for one-dimensional diffusion problem using Fourier transform and the B-spline Galerkin method
• Computable structures and operations on the space of continuous functions
• On computability of the Galerkin procedure
• Computability of Differential Equations
• High-order spline finite element method for solving time-dependent electromagnetic waves
• Quantitative continuity and Computable Analysis in Coq
• Computability of solutions of operator equations
• Title not available (Why is that?)
• Weihrauch Complexity in Computable Analysis
• On the computational complexity of the Dirichlet Problem for Poisson's Equation
• Computability and Analysis, a Historical Approach
• Are unbounded linear operators computable on the average for Gaussian measures?

This page was built for publication: Towards computability of elliptic boundary value problems in variational formulation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864435)