Related papers: Non-Liouvillian solutions for second order linear …
This paper studies first-order algorithms for solving fully composite optimization problems over convex and compact sets. We leverage the structure of the objective by handling its differentiable and non-differentiable components…
Here we present a new approach to search for first order invariants (first integrals) of rational second order ordinary differential equations. This method is an alternative to the Darbouxian and symmetry approaches. Our procedure can…
We study the limitations and fast-forwarding of quantum algorithms for linear ordinary differential equation (ODE) systems with a particular focus on non-quantum dynamics, where the coefficient matrix in the ODE is not anti-Hermitian or the…
We consider the large-scale regularity of solutions to second-order linear elliptic equations with random coefficient fields. In contrast to previous works on regularity theory for random elliptic operators, our interest is in the…
New iterative methods for solving linear equations are presented that are easy to use, generalize good existing methods, and appear to be faster. The new algorithms mix two kinds of linear recurrence formulas. Older methods have either high…
The detailed construction of the general solution of a second order non-homogenous linear operatordifference equation is presented. The wide applicability of such an equation as well as the usefulness of its resolutive formula is shown by…
A powerful method for solving non-linear first-order ordinary differential equations, which is based on geometrical understanding of the corresponding dynamics of the so called Lie systems, is developed. This method allows us not only to…
With the advent of ultra-high power lasers the nonlinear nature of the vacuum of quantum electrodynamics (QED) can be probed. Due to the highly nonlinear structure of the underlying equations new numerical algorithms are required. A…
We propose an algebraic geometric approach for studying rational solutions of first-order algebraic ordinary difference equations. For an autonomous first-order algebraic ordinary difference equations, we give an upper bound for the degrees…
We present two algorithms for computing what we call the absolute factorization of a difference operator. We also give an algorithm to solve third order difference equations in terms of second order equations, together with applications to…
There are two ways to compute Poincar\'e-Dulac normal forms of systems of ODEs. Under the original approach used by Poincar\'e the normalizing transformation is explicitly computed. On each step, the normalizing procedure requires the…
We discuss the solution of regular and singular Sturm-Liouville problems by means of High Order Finite Difference Schemes. We describe a code to define a discrete problem and its numerical solution by means of linear algebra techniques.…
We solve the local equivalence problem for second order (smooth or analytic) ordinary differential equations. We do so by presenting a {\em complete convergent normal form} for this class of ODEs. The normal form is optimal in the sense…
We classify the Lie point symmetries for the 2+1 nonlinear generalized Kadomtsev-Petviashvili equation by determine all the possible f(u) functional forms where the latter depends. For each case the one-dimensional optimal system is…
We introduce two ordinary second-order linear differential equations of the Laguerre- and Jacobi-type. Solutions are written as infinite series of square integrable functions in terms of the Laguerre and Jacobi polynomials, respectively.…
A method of representation of a solution as segments of the series in powers of the step of the independent variable is expanded for solving complex systems of ordinary differential equations (ODE): the Lorenz system and other systems. A…
The standard assumption for proving linear convergence of first order methods for smooth convex optimization is the strong convexity of the objective function, an assumption which does not hold for many practical applications. In this…
When a computer algebra system fails to solve an Ordinary Differential Equation, is this a limitation of its implementation, or a genuine computational barrier? Three traditions bear on the question. Modern computer algebra algorithms can…
Invariant linearization criteria of square systems of second-order quadratically semi-linear ordinary differential equations (ODEs) that can be represented as geodesic equations are extended to square systems of ODEs cubically nonlinear in…
This paper is concerned with two properties of positive weak solutions of quasilinear elliptic equations with nonlinear gradient terms. First, we show a Liouville-type theorem for positive weak solutions of the equation involving the…