Related papers: Zero Assignment, Pole Placement and Matrix Extensi…
We solve the problem of best approximation by partial isometries of given rank to an arbitrary rectangular matrix, when the distance is measured in any unitarily invariant norm. In the case where the norm is strictly convex, we parametrize…
The eigenvalue method, suggested by the developer of the extensively used Analytic Hierarchy Process methodology, exhibits right-left asymmetry: the priorities derived from the right eigenvector do not necessarily coincide with the…
In this paper we deal with an eigenvalue problem in an interface elliptic equation. We characterize the set of principal eigenvalues as a level set of a concave and regular function. As application, we study a problem arising in population…
This paper examines the properties of real symmetric square matrices with a constant value for the main diagonal elements and another constant value for all off-diagonal elements. This matrix form is a simple subclass of circulant matrices,…
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…
We obtain several Cauchy-like and Pellet-like results for the zeros of a general complex polynomial by considering similarity transformations of the squared companion matrix and the reformulation of the zeros of a scalar polynomial as the…
We give sufficient conditions of the nonnegative inverse eigenvalue problem (NIEP) for normal centrosymmetric matrices. These sufficient conditions are analogous to the sufficient conditions of the NIEP for normal matrices given by Xu [16]…
Different variants of approximate inverse iteration like the locally optimal block preconditioned conjugate gradient method became in recent years increasingly popular for the solution of the large matrix eigenvalue problems arising from…
We study the computability of the operator norm of a matrix with respect to norms induced by linear operators. Our findings reveal that this problem can be solved exactly in polynomial time in certain situations, and we discuss how it can…
We present a formulation of the relative depth estimation from a single image problem, as a ranking problem. By reformulating the problem this way, we were able to utilize literature on the ranking problem, and apply the existing knowledge…
In this article we show and implement a simple and effcient method to strictly locate eigenvectors and eigenvalues of a given matrix, based on the modified cone condition. As a consequence we can also effectively localize zeros of complex…
The aim of this work is to characterize linear maps of inner pro\-duct infinite-dimensional vector spaces where the Moore-Penrose inverse exists. This MP inverse generalizes the well-known Moore-Penrose inverse of a matrix $A\in…
A new approach to solving eigenvalue optimization problems for large structured matrices is proposed and studied. The class of optimization problems considered is related to computing structured pseudospectra and their extremal points, and…
The parallel orbital-updating approach is an orbital/eigenfunction iteration based approach for solving eigenvalue problems when many eigenpairs are required. It has been proven to be efficient, for instance, in electronic structure…
A representation of the Pad\'e approximation of the $Z$-transform of a signal as a resolvent of a tridiagonal matrix $J$ is given. Several formulas for the poles, zeros and residues of the Pad\'e approximation in terms of the matrix $J$ are…
In this paper, the concept of generalized spectral function is introduced for finite-order tridiagonal symmetric matrices (Jacobi matrices) with complex entries. The structure of the generalized spectral function is described in terms of…
We consider a matrix pencil whose coefficients depend on a positive parameter $\epsilon$, and have asymptotic equivalents of the form $a\epsilon^A$ when $\epsilon$ goes to zero, where the leading coefficient $a$ is complex, and the leading…
The main purpose of this paper is to present the generalization of the inequalities between the modulus of the polar derivative and the polynomial itself, depending on consideration of the zeros inside and outside of a closed disk and the…
The eigenvalue problem plays a central role in linear algebra and its applications in control and optimization methods. In particular, many matrix decompositions rely upon computation of eigenvalue-eigenvector pairs, such as diagonal or…
We show that the projection of an axisymmetric three-dimensional orientation distribution to two dimensions can be cast into an Abel transform. Based on this correspondence, we derive an exact integral inverse, which allows for the…