English
Related papers

Related papers: Computability of Initial Value Problems

200 papers

A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…

Logic · Mathematics 2015-03-19 Arno Pauly , Martin Ziegler

This paper addresses the weak-strong uniqueness property and singular limit for the compressible Primitive Equations (PE). We show that a weak solution coincides with the strong solution emanating from the same initial data. On the other…

Analysis of PDEs · Mathematics 2020-02-03 Hongjun Gao , Sarka Necasova , Tong Tang

In this paper, we study the initial value problem of a Boltzmann type equation with a nonlinear degenerate damping. We prove the existence of global weak solutions with large initial data, in three dimensional space. We rely on a variant…

Analysis of PDEs · Mathematics 2016-04-08 Cheng Yu

We determine the computational complexity of the Hahn-Banach Extension Theorem. To do so, we investigate some basic connections between reverse mathematics and computable analysis. In particular, we use Weak Konig's Lemma within the…

Logic · Mathematics 2010-03-26 Guido Gherardi , Alberto Marcone

We consider the initial value problem for the inviscid Primitive and Boussinesq equations in three spatial dimensions. We recast both systems as an abstract Euler-type system and apply the methods of convex integration of De Lellis and…

Analysis of PDEs · Mathematics 2017-04-05 Elisabetta Chiodaroli , Martin Michálek

Classical computations can not capture the essence of infinite computations very well. This paper will focus on a class of infinite computations called convergent infinite computations}. A logic for convergent infinite computations is…

Logic in Computer Science · Computer Science 2007-05-23 Wei Li , Shilong Ma , Yuefei Sui , Ke Xu

We consider the Cauchy problem for the spatially inhomogeneous Landau equation with soft potentials in the case of large (i.e. non-perturbative) initial data. We construct a solution for any bounded, measurable initial data with uniform…

Analysis of PDEs · Mathematics 2019-09-16 Christopher Henderson , Stanley Snelson , Andrei Tarfulea

We consider the isentropic Euler equations of gas dynamics in the whole two-dimensional space and we prove the existence of a $C^\infty$ initial datum which admits infinitely many bounded admissible weak solutions. Taking advantage of the…

Analysis of PDEs · Mathematics 2019-03-26 Elisabetta Chiodaroli , Ondřej Kreml , Václav Mácha , Sebastian Schwarzacher

In order to solve an initial value problem by the variational iteration method, a sequence of functions is produced which converges to the solution under some suitable conditions. In the nonlinear case, after a few iterations the terms of…

Numerical Analysis · Mathematics 2016-06-23 Davod Khojasteh Salkuyeh , Ali Tavakoli

In this paper, we investigate the well-posedness and the long-time asymptotic behavior for the initial-boundary value problem for multi-term time-fractional diffusion equations, where the time differentiation consists of a finite summation…

Analysis of PDEs · Mathematics 2023-01-02 Zhiyuan Li , Yikan Liu , Masahiro Yamamoto

In this article we consider the initial value problem of the binormal flow with initial data given by curves that are regular except at one point where they have a corner. We prove that under suitable conditions on the initial data a unique…

Analysis of PDEs · Mathematics 2014-03-18 Valeria Banica , Luis Vega

Computational complexity is a particularly important objective. The idea of Landauer principle was extended through mapping three classic problems (sorting,ordered searching and max of N unordered numbers) into Maxwell demon thought…

Computational Complexity · Computer Science 2014-12-04 Feng Pan , Heng-liang Zhang , Qi Jie

Matthias Schr\"oder has asked the question whether there is a weakest discontinuous problem in the continuous version of the Weihrauch lattice. Such a problem can be considered as the weakest unsolvable problem. We introduce the…

Logic · Mathematics 2025-10-14 Vasco Brattka

We establish a weak-strong uniqueness result for the isentropic compressible Euler equations, that is: As long as a sufficiently regular solution exists, all energy-admissible weak solutions with the same initial data coincide with it. The…

Analysis of PDEs · Mathematics 2021-03-31 Shyam Sundar Ghoshal , Animesh Jana , Emil Wiedemann

We prove boundedness and regularity estimates for weak solutions to a class of linear nonlocal equations involving integro-differential operators with almost no order of differentiability. In particular, we show that bounded weak solutions…

Analysis of PDEs · Mathematics 2025-03-04 Sven Jarohs , Moritz Kassmann , Tobias Weth

Computation with advice is suggested as generalization of both computation with discrete advice and Type-2 Nondeterminism. Several embodiments of the generic concept are discussed, and the close connection to Weihrauch reducibility is…

Logic in Computer Science · Computer Science 2010-06-03 Vasco Brattka , Arno Pauly

The Weihrauch degrees are a tool to gauge the computational difficulty of mathematical problems. Often, what makes these problems hard is their discontinuity. We look at discontinuity in its purest form, that is, at otherwise constant…

Logic · Mathematics 2024-07-19 Rupert Hölzl , Keng Meng Ng

This work investigates a new approach to find closed form analytical approximate solution of linear initial value problems. Classical Bernoulli polynomials have been used to derive a finite set of orthonormal polynomials and a finite…

Numerical Analysis · Mathematics 2020-07-27 Udaya Pratap Singh

In this paper, we develop a universal, conceptually simple and systematic method to prove well-posedness to Cauchy problems for weak solutions of parabolic equations with non-smooth, time-dependent, elliptic part having a variational…

Analysis of PDEs · Mathematics 2025-06-25 Pascal Auscher , Khalid Baadi

In this paper we prove that computing the solution of an initial-value problem $\dot{y}=p(y)$ with initial condition $y(t_0)=y_0\in\R^d$ at time $t_0+T$ with precision $e^{-\mu}$ where $p$ is a vector of polynomials can be done in time…

Numerical Analysis · Computer Science 2017-01-18 Olivier Bournez , Daniel S. Graça , Amaury Pouly