相关论文: Estimation to structured distances to singularity …

It is well-known that parallel manipulators are prone to singularities. However, there is still a lack of distance evaluation functions, referred to as metrics, for computing the distance between two 3-RPR configurations. The proposed…

We obtain the generic complete eigenstructures of complex Hermitian $n\times n$ matrix pencils with rank at most $r$ (with $r\leq n$). To do this, we prove that the set of such pencils is the union of a finite number of bundle closures,…

Via multilinear algebra, we formulate a criterion for connectedness in the parametric geometry of numbers in terms of pencils, which are certain algebraic varieties in the space of matrices. As a consequence, we obtain a connectedness…

Structured Low-Rank Approximation is a problem arising in a wide range of applications in Numerical Analysis and Engineering Sciences. Given an input matrix $M$, the goal is to compute a matrix $M'$ of given rank $r$ in a linear or affine…

In this paper a new fast algorithm for the computation of the distance of a matrix to a nearby defective matrix is presented. The problem is formulated following Alam & Bora (Linear Algebra Appl., 396 (2005), pp.~273--301) and reduces to…

In this paper we develop an algebraic theory to study the problem of finding the minimum distance point from an algebraic variety with respect to the Hermitian distance function. The theory generalizes the Euclidean Distance degree…

Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation E x' + A x = 0. Such an equation is invariant by changes of variables,…

Let $S$ be a closed and oriented surface of genus $g$ at least $2$. In this (mostly expository) article, the object of study is the space $\mathcal{P}(S)$ of marked isomorphism classes of projective structures on $S$. We show that…

We study linear systems cut out by cones of fixed degree on a smooth complex curve $C\subset\mathbb{P}^{3}$. We develop a systematic study of the families of such systems, considering their limits, their infinitesimal behaviour and some…

The set of mxn singular matrix pencils with normal rank at most r is an algebraic set with r+1 irreducible components. These components are the closure of the orbits (under strict equivalence) of r+1 matrix pencils which are in Kronecker…

We consider linear port-Hamiltonian differential-algebraic equations (pH-DAEs). Inspired by the geometric approach of Maschke and van der Schaft and the linear algebraic approach of Mehl, Mehrmann and Wojtylak, we present another view by…

The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…

The aim of this paper is to present new upper bounds for the distance between a properly normalized permanent of a rectangular complex matrix and the product of the arithmetic means of the entries of its columns. It turns out that the…

In this paper we show how to construct diagonal scalings for arbitrary matrix pencils $\lambda B-A$, in which both $A$ and $B$ are complex matrices (square or nonsquare). The goal of such diagonal scalings is to "balance" in some sense the…

We introduce a new notion of a periodic pencil of flat connections on a smooth algebraic variety $X$. This is a family $\nabla(s_1,...,s_n)$ of flat connections on a trivial vector bundle on $X$ depending linearly on parameters…

Generalized eigenvalue problems involving a singular pencil may be very challenging to solve, both with respect to accuracy and efficiency. While Part I presented a rank-completing addition to a singular pencil, we now develop two…

We derive computable formulas for the structured backward errors of a complex number $\lambda$ when considered as an approximate eigenvalue of rational matrix polynomials that carry a symmetry structure. We consider symmetric,…

We study the problem of learning a structured approximation (low-rank, sparse, banded, etc.) to an unknown matrix $A$ given access to matrix-vector product (matvec) queries of the form $x \rightarrow Ax$ and $x \rightarrow A^Tx$. This…

Given a possibly singular matrix polynomial $P(z)$, we study how the eigenvalues, eigenvectors, root polynomials, minimal indices, and minimal bases of the pencils in the vector space $\mathbb{DL}(P)$ introduced in Mackey, Mackey, Mehl, and…

Graham and Winkler derived a formula for the determinant of the distance matrix of a full-dimensional set of $n + 1$ points $\{ x_{0}, x_{1}, \ldots , x_{n} \}$ in the Hamming cube $H_{n} = ( \{ 0,1 \}^{n}, \ell_{1} )$. In this article we…