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

We show that the set of $m \times m$ complex skew-symmetric matrix polynomials of odd grade $d$, i.e., of degree at most $d$, and (normal) rank at most $2r$ is the closure of the single set of matrix polynomials with the certain, explicitly…

The study of linear codes over a finite field of odd cardinality, derived from determinantal varieties obtained from symmetric matrices of bounded rank, was initiated in a recent paper by the authors. There, one found the minimum distance…

The statistical shape analysis called Procrustes analysis minimizes the distance between matrices by similarity transformations. The method returns a set of optimal orthogonal matrices, which project each matrix into a common space. This…

We present an efficient algorithm for computing the closest singular configuration to each non-singular pose of a 3-RPR planar manipulator performing a 1-parametric motion. By considering a 3-RPR manipulator as a planar framework, one can…

To produce cartographic maps, simplification is typically used to reduce complexity of the map to a legible level. With schematic maps, however, this simplification is pushed far beyond the legibility threshold and is instead constrained by…

Semidefinite programming optimises a linear objective function over a spectrahedron, and is one of the major advances of mathematical optimisation. Spectrahedra are described by linear pencils, which are linear matrix polynomials with…

An algebraic condition for the singularity of certain T\"oplitz matrix pencils is derived which involves only the principal minors of the constant parts of the pencils. This leads to an algebraic conjecture which is equivalent to the…

The nonlinear inverse problem of exponential data fitting is separable since the fitting function is a linear combination of parameterized exponential functions, thus allowing to solve for the linear coefficients separately from the…

This paper is devoted to the analysis of linear second order discrete-time descriptor systems (or singular difference equations (SiDEs) with control). Following the algebraic approach proposed by Kunkel and Mehrmann for pencils of matrix…

This article describes an entirely algebraic construction for developing conformal geometries, which provide models for, among others, the Euclidean, spherical and hyperbolic geometries. On one hand, their relationship is usually shown…

We propose a novel method of introducing structure into existing machine learning techniques by developing structure-based similarity and distance measures. To learn structural information, low-dimensional structure of the data is captured…

The distance matrix of a dataset $X$ of $n$ points with respect to a distance function $f$ represents all pairwise distances between points in $X$ induced by $f$. Due to their wide applicability, distance matrices and related families of…

This paper establishes the formula for the stable Griffiths height of the middle-dimensional cohomology of a pencil of projective hypersurfaces $H$, with semihomogeneous singularities, over some smooth projective curve $C$, that appears as…

We solve the problem of determining the Weierstrass structure of a regular matrix pencil obtained by a low rank perturbation of another regular matrix pencil. We apply the result to find necessary and sufficient conditions for the existence…

Consider $n \times n$ matrix $A$ and a set $\Lambda$ consisting of $k \le n$ prescribed complex numbers. Lippert (2010) in a challenging article, studied geometrically the spectral norm distance from $A$ to the set $\Lambda$ and constructed…

Boundary problem for linear partial differential algebraic equations system with multiple characteristic curves is considered. It is supposed that matrix-functions pencil of the system under consideration is smoothly equivalent to special…

A famous theorem by R. Brauer shows how to modify a single eigenvalue of a matrix by a rank-one update without changing the remaining eigenvalues. A generalization of this theorem (due to R. Rado) is used to change a pair of eigenvalues of…

We present a randomized, inverse-free algorithm for producing an approximate diagonalization of any $n \times n$ matrix pencil $(A,B)$. The bulk of the algorithm rests on a randomized divide-and-conquer eigensolver for the generalized…

Abstract differential-algebraic equations (ADAEs) of a semilinear type are studied. Theorems on the existence and uniqueness of solutions and the maximal interval of existence, on the global solvability of the ADAEs, the boundedness of…

In this paper, we discuss tensegrity from the perspective of nonlinear algebra in a manner accessible to undergraduates. We compute explicit examples and include the SAGE and Julia code so that readers can continue their own experiments and…