相关论文: A homotopy method for finding eigenvalues and eige…
In this chapter we are examining several iterative methods for solving nonlinear eigenvalue problems. These arise in variational image-processing, graph partition and classification, nonlinear physics and more. The canonical eigenproblem we…
The method of computing eigenvectors from eigenvalues of submatrices can be shown as equivalent to a method of computing the constraint which achieves specified stationary values of a quadratic optimization. Similarly, we show computation…
The main purpose of this paper is providing a simple method to generate the matrices of irreducible representations because it is useful to reduce the computational time of solving the eigenvalue problems. The only information we need to…
We prove that there exist K\"{a}hler manifolds that are not homotopy equivalent to a quotient of complex hyperbolic space but which admit a Riemannian metric with nonpositive curvature operator. This shows that K\"{a}hler manifolds do not…
In this paper we study Steklov eigenvalues for the Lam\'e operator which arise in the theory of linear elasticity. In this eigenproblem the spectral parameter appears in a Robin boundary condition, linking the traction and the displacement.…
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 the eigenvalue problem of certain kind of non-compact linear operators given as the sum of a multiplication and a kernel operator. A degenerate kernel method is used to approximate isolated eigenvalues. It is shown that entries…
Eigenvector-dependent nonlinear eigenvalue problems are considered which arise from the finite difference discretizations of the Gross-Pitaevskii equation. Existence and uniqueness of positive eigenvector for both one and two dimensional…
This paper presents a hybrid variational quantum algorithm that finds a random eigenvector of a unitary matrix with a known quantum circuit. The algorithm is based on the SWAP test on trial states generated by a parametrized quantum…
We give an $O(n)$ time and space algorithm for constructing a diagonal matrix congruent to A+xI, where A is the adjacency matrix of a cograph and $x\in \mathbb{R}$. Applications include determining the number of eigenvalues of a cograph's…
We study a Fermi Hamilton operator $\hat K$ which does not commute with the number operator $\hat N$. The eigenvalue problem and the Schr\"odinger equation is solved. Entanglement is also discussed. Furthermore the Lie algebra generated by…
In this paper we bring to light an unprecedented property of the eigenvalues of a matrix A with the eigenvalues and eigenvectors of a submatrix of A. This property can be used, through the technique developed here, to determine some of…
We show that the eigenvalues and eigenfunctions of the stargenvalue equation can be completely expressed in terms of the corresponding eigenvalue problem for the quantum Hamiltonian. Our method makes use of a Weyl-type representation of the…
Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient…
We study Laplace eigenvalues $\lambda_k$ on K\"ahler manifolds as functionals on the space of K\"ahler metrics with cohomologous K\"ahler forms. We introduce a natural notion of a $\lambda_k$-extremal K\"ahler metric and obtain necessary…
An approximate method is suggested to obtain analytical expressions for the eigenvalues and eigenfunctions of the some quantum optical models. The method is based on the Lie-type transformation of the Hamiltonians. In a particular case it…
The nonzero eigenvalues of $AB$ are equal to those of $BA$: an identity that holds as long as the products are square, even when $A,B$ are rectangular. This fact naturally suggests an efficient algorithm for computing eigenvalues and…
In the present paper, we deal with a fourth-order boundary value problem problem with eigenparameter dependent boundary conditions and transmission conditions at a interior point. A self-adjoint linear operator A is defined in a suitable…
We prove that if any $\lfloor3d/2 \rfloor$ or fewer elements of a finite family of linear operators $\mathbb K^d\to \mathbb K^d$ ($\mathbb K$ is an arbitrary field) have a common eigenvector then all operators in the family have a common…
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…