Related papers: Strict localization of eigenvectors and eigenvalue…
An S-type eigenvalue localization set for a tensor is given by breaking N={1,2,...,n} into disjoint subsets S and its complement. It is shown that the new set is tighter than those provided by L. Qi (Journal of Symbolic Computation 40…
A novel orthogonalization-free method together with two specific algorithms are proposed to solve extreme eigenvalue problems. On top of gradient-based algorithms, the proposed algorithms modify the multi-column gradient such that earlier…
Geometrically, the eigenvectors of a square matrix $\mathbf{A}$ are not rotated by $\mathbf{A}$. Here we consider vectors that are rotated $\pi/2$ by $\mathbf{A}$; that is, vectors orthogonal to their images. We call these vectors…
Exact ground-state properties are presented by combining the diagonalization in the Fock space (and taking all hopping integrals and all two-site interactions) with the ab initio optimization of the Wannier functions. Electrons are…
Information of localization properties of eigenvectors of the complex network has applicability in many different areas which include networks centrality measures, spectral partitioning, development of approximation algorithms, and disease…
In this work we provide a localization formulae for odd holomorphic super vector fields on compact complex supermanifolds with fermionic dimension equal to the bosonic dimension. We prove a residue theorem for holomorphic super vector…
We give an introduction to the theory and to some applications of eigenvectors of tensors (in other words, invariant one-dimensional subspaces of homogeneous polynomial maps), including a review of some concepts that are useful for their…
We consider some random band matrices with band-width $N^\mu$ whose entries are independent random variables with distribution tail in $x^{-\alpha}$. We consider the largest eigenvalues and the associated eigenvectors and prove the…
In this article we give a totally new proof of the integral localization formula for equivariantly closed differential forms (Theorem 7.11 in [BGV]). We restate it here as Theorem 2. This localization formula is very well known, but the…
We present an improved form of the algorithm for constructing Jacobi rotations. This is simultaneously a more accurate code for finding the eigenvalues and eigenvectors of a real symmetric 2x2 matrix.
In this article, we propose a few sufficient conditions on polynomials having integer coefficients all of whose zeros lie outside a closed disc centered at the origin in the complex plane and deduce the irreducibility over the ring of…
In this paper, we derive new bounds for the zeros of quaternionic polynomials by applying localization theorems, which includes Gershgorin-type theorems for the left eigenvalues of matrices of left monic quaternionic polynomials. These…
We present a brief introduction to the Berline-Vergne localization formula which expresses the integral of an equivariant cohomology class as a sum over zeros of a vector field to which that class is related.
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…
In this article we introduce a new method, which we call a mutation-sunflower method, for calculating max-eigenvectors of a nonnegative irreducible $n\times n$ matrix $A$. Our method works in the general irreducible case, but it is in…
In many applications, the information about the number of eigenvalues inside a given region is required. In this paper, we propose a contour-integral based method for this purpose. The new method is motivated by two findings. There exist…
The main focus of this work is the study of several cones relating the eigenvalues or singular values of a matrix to those of its off-diagonal blocks.
In applications of linear algebra including nuclear physics and structural dynamics, there is a need to deal with uncertainty in the matrices. We focus on matrices that depend on a set of parameters $\omega$ and we are interested in the…
In this paper, we describe a new algorithm that approximates the extreme eigenvalue/eigenvector pairs of a symmetric matrix. The proposed algorithm can be viewed as an extension of the Jacobi eigenvalue method for symmetric matrices…
Robot localization is a one of the most important problems in robotics. Most of the existing approaches assume that the map of the environment is available beforehand and focus on accurate metrical localization. In this paper, we address…