Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
From MaRDI portal
Abstract: As one of the seven open problems in the addendum to their 1989 book "Computability in Analysis and Physics", Pour-El and Richards proposed ``... the recursion theoretic study of particular nonlinear problems of classical importance. Examples are the Navier-Stokes equation, the KdV equation, and the complex of problems associated with Feigenbaum's constant. In this paper, we approach the question of whether the Navier-Stokes Equation admits recursive solutions in the sense of Weihrauch's Type-2 Theory of Effectivity. A natural encoding (``representation) is constructed for the space of divergence-free vector fields on 2-dimensional open square . This representation is shown to render first the mild solution to the Stokes Dirichlet problem and then a strong local solution to the nonlinear inhomogeneous incompressible Navier-Stokes initial value problem uniformly computable. Based on classical approaches, the proofs make use of many subtle and intricate estimates which are developed in the paper for establishing the computability results.
Recommendations
- On computability of Navier-Stokes' equation
- On approximation and computation of Navier-Stokes flow
- scientific article; zbMATH DE number 3995272
- On the Numerical Solution of the Incompressible Navier‐Stokes Equations
- scientific article; zbMATH DE number 3883800
- scientific article; zbMATH DE number 884751
- Numerical solution of the incompressible Navier-Stokes equations
- On approximate solutions of the incompressible Euler and Navier-Stokes equations
- scientific article; zbMATH DE number 799207
- Toward efficient solution of the compressible Navier-Stokes equations
Cites work
- A critical evaluation of seven discretization schemes for convection-diffusion equations
- Axiomatizing physical experiments as oracles to algorithms
- Computability and Recursion
- Computability in linear algebra
- Computability on subsets of metric spaces.
- Computability structure of the Sobolev spaces and its applications
- Computable analysis of the abstract Cauchy problem in a Banach space and its applications I
- Computing Schrödinger propagators on type-2 Turing machines
- Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines
- Finite Element Methods for Navier-Stokes Equations
- Finite time blowup for an averaged three-dimensional Navier-Stokes equation
- scientific article; zbMATH DE number 1651973 (Why is no real title available?)
- scientific article; zbMATH DE number 42077 (Why is no real title available?)
- scientific article; zbMATH DE number 3595655 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 1446717 (Why is no real title available?)
- IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?
- Mathematical tools for the study of the incompressible Navier-Stokes equations and related models
- On computability of Navier-Stokes' equation
- Polynomial Approximation of Divergence-Free Functions
- Semigroups of linear operators and applications to partial differential equations
- Solutions in \(L_ r\) of the Navier-Stokes initial value problem
- The Navier-Stokes equations -- a neverending challenge?
- The wave equation with computable initial data such that its unique solution is not computable
- The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable
- Time and spartial analyticity of solutions of the navier-stokes equations
- Weak and strong solutions of the Navier-Stokes initial value problem
Cited in
(6)- Computational complexity of classical solutions of partial differential equations
- Bit-complexity of solving systems of linear evolutionary partial differential equations
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- On computability of Navier-Stokes' equation
- Computer Science for Continuous Data
- Second-order parameterizations for the complexity theory of integrable functions
This page was built for publication: Computability of the Solutions to Navier-Stokes Equations via Effective Approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3297826)