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

This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…

Let $T$ be a self-adjoint operator on a complex Hilbert space $\mathcal{H}$. We give a sufficient and necessary condition for $T$ to be the pencil $\lambda P+Q$ of a pair $( P, Q)$ of projections at some point…

Consider an $n\times n$ matrix polynomial $P(\lambda)$ and a set $\Sigma$ consisting of $k \le n$ distinct complex numbers. In this paper, a (weighted) spectral norm distance from $P(\lambda)$ to the matrix polynomials whose spectra include…

In this article we focus our attention on the relation between a singular linear discrete time system and a singular linear system of fractional nabla difference equations whose coefficients are square constant matrices. By using matrix…

Although recovering an Euclidean distance matrix from noisy observations is a common problem in practice, how well this could be done remains largely unknown. To fill in this void, we study a simple distance matrix estimate based upon the…

Consider the semialgebraic structure over the real field. More generally, let an ominimal structure be over a real closed field. We show that a definable metric space X with a definable metric d is embedded into a Euclidean space so that…

We develop a systematic method to calculate the trace distance between two reduced density matrices in 1+1 dimensional quantum field theories. The approach exploits the path integral representation of the reduced density matrices and an ad…

There are several ways of a construction of a boundary of a symmetric space using pencils of geodesics: the Karpelevich boundary, the visibility boundary, the associahedral boundary, and the sea urchin. We give explicit descriptions of…

Let $D$ denote the distance matrix for an $n+1$ point metric space $(X,d)$. In the case that $X$ is an unweighted metric tree, the sum of the entries in $D^{-1}$ is always equal to $2/n$. Such trees can be considered as affinely independent…

Nonlinear least-squares problems are a special class of unconstrained optimization problems in which their gradient and Hessian have special structures. In this paper, we exploit these structures and proposed a matrix-free algorithm with a…

We consider the numerical evaluation of the quantity $Af(A^{-1}B)$, where $A$ is Hermitian positive definite, $B$ is Hermitian, and $f$ is a function defined on the spectrum of $A^{-1}B$. This problem is related to the Hermitian-definite…

This paper presents a data structure that summarizes distances between configurations across a robot configuration space, using a binary space partition whose cells contain parameters used for a locally linear approximation of the distance…

Given a metric pair $(X,A)$, i.e. a metric space $X$ and a distinguished closed set $A \subset X$, one may construct in a functorial way a pointed pseudometric space $\mathcal{D}_\infty(X,A)$ of persistence diagrams equipped with the…

We consider linear codes over a finite field of odd characteristic, derived from determinantal varieties, obtained from symmetric matrices of bounded ranks. A formula for the weight of a code word is derived. Using this formula, we have…

Numerical computations involving rational matrices often benefit from preserving underlying matrix structures such as symmetry, Hermitian properties, or sparsity that reflect physical, geometric, or algebraic characteristics of the system.…

In this paper we study various difference equations related to Jacobi-type pencils. By a Jacobi-type pencil one means the following pencil: $J_5 - \lambda J_3$, where $J_3$ is a Jacobi matrix and $J_5$ is a semi-infinite real symmetric…

The matrix pencil (A,B) = {tB-A | t \in C} is considered under the assumptions that A is entrywise nonnegative and B-A is a nonsingular M-matrix. As t varies in [0,1], the Z-matrices tB-A are partitioned into the sets L_s introduced by…

We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two nonderogatory matrices. We also describe…

We prove that we can always construct strongly minimal linearizations of an arbitrary rational matrix from its Laurent expansion around the point at infinity, which happens to be the case for polynomial matrices expressed in the monomial…

Let $T$ be a tree with vertex set $\{1, \ldots, n\}$ such that each edge is assigned a nonzero weight. The squared distance matrix of $T,$ denoted by $\Delta,$ is the $n \times n$ matrix with $(i,j)$-element $d(i,j)^2,$ where $d(i,j)$ is…