Related papers: Computing the Lyapunov operator \varphi-functions,…
The article proposes an approach to complete-type and related Lyapunov-Krasovskii functionals that neither requires knowledge of the delay-Lyapunov matrix function nor does it involve linear matrix inequalities. The approach is based on…
In this paper we use a path-integral approach to represent the Lyapunov exponents of both deterministic and stochastic dynamical systems. In both cases the relevant correlation functions are obtained from a (one-dimensional) supersymmetric…
In this short note we describe a simple but remarkably effective method for rigorously estimating Lyapunov exponents for expanding maps of the interval. We illustrate the applicability of this method with some standard examples.
We study the q-analogue of Euler-Maclaurin formula and by introducing a new q-operator we drive to this form. Moreover, approximation properties of q-Bernoulli polynomials is discussed. We estimate the suitable functions as a combination of…
Given a set of matrices, modeled as samples of a matrix-valued function, we suggest a method to approximate the underline function using a product approximation operator. This operator extends known approximation methods by exploiting the…
For $m$ given square matrices $A_0, A_1, \cdots, A_{m-1}$ ($m\ge 2$), one of which is assumed to be of rank $1$, and for a given sequence $(\omega_n)$ in $\{0,1, \cdots, m-1\}^\mathbb{N}$, the following limit, if it exists,…
The Lyapunov exponents of a chaotic system quantify the exponential divergence of initially nearby trajectories. For Hamiltonian systems the exponents are related to the eigenvalues of a symplectic matrix. We make use of this fact to…
We obtain approximation formulas for fractional integrals and derivatives of Riemann-Liouville and Marchaud types with a variable fractional order. The approximations involve integer-order derivatives only. An estimation for the error is…
We revisit the numerical calculation of generalized Lyapunov exponents, $L$($q$), in deterministic dynamical systems. The standard method consists of adding noise to the dynamics in order to use importance sampling algorithms. Then $L$($q$)…
We study computational methods for the approximation of special functions recurrent in geometric function theory and quasiconformal mapping theory. The functions studied can be expressed as quotients of complete elliptic integrals and as…
We review the Laporta algorithm for the reduction of scalar integrals to the master integrals and the differential equations technique for their evaluation. We discuss the use of the basis of harmonic polylogarithms for the analytical…
Krylov-based algorithms have long been preferred to compute the matrix exponential and exponential-like functions appearing in exponential integrators. Of late, direct polynomial interpolation of the action of these exponential-like…
We propose an efficient algorithmic framework for time domain circuit simulation using exponential integrator. This work addresses several critical issues exposed by previous matrix exponential based circuit simulation research, and makes…
The aim of this work is to develop a fast algorithm for approximating the matrix function $f(A)$ of a square matrix $A$ that is symmetric and has hierarchically semiseparable (HSS) structure. Appearing in a wide variety of applications,…
We analyze the exponential stability of distributed parameter systems. The system we consider is described by a coupled parabolic partial differential equation with spatially varying coefficients. We approximate the coefficients by…
We propose a sampling-based approach to learn Lyapunov functions for a class of discrete-time autonomous hybrid systems that admit a mixed-integer representation. Such systems include autonomous piecewise affine systems, closed-loop…
Let $\Gamma$ be a crystal group in $\mathbb R^d$. A function $\varphi:\mathbb R^d\longrightarrow \mathbb C$ is said to be {\em crystal-refinable} (or $\Gamma-$refinable) if it is a linear combination of finitely many of the rescaled and…
We apply mixed-precision to the low-rank Lyapunov ADI (LR-ADI) by performing certain aspects of the algorithm in a lower working precision. Namely, we accumulate the overall solution, solve the linear systems comprising the ADI iteration,…
Many interesting functions arising in applications map into Riemannian manifolds. We present an algorithm, using the manifold exponential and logarithm, for approximating such functions. Our approach extends approximation techniques for…
We study fast approximation of integrals with respect to stationary probability measures associated to iterated functions systems on the unit interval. We provide an algorithm for approximating the integrals under certain conditions on the…