Related papers: Estimation to structured distances to singularity …
Let S be a smooth algebraic surface satisfying the following property: H^i(\oc_S(C))=0 (i=1,2) for any irreducible and reduced curve C of S. The aim of this paper is to provide a characterization of special linear systems on S which are…
We consider problems of estimation of structured covariance matrices, and in particular of matrices with a Toeplitz structure. We follow a geometric viewpoint that is based on some suitable notion of distance. To this end, we overview and…
The algebra of observables for identical particles on a line is formulated starting from postulated basic commutation relations. A realization of this algebra in the Calogero model was previously known. New realizations are presented here…
The focus of this paper is the connection between two foundational areas of LTI systems theory: geometric control and eigenstructure assignment. In particular, we study the properties of the null-spaces of the reachability matrix pencil and…
In this paper, the problem of bounding the number of reducible curves in a pencil of algebraic plane curves is addressed. Unlike most of the previous related works, each reducible curve of the pencil is here counted with its appropriate…
We introduce concepts of essential numerical range for the linear operator pencil $\lambda\mapsto A-\lambda B$. In contrast to the operator essential numerical range, the pencil essential numerical ranges are, in general, neither convex nor…
We study associative multiplications in semi-simple associative algebras over C compatible with the usual one or, in other words, linear deformations of semi-simple associative algebras over C. It turns out that these deformations are in…
We explore the concept of eigenvalue avoidance, which is well understood for real symmetric and Hermitian matrices, for other classes of structured matrices. We adopt a differential geometric perspective and study the generic behaviour of…
We give a method for constructing a regularizing decomposition of a matrix pencil, which is formulated in terms of the linear mappings. We prove that two pencils are topologically equivalent if and only if their regularizing decompositions…
The main objective of this article is to develop a matrix pencil approach for the study of the controllability and reachability of a class of linear singular discrete time systems. The description equation of a practical system may be…
In the present paper we study the problem of constructing a family of surfaces (surface pencils) from a given curve in 4-dimensional Euclidean space $\mathbb{E}^{4}$. We have shown that generalized rotation surfaces in $\mathbb{E}^{4}$ are…
We characterize under what conditions $n\times n$ Hermitian matrices $A_1$ and $A_2$ have the property that the spectrum of $\cos t A_1 + \sin t A_2$ is independent of $t$ (thus, the trigonometric pencil $\cos t A_1 + \sin t A_2$ is…
Miniversal deformations for pairs of skew-symmetric matrices under congruence are constructed. To be precise, for each such a pair $(A,B)$ we provide a normal form with a minimal number of independent parameters to which all pairs of…
This work studies the average complexity of solving structured polynomial systems that are characterized by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that…
We study the asymptotic distribution of level crossings for random matrix pencils A_n+\lambda B_n in several ensembles, including complex and real i.i.d. matrices and Gaussian/Hermitian settings. We derive a representation of the normalized…
We prove that the distance from an $n\times n$ complex matrix $M$ to the set of nilpotents is at least $\frac{1}{2}\sec\frac{\pi}{n+2}$ if there is a nonzero projection $P$ such that $PMP=M$ and $M^*M\geq P$. In the particular case where…
We consider the problem of model reduction of parametrized PDEs where the goal is to approximate any function belonging to the set of solutions at a reduced computational cost. For this, the bottom line of most strategies has so far been…
In this paper, we consider the problem of stabilizing discrete-time linear systems by computing a nearby stable matrix to an unstable one. To do so, we provide a new characterization for the set of stable matrices. We show that a matrix $A$…
We study the best approximation and distance problems in the operator space $\B(\HS)$ and in the space of trace class operators $\LS^1(\B(\HS))$. Formulations of distances are obtained in both cases. The case of finite-dimensional…
We derive computable expressions of structured backward errors of approximate eigenelements of *-palindromic and *-anti-palindromic matrix polynomials. We also characterize minimal structured perturbations such that approximate…