Related papers: On the complexity of solving initial value problem…
We propose a fast algorithm for the probabilistic solution of boundary value problems (BVPs), which are ordinary differential equations subject to boundary conditions. In contrast to previous work, we introduce a Gauss--Markov prior and…
Given a polynomial $p$ of degree $d$ and a bound $\kappa$ on a condition number of $p$, we present the first root-finding algorithms that return all its real and complex roots with a number of bit operations quasi-linear in $d…
In the classic Integer Programming (IP) problem, the objective is to decide whether, for a given $m \times n$ matrix $A$ and an $m$-vector $b=(b_1,\dots, b_m)$, there is a non-negative integer $n$-vector $x$ such that $Ax=b$. Solving (IP)…
We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…
We study existence, uniqueness and regularity of solutions for ordinary differential equations with infinitely many derivatives such as (linearized versions of) nonlocal field equations of motion appearing in particle physics, nonlocal…
Like many numerical methods, solvers for initial value problems (IVPs) on ordinary differential equations estimate an analytically intractable quantity, using the results of tractable computations as inputs. This structure is closely…
We formulate the initial value problem for causal variational principles in the continuous setting on a compact metric space. The existence and uniqueness of solutions is analyzed. The results are illustrated by simple examples.
We address complexity issues for linear differential equations in characteristic $p>0$: resolution and computation of the $p$-curvature. For these tasks, our main focus is on algorithms whose complexity behaves well with respect to $p$. We…
The Burer-Monteiro method is one of the most widely used techniques for solving large-scale semidefinite programs (SDP). The basic idea is to solve a nonconvex program in $Y$, where $Y$ is an $n \times p$ matrix such that $X = Y Y^T$. In…
For a one-dimensional mildly quasilinear wave equation given in the upper half-plane, we consider the Cauchy problem. The initial conditions have discontinuity of the first kind at one point. We construct the solution using the method of…
Several neural network approaches for solving differential equations employ trial solutions with a feedforward neural network. There are different means to incorporate the trial solution in the construction, for instance one may include…
Given the $n\times n$ matrix polynomial $P(x)=\sum_{i=0}^kP_i x^i$, we consider the associated polynomial eigenvalue problem. This problem, viewed in terms of computing the roots of the scalar polynomial $\det P(x)$, is treated in…
This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…
We consider an initial value problem of type $$ \frac{\partial u}{\partial t}={\cal F}(t,x,u,\partial_j u), \quad u(0,x)=\phi(x), $$ where $t$ is the time, $x \in \mathbb{R}^n $ and $u_0$ is a Clifford type algebra-valued function…
Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…
In this work we prove that the initial value problem (IVP) associated to the fractional two-dimensional Benjamin-Ono equation $$\left. \begin{array}{rl} u_t+D_x^{\alpha} u_x +\mathcal Hu_{yy} +uu_x &=0,\qquad\qquad (x,y)\in\mathbb R^2,\;…
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
A first-order ordinary differential equation, solved with respect to derivative, is considered. It's right-hand side is defined and continuous on the set, consisting of a connected open subset of a two-dimensional Euclidean space and a part…
In this contribution we develop a solution theory for singular quasilinear stochastic partial differential equations subject to an initial condition. We obtain our solution theory as a perturbation of the rough path approach developed to…
We aim to prove a unique solvability of an initial-boundary value problem (IBVP) for a time-fractional wave equation in a rectangular domain. We exploit the spectral expansion method as the main tool and used the solution to Cauchy problems…