Related papers: The Lyapunov matrix equation. Matrix analysis from…
An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…
Many applications in applied mathematics and control theory give rise to the unique solution of a Sylvester-like matrix equation associated with an underlying structured matrix operator $f$. In this paper, we will discuss the solvability of…
Random matrices now play a role in many parts of computational mathematics. To advance these applications, it is desirable to have tools that are flexible, easy to use, and powerful. Over the last 25 years, researchers have developed a…
This paper presents a counterexample-guided iterative algorithm to compute convex, piecewise linear (polyhedral) Lyapunov functions for uncertain continuous-time linear hybrid systems. Polyhedral Lyapunov functions provide an alternative to…
This paper is concerned with the study of random (Bernoulli and Markovian) product of matrices on a compact space of symbols. We establish the analyticity of the maximal Lyapunov exponent as a function of the transition probabilities, thus…
Bivariate matrix functions provide a unified framework for various tasks in numerical linear algebra, including the solution of linear matrix equations and the application of the Fr\'echet derivative. In this work, we propose a novel…
The Lyapunov exponent corresponding to a set of square matrices $\mathcal{A} = \{A_1, \dots, A_n \}$ and a probability distribution $p$ over $\{1, \dots, n\}$ is $\lambda(\mathcal{A},p) := \lim_{k \to \infty} \frac{1}{k} \,\mathbb{E} \log…
We propose a new class of short matrix recurrences for the solution of nonsymmetric linear equations of the type $\mathbf{A}_1\mathbf{X}\mathbf{B}_1+\ldots+\mathbf{A}_p\mathbf{X}\mathbf{B}_p=CD^T$. These iterative methods combine local…
A simple closed-form solution to the discrete Lyapunov equation (DLE) is established for certain families of matrices. This solution is expressed in terms of the eigen decomposition (ED) for which closed-form solutions are known for all…
The paper is devoted to the study of stability of equilibrium solutions of a delay differential equation that models leukemia. The equation was previously studied in [5] and [6], where the emphasis is put on the numerical study of periodic…
It is shown that the Lax pair equation dL/dt = [L,A] can be given a neat tensorial interpretation for finite-dimensional quadratic Hamiltonians. The Lax matrices L and A are shown to arise from third rank tensors on the configuration space.…
In this paper we present deflation and augmentation techniques that have been designed to accelerate the convergence of Krylov subspace methods for the solution of linear systems of equations. We review numerical approaches both for linear…
The paper provides a new integral formula for the largest Lyapunov exponent of Gaussian matrices, which is valid in the real, complex and quaternion-valued cases. This formula is applied to derive asymptotic expressions for the largest…
In this paper, we adapt the control theoretic concept of dissipativity theory to provide a natural understanding of Nesterov's accelerated method. Our theory ties rigorous convergence rate analysis to the physically intuitive notion of…
We consider small nonlinear perturbations of linear systems on a time scale with the phase space being finite or infinite-dimensional. For $\Delta$-differential operators, corresponding to linear dynamic systems we consider their…
In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…
We study solution X of the stochastic equation X = AX +B, where A is a random matrix and B,X are random vectors, the law of (A,B) is given and X is independent of (A,B). The equation is meant in law, the matrix A is 2x2 upper triangular,…
One of the most computationally expensive steps of the low-rank ADI method for large-scale Lyapunov equations is the solution of a shifted linear system at each iteration. We propose the use of the extended Krylov subspace method for this…
Let f be an analytic function defined on a complex domain Omega and A be a (n,n) complex matrix. We assume that there exists a unique alpha satisfying f(alpha)=0. When f'(alpha)=0 and A is non derogatory, we solve completely the equation…
This thesis settles a number of questions related to computational complexity and algebraic, semidefinite programming based relaxations in optimization and control.