Related papers: On the complexity of solving initial value problem…
This paper provides the existence and representation of solution to an initial value problem for the general multi-term linear fractional differential equation with generalized Riemann-Liouville fractional derivatives and constant…
We give an algorithm for deciding whether a planar polynomial differential system has a first integral which factorizes as a product of defining polynomials of curves with only one place at infinity. In the affirmative case, our algorithm…
We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…
We introduce in this paper an optimal first-order method that allows an easy and cheap evaluation of the local Lipschitz constant of the objective's gradient. This constant must ideally be chosen at every iteration as small as possible,…
For the string baryon model "triangle" the initial-boundary value problem is stated and solved in general. This problem implies defining a classical motion of the system on the base of given initial position and initial velocities of string…
The main purpose of this paper is to show that there exists a positive number $\lambda_{1}$, the first eigenvalue, such that some $p(x)$-Laplace equation admits a solution if $\lambda=\lambda_{1}$ and that $\lambda_{1}$ is simple, i.e.,…
A new iterative technique is presented for solving of initial value problem for certain classes of multidimensional linear and nonlinear partial differential equations. Proposed iterative scheme does not require any discretization,…
We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest…
In this work we present a method, based on the use of Bernstein polynomials, for the numerical resolution of some boundary values problems. The computations have not need of particular approximations of derivatives, such as finite…
In recent time, by working in a plane with the metric associated with wave equation (the Special Relativity non-definite quadratic form), a complete formalization of space-time trigonometry and a Cauchy-like integral formula have been…
We investigate a method to solve a class of Schr{\"o}dinger equation eigenvalue problems numerically to very high precision $P$ (from thousands to a million of decimals). The memory requirement, and the number of high precision algebraic…
We describe a method to construct well-posed initial value problems for not necessarily integrable equations on not necessarily simply connected quad-graphs. Although the method does not always provide a well-posed initial value problem…
In order to prove that the P of problems is different to the NP class, we consider the satisfability problem of propositional calculus formulae, which is an NP-complete problem. It is shown that, for every search algorithm A, there is a set…
We propose an algorithm for quickly evaluating polynomials. It pre-conditions a complex polynomial $P$ of degree $d$ in time $O(d\log d)$, with a low multiplicative constant independent of the precision. Subsequent evaluations of $P$…
In this paper we focus on the initial-boundary value problem of the 2-D isentropic Euler equations with damping. We prove the global-in-time existence of classical solution to the initial-boundary value problem by the method of energy…
Welcome to a beautiful subject in scientific computing: numerical solution of ordinary differential equations (ODEs) with initial conditions.
The initial-boundary value problems for linear non-autonomous first order evolution equations are examined. Our assumptions provide a unified treatment which is applicable to many situations, where the domains of the operators may change…
The objective of this publication is to reduce the sensitivity of iterative equation solvers on the initial value. To this end, at the hand of Newton's method, we exemplify how to reformulate the initial problem by means of a set of…
In a previous paper, we have shown that any Boolean formula can be encoded as a linear programming problem in the framework of Bayesian probability theory. When applied to NP-complete algorithms, this leads to the fundamental conclusion…
We introduce a new concept of approximation applicable to decision problems and functions, inspired by Bayesian probability. From the perspective of a Bayesian reasoner with limited computational resources, the answer to a problem that…