Related papers: Computing the Lyapunov operator \varphi-functions,…
Lyapunov functions play a fundamental role in analyzing the stability and convergence properties of optimization methods. In this paper, we propose a novel and straightforward approach for constructing Lyapunov functions for first-order…
We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes…
We investigate the problem of approximating the matrix function $f(A)$ by $r(A)$, with $f$ a Markov function, $r$ a rational interpolant of $f$, and $A$ a symmetric Toeplitz matrix. In a first step, we obtain a new upper bound for the…
We propose a numerical method for computing the Lyapunov exponents of renewal equations (delay equations of Volterra type), consisting first in applying a discrete QR technique to the associated evolution family suitably posed on a Hilbert…
The Chernoff approximation method is a powerful and flexible tool of functional analysis, which allows in many cases to express exp(tL) in terms of variable coefficients of a linear differential operator L. In this paper, we prove a theorem…
Primal-dual algorithms are frequently used for iteratively solving large-scale convex optimization problems. The analysis of such algorithms is usually done on a case-by-case basis, and the resulting guaranteed rates of convergence can be…
An a posteriori estimate for the error of a standard Krylov approximation to the matrix exponential is derived. The estimate is based on the defect (residual) of the Krylov approximation and is proven to constitute a rigorous upper bound on…
We describe efficient differentiation methods for computing Jacobians and gradients of a large class of matrix functions including the matrix logarithm $\log(A)$ and $p$-th roots $A^{\frac{1}{p}}$. We exploit contour integrals and conformal…
We propose a two-phase systematical framework for approximation algorithm design and analysis via Lyapunov function. The first phase consists of using Lyapunov function as an input and outputs a continuous-time approximation algorithm with…
We consider the problem of computing the Lyapunov exponents of reversible cellular automata (CA). We show that the class of reversible CA with right Lyapunov exponent $2$ cannot be separated algorithmically from the class of reversible CA…
We propose a new method for computing the $\varphi$-functions of large sparse matrices with low rank or fast decaying singular values. The key is to reduce the computation of $\varphi_{\ell}$-functions of a large matrix to…
We study approximation properties of general multivariate periodic quasi-interpolation operators, which are generated by distributions/functions $\widetilde{\varphi}_j$ and trigonometric polynomials $\varphi_j$. The class of such operators…
In this paper, we develop a unified framework able to certify both exponential and subexponential convergence rates for a wide range of iterative first-order optimization algorithms. To this end, we construct a family of parameter-dependent…
We introduce the linear operators of fractional integration and fractional differentiation in the framework of the Riemann-Liouville fractional calculus. Particular attention is devoted to the technique of Laplace transforms for treating…
This paper presents an improved Matlab routine, FO_LE, for the numerical computation of Lyapunov exponents of fractional-order systems modeled by Caputo's derivative. It is conceived as an enhanced version of the former FO_Lyapunov and…
We present a new linearly implicit exponential integrator that preserves the polynomial first integrals or Lyapunov functions for the conservative and dissipative stiff equations, respectively. The method is tested by both oscillated…
We consider periodic matrix-valued Jacobi operators. The spectrum of this operator is absolutely continuous and consists of intervals separated by gaps. We define the Lyapunov function, which is analytic on an associated Riemann surface. On…
The computation of approximating e^tA B, where A is a large sparse matrix and B is a rectangular matrix, serves as a crucial element in numerous scientific and engineering calculations. A powerful way to consider this problem is to use…
In this paper the Benettin-Wolf algorithm to determine all Lyapunov exponents for a class of fractional-order systems modeled by Caputo's derivative and the corresponding Matlab code are presented. First it is proved that the considered…
The paper is concerned with efficient numerical methods for solving a linear system $\phi(A) x= b$, where $\phi(z)$ is a $\phi$-function and $A\in \mathbb R^{N\times N}$. In particular in this work we are interested in the computation of…