Related papers: Estimation to structured distances to singularity …

Consider a multivariable state space system and associated transfer function G({\lambda}). The aim of this paper is to define and analyze two vector spaces of matrix pencils associated with the matrix G({\lambda}) and show that almost all…

A finite set of the Euclidean space is called an $s$-distance set provided the number of Euclidean distances in the set is $s$. Determining the largest possible $s$-distance set for the Euclidean space of a given dimension is challenging.…

Structured low-rank approximation is the problem of minimizing a weighted Frobenius distance to a given matrix among all matrices of fixed rank in a linear space of matrices. We study exact solutions to this problem by way of computational…

The structured singular value $\mu_E$ for a linear subspace $E$ of $M_n(\mathbb C)$ is defined by \[ \mu_E(A)=1 / \inf\{\|X\| \ : \ X \in E, \ \det(I_n-AX)=0 \} \quad (A \in M_n(\mathbb{C})), \] and $\mu_E(A)=0$ if there is no $X \in E$…

We present a novel method for calculating Pad\'e approximants that is capable of eliminating spurious poles placed at the point of development and of identifying and eliminating spurious poles created by precision limitations and/or noisy…

In the last decade, there has been a continued effort to produce families of strong linearizations of a matrix polynomial $P(\lambda)$, regular and singular, with good properties. As a consequence of this research, families such as the…

Pseudospectra and structured pseudospectra are important tools for the analysis of matrices. Their computation, however, can be very demanding for all but small matrices. A new approach to compute approximations of pseudospectra and…

First, we derive explicit computable expressions of structured backward errors of approximate eigenelements of structured matrix polynomials including symmetric, skew-symmetric, Hermitian, skew-Hermitian, even and odd polynomials. We also…

Matrix polynomials given in an orthogonal basis are considered. Following the ideas of Mackey et al. "Vector spaces of Linearizations for Matrix Polynomials" (2006), the vec- tor spaces, called M1(P), M2(P) and DM(P), of potential…

Let $T$ be a tree on $n$ vertices whose edge weights are positive definite matrices of order $s$. The squared distance matrix of $T$, denoted by $\Delta$, is the $ns \times ns$ block matrix with $\Delta_{ij}=d(i,j)^2$, where $d(i,j)$ is the…

Eigenvalue and eigenpair backward errors are computed for matrix pencils arising in optimal control. In particular, formulas for backward errors are developed that are obtained under block-structure-preserving and…

The work is devoted to investigation of the canonical structure of regular, in domain of definition ${\cal U}\subseteq {\mathbb R}^{m}$, the pencil of matrix-functions $A(x)+\lambda B(x)$. It is supposed that $\det A(x)\equiv 0$ and $\det…

Linearization is a standard method in the computation of eigenvalues and eigenvectors of matrix polynomials. In the last decade a variety of linearization methods have been developed in order to deal with algebraic structures and in order…

The computation of the structured pseudospectral abscissa and radius (with respect to the Frobenius norm) of a Toeplitz matrix is discussed and two algorithms based on a low rank property to construct extremal perturbations are presented.…

In this short note we prove a lemma about the dimension of certain algebraic sets of matrices. This result is needed in our paper arXiv:1201.1672. The result presented here has also applications in other situations and so it should appear…

A regular matrix pencil sE-A and its rank one perturbations are considered. We determine the sets in the extended complex plane which are the eigenvalues of the perturbed pencil. We show that the largest Jordan chains at each eigenvalue of…

In this paper we derive new sufficient conditions for a linear system matrix $$S(\lambda):=\left[\begin{array}{ccc} T(\lambda) & -U(\lambda) \\ V(\lambda) & W(\lambda) \end{array}\right],$$ where $T(\lambda)$ is assumed regular, to be…

We design a fast implicit real QZ algorithm for eigenvalue computation of structured companion pencils arising from linearizations of polynomial rootfinding problems. The modified QZ algorithm computes the generalized eigenvalues of an…

For each pair of complex symmetric matrices $(A,B)$ we provide a normal form with a minimal number of independent parameters, to which all pairs of complex symmetric matrices $(\widetilde{A},\widetilde{B})$, close to $(A,B)$ can be reduced…

We review the relations between distance matrices and isometric embeddings and give simple proofs that distance matrices defined on euclidean and spherical spaces have all eigenvalues except one non-negative. Several generalizations are…