Related papers: Integrating Factors and ODE Patterns
This paper proposes uni-orthogonal and bi-orthogonal nonnegative matrix factorization algorithms with robust convergence proofs. We design the algorithms based on the work of Lee and Seung [1], and derive the converged versions by utilizing…
Numerically solving ordinary differential equations (ODEs) is a naturally serial process and as a result the vast majority of ODE solver software are serial. In this manuscript we developed a set of parallelized ODE solvers using…
We present an iterative algorithm for solving a class of \\nonlinear Laplacian system of equations in $\tilde{O}(k^2m \log(kn/\epsilon))$ iterations, where $k$ is a measure of nonlinearity, $n$ is the number of variables, $m$ is the number…
In this paper, we consider mixed-integer nonsmooth constrained optimization problems whose objective/constraint functions are available only as the output of a black-box zeroth-order oracle (i.e., an oracle that does not provide derivative…
Here we present a very efficient method to search for Liouvillian first integrals of second order rational ordinary differential equations (rational 2ODEs). This new algorithm can be seen as an improvement to the S-function method we have…
For a system of ordinary differential equations (ODEs) or, more generally, an involutive distribution of vector fields, the problem of its integration is considered. Among the many approaches to this problem, solvable structures provide a…
In this paper, we present an algorithm which computes a fundamental matrix of formal solutions of completely integrable Pfaffian systems with normal crossings in two variables, based on (Barkatou, 1997). A first step was set in…
Likelihood-free (a.k.a. simulation-based) inference problems are inverse problems with expensive, or intractable, forward models. ODE inverse problems are commonly treated as likelihood-free, as their forward map has to be numerically…
The solution of a class of third order ordinary differential equations possessing two parameter Lie symmetry group is obtained by group theoretic means. It is shown that reduction to quadratures is possible according to two scenarios: 1) if…
We introduce a new class of integrators for stiff ODEs as well as SDEs. These integrators are (i) {\it Multiscale}: they are based on flow averaging and so do not fully resolve the fast variables and have a computational cost determined by…
The paper describes two iterative algorithms for solving general systems of M simultaneous linear algebraic equations (SLAE) with real matrices of coefficients. The system can be determined, underdetermined, and overdetermined. Linearly…
Nonlinear matrix equations arise in many practical contexts related to control theory, dynamical programming and finite element methods for solving some partial differential equations. In most of these applications, it is needed to compute…
Lifted probabilistic inference exploits symmetries in probabilistic graphical models to allow for tractable probabilistic inference with respect to domain sizes. To exploit symmetries in, e.g., factor graphs, it is crucial to identify…
Solving the floating-point equation $x \otimes y = z$, where $x$, $y$ and $z$ belong to floating-point intervals, is a common task in automated reasoning for which no efficient algorithm is known in general. We show that it can be solved by…
Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…
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…
The forward-backward splitting technique is a popular method for solving monotone inclusions that has applications in optimization. In this paper we explore the behaviour of the algorithm when the inclusion problem has no solution. We…
We represent an algorithm reducing the $(M+1)$-dimensional nonlinear partial differential equation (PDE) representable in the form of one-dimensional flow $u_t + w_{x_1}(u,u_{x},u_{xx},\dots)=0$, (where $w$ is an arbitrary local function of…
Many important systems across biology, engineering, physics, and economics are characterized by polynomial ordinary differential equations (ODEs), yet analytical solutions are rare. We develop a framework for identifying and solving a broad…
We are interested in the numerical solution of coupled nonlinear partial differential equations (PDEs) in two and three dimensions. Under certain assumptions on the domain, we take advantage of the Kronecker structure arising in standard…