Computability of Differential Equations (Q5024569)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7464641

Language	Label	Description	Also known as
English	Computability of Differential Equations	scientific article; zbMATH DE number 7464641

Statements

scholarly article

0 references

Computability of Differential Equations (English)

0 references

0 references

Daniel Silva Graça

0 references

Theory and Applications of Computability

0 references

publication date

26 January 2022

0 references

full work available at URL

http://hdl.handle.net/10400.1/15378

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

The Failure in Computable Analysis of a Classical Existence Theorem for Differential Equations

0 references

Three-Dimensional Flows

0 references

0 references

0 references

0 references

Breaking the limits: The Taylor series method

0 references

0 references

0 references

0 references

Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains

0 references

On the complexity of solving initial value problems

0 references

Mathematical tools for the study of the incompressible Navier-Stokes equations and related models

0 references

Towards computability of elliptic boundary value problems in variational formulation

0 references

0 references

Constructive Weak Solutions of the Dirichlet Problem

0 references

0 references

Recursive analysis of singular ordinary differential equations

0 references

0 references

Index sets for computable differential equations

0 references

The primitive recursive analysis of ordinary differential equations and the complexity of their solutions

0 references

Continuity and computability of reachable sets

0 references

Effective Computability of Solutions of Ordinary Differential Equations The Thousand Monkeys Approach

0 references

0 references

Solving Ordinary Differential Equations Using Taylor Series

0 references

A Domain-Theoretic Account of Picard's Theorem

0 references

Polynomial-Time Solution of Initial Value Problems Using Polynomial Enclosures

0 references

Computability of Solutions of the Korteweg-de Vries Equation

0 references

Computability and Incomputability of Differential Equations

0 references

Solutions in \(L_ r\) of the Navier-Stokes initial value problem

0 references

An analytic system with a computable hyperbolic sink whose basin of attraction is non-computable

0 references

Computability with polynomial differential equations

0 references

Analog computers and recursive functions over the reals.

0 references

Computability, noncomputability and undecidability of maximal intervals of IVPs

0 references

Computability, noncomputability, and hyperbolic systems

0 references

The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited

0 references

Boundedness of the Domain of Definition is Undecidable for Polynomial ODEs

0 references

Computing geometric Lorenz attractors with arbitrary precision

0 references

Nonlinear oscillations, dynamical systems, and bifurcations of vector fields

0 references

Structural stability of Lorenz attractors

0 references

0 references

0 references

A Software Package for the Numerical Integration of ODEs by Means of High-Order Taylor Methods

0 references

Lipschitz continuous ordinary differential equations are polynomial-space complete

0 references

Complexity Theory for Operators in Analysis

0 references

Computational Complexity of Smooth Differential Equations

0 references

Parameterized complexity for uniform operators on multidimensional analytic functions and ODE solving

0 references

On the computational complexity of the Dirichlet Problem for Poisson's Equation

0 references

Average-case polynomial-time computability of hamiltonian dynamics

0 references

On the computational complexity of ordinary differential equations

0 references

0 references

Computing power series in polynomial time

0 references

Recursive function theory and numerical analysis

0 references

Generalized shifts: unpredictability and undecidability in dynamical systems

0 references

0 references

A critical evaluation of seven discretization schemes for convection-diffusion equations

0 references

0 references

Computational complexity of solving polynomial differential equations over unbounded domains

0 references

A computable ordinary differential equation which possesses no computable solution

0 references

The wave equation with computable initial data such that its unique solution is not computable

0 references

0 references

The Wave Equation with Computable Initial Data Whose Unique Solution Is Nowhere Computable

0 references

0 references

0 references

AN EFFECTIVE CAUCHY-PEANO EXISTENCE THEOREM FOR UNIQUE SOLUTIONS

0 references

Computing Solutions of Symmetric Hyperbolic Systems of PDE's

0 references

0 references

Computing Solution Operators of Boundary-value Problems for Some Linear Hyperbolic Systems of PDEs

0 references

Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs with guaranteed precision

0 references

Bit complexity of computing solutions for symmetric hyperbolic systems of PDEs (extended abstract)

0 references

Mathematical Theory of the Differential Analyzer

0 references

Differentiable dynamical systems

0 references

Church's thesis meets the \(N\)-body problem

0 references

0 references

On Effective Convergence of Numerical Solutions for Differential Equations

0 references

Computability aspects for 1st-order partial differential equations via characteristics

0 references

On Computability of Navier-Stokes’ Equation

0 references

A rigorous ODE solver and Smale's 14th problem

0 references

0 references

0 references

0 references

0 references

IS WAVE PROPAGATION COMPUTABLE OR CAN WAVE COMPUTERS BEAT THE TURING MACHINE?

0 references

The Solution Operator of the Korteweg-de Vries Equation is Computable

0 references

Computing the solution of the Korteweg-de Vries equation with arbitrary precision on Turing machines

0 references

An Algorithm for Computing Fundamental Solutions

0 references

Computing Schrödinger propagators on type-2 Turing machines

0 references

Computable Analysis of the Abstract Cauchy Problem in a Banach Space and Its Applications (I)

0 references

Computable analysis of the abstract Cauchy problem in a Banach space and its applications I

0 references

Computability structure of the Sobolev spaces and its applications

0 references

New Computational Paradigms

0 references

Computational unsolvability of domains of attraction of nonlinear systems

0 references

Computability theory of generalized functions

0 references

Identifiers

10.1007/978-3-030-59234-9_3

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5024569

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5024569&oldid=36761404"