相关论文: Eigenvectors and Reconstruction
In this paper, we give a new proof on a Theorem of Tutte which says that the determinants of the adjacency matrices of two hypomorphic graphs are the same. We also study the lowest eigenvectors.
Starting from a mistake done by a student, we discover an unexpected method of finding both eigenvectors for a $2\times2$ matrix with distinct eigenvalues in a single computation. We discuss a connection with the Cayley-Hamilton theorem,…
In this paper, we give estimates for both upper and lower bounds of eigenvalues of a simple matrix. The estimates are shaper than the known results.
We give a new theoretical tool to solve sparse systems with finitely many solutions. It is based on toric varieties and basic linear algebra; eigenvalues, eigenvectors and coefficient matrices. We adapt Eigenvalue theorem and Eigenvector…
In our article we consider some algebraical methods which may be useful in some inverse spectral problems. The reconstraction of the matrix from its minors is considered.
In this paper we show that for any affine complete rational surface singularity there is a correspondence between the dual graph of the minimal resolution and the quiver of the endomorphism ring of the special CM modules. We thus call such…
This paper first reviews how anti-symmetric matrices in two dimensions yield imaginary eigenvalues and complex eigenvectors. It is shown how this carries on to rotations by means of the Cayley transformation. Then a real geometric…
We give formulae for first and second derivatives of generalized eigenvalues/eigenvectors of symmetric matrices and generalized singular values/singular vectors of rectangular matrices when the matrices are linear or nonlinear functions of…
Suppose we want to find the eigenvalues and eigenvectors for the linear operator L, and suppose that we have solved this problem for some other "nearby" operator K. In this paper we show how to represent the eigenvalues and eigenvectors of…
Using the vanishing cycles of simple singularities, we study the eigenvectors of Cartan matrices of finite root systems, and of q-deformations of these matrices.
A common challenge faced in quantum physics is finding the extremal eigenvalues and eigenvectors of a Hamiltonian matrix in a vector space so large that linear algebra operations on general vectors are not possible. There are numerous…
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…
This note considers the unstructured sparse recovery problems in a general form. Examples include rational approximation, spectral function estimation, Fourier inversion, Laplace inversion, and sparse deconvolution. The main challenges are…
We present a simple, accurate method for solving consistent, rank-deficient linear systems, with or without addi- tional rank-completing constraints. Such problems arise in a variety of applications, such as the computation of the…
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…
In this paper we are concerned to find the eigenvalues and eigenvectors of a real symetric matrix by applying a new numerical method similar to Jacobi method. Our approch consists to use a new orthogonal matrix. The computation of the…
The paper explores some algebraic constructions arising in the theory of Lefschetz fibrations. Specifically, it covers in a fair amount of detail the algebraic issues outlined in ``Symplectic homology as Hochschild homology''…
A brief review of the eigenvalue matrix model integrability and superintegrability properties, focused on the simplest, still representative, Gaussian Hermitian case.
We consider the problem of finding nonzero eigenvalues and the corresponding eigenvectors of a matrix $AA^{\top}$, where $A$ is a special incidence matrix; This matrix can equivalently be defined based on a match relation between some…
The standard approach for finding eigenvalues and eigenvectors of matrix polynomials starts by embedding the coefficients of the polynomial into a matrix pencil, known as linearization. Building on the pioneering work of Nakatsukasa and…