Related papers: On the closest stable/unstable nonnegative matrix …
We develop a Hurwitz stability criterion for nonmonic matrix polynomials via column reduction, generalizing existing approaches constrained by the monic assumption and thus serving as a more natural extension of Gantmacher's classical…
We consider the problem of reconstructing an unknown function $f$ on a domain $X$ from samples of $f$ at $n$ randomly chosen points with respect to a given measure $\rho_X$. Given a sequence of linear spaces $(V_m)_{m>0}$ with ${\rm…
We investigate the stabilizability of linear discrete-time switched systems with singular matrices, focusing on the spectral radius in this context. A new lower bound of the stabilizability radius is proposed, which is applicable to any…
We address the problem of finding the nearest graph Laplacian to a given matrix, with the distance measured using the Frobenius norm. Specifically, for the directed graph Laplacian, we propose two novel algorithms by reformulating the…
Consider a matrix polynomial $P \left( \lambda \right)= A_0 + \lambda A_1 + \ldots + \lambda^d A_d$, with $A_0,\ldots, A_d$ complex (or real) matrices with a certain structure. In this paper we discuss an iterative method to numerically…
We investigate the computation of stable fracture paths in brittle thin films using one-dimensional damage models with an elastic foundation. The underlying variational formulation is non-convex, making the evolution path sensitive to…
In the design of decentralized networked systems, it is useful to know whether a given network topology can sustain stable dynamics. We consider a basic version of this problem here: given a vector space of sparse real matrices, does it…
In this work the stability of perturbed linear time-varying systems is studied. The main features of the problem are threefold. Firstly, the time-varying dynamics is not required to be continuous but allowed to have jumps. Also the system…
The paper presents methods of eigenvalue localisation of regular matrix polynomials, in particular, stability of matrix polynomials is investigated. For this aim a stronger notion of hyperstability is introduced and widely discussed. Matrix…
Given a structured matrix $A$ we study the problem of finding the closest normal matrix with the same structure. The structures of our interest are: Hamiltonian, skew-Hamiltonian, per-Hermitian, and perskew-Hermitian. We develop a…
Meaningful comparison between sets of observations often necessitates alignment or registration between them, and the resulting optimization problems range in complexity from those admitting simple closed-form solutions to those requiring…
In order to be convergent, linear multistep methods must be zero stable. While constant step size theory was established in the 1950's, zero stability on nonuniform grids is less well understood. Here we investigate zero stability on…
We study the linear and nonlinear stability of relative equilibria in the planar N-vortex problem, adapting the approach of Moeckel from the corresponding problem in celestial mechanics. After establishing some general theory, a topological…
Stability is a key property of both forward models and inverse problems, and depends on the norms considered in the relevant function spaces. For instance, stability estimates for hyperbolic partial differential equations are often based on…
We treat the problem of the Frobenius distance evaluation from a given matrix $ A \in \mathbb R^{n\times n} $ with distinct eigenvalues to the manifold of matrices with multiple eigenvalues. On restricting considerations to the rank $ 1 $…
The radius of regularity sometimes spelled as the radius of nonsingularity is a measure providing the distance of a given matrix to the nearest singular one. Despite its possible application strength this measure is still far from being…
Following a polynomial approach, many robust fixed-order controller design problems can be formulated as optimization problems whose set of feasible solutions is modelled by parametrized polynomial matrix inequalities (PMI). These…
We work in the space of $m$-by-$n$ real matrices with the Frobenius inner product. Consider the following Problem: Given an m-by-n real matrix A and a positive integer k, find the m-by-n matrix with rank k that is closest to A. I discuss a…
We develop Stein's method for $\alpha$-stable approximation with $\alpha\in(0,1]$, continuing the recent line of research by Xu \cite{lihu} and Chen, Nourdin and Xu \cite{C-N-X} in the case $\alpha\in(1,2).$ The main results include an…
We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and visualizing time-varying data. Stability in general plays…