Related papers: Solution of the $k$-th eigenvalue problem in large…
A new procedure is constructed by means of APS in APLAN language. The procedure solves the initial-value problem for linear differential equations of order $k$ with polynomial coefficients and regular singularity in the initialization point…
A deflated and restarted Lanczos algorithm to solve hermitian linear systems, and at the same time compute eigenvalues and eigenvectors for application to multiple right-hand sides, is described. For the first right-hand side, eigenvectors…
We discuss a remarkable property of an iterative algorithm for eigenvalue problems recently advanced by Waxman that constitutes a clear advantage over other iterative procedures. In quantum mechanics, as well as in other fields, it is often…
We present a novel technique for sparse principal component analysis. This method, named Eigenvectors from Eigenvalues Sparse Principal Component Analysis (EESPCA), is based on the formula for computing squared eigenvector loadings of a…
The eigenvalue problem for 3x3 octonionic Hermitian matrices contains some surprises, which we have reported elsewhere. In particular, the eigenvalues need not be real, there are 6 rather than 3 real eigenvalues, and the corresponding…
We discuss a quartic eigenvalue problem arising in the context of an optical waveguiding problem involving atomically thick 2D materials. The waveguide configuration we consider consists of a gradient-index (spatially dependent) dielectric…
Quantum algorithms for scientific computing and their applications have been studied actively. In this paper, we propose a quantum algorithm for estimating the first eigenvalue of a differential operator $\mathcal{L}$ on $\mathbb{R}^d$ and…
We consider the solution of large-scale nonlinear algebraic Hermitian eigenproblems of the form $T(\lambda)v=0$ that admit a variational characterization of eigenvalues. These problems arise in a variety of applications and are…
We propose a two-sided Lanczos method for the nonlinear eigenvalue problem (NEP). This two-sided approach provides approximations to both the right and left eigenvectors of the eigenvalues of interest. The method implicitly works with…
We provide a comparative study of the Subspace Projected Approximate Matrix method, abbreviated SPAM, which is a fairly recent iterative method to compute a few eigenvalues of a Hermitian matrix $A$. It falls in the category of inner-outer…
We establish that the spin-3/2 AKLT model on the honeycomb has a nonzero spectral gap. We use the relation between the anticommutator of two projectors and their sum, and apply it to related AKLT projectors that occupy plaquettes or other…
Estimating the eigenvalues of non-normal matrices is a foundational problem with far-reaching implications, from modeling non-Hermitian quantum systems to analyzing complex fluid dynamics. Yet, this task remains beyond the reach of standard…
We examine some numerical iterative methods for computing the eigenvalues and eigenvectors of real matrices. The five methods examined here range from the simple power iteration method to the more complicated QR iteration method. The…
The real symmetric tridiagonal eigenproblem is of outstanding importance in numerical computations; it arises frequently as part of eigensolvers for standard and generalized dense Hermitian eigenproblems that are based on a reduction to…
Convergence with respect to the size of the k-points sampling-grid of the Brillouin zone is the main bottleneck in the calculation of optical spectra of periodic crystals via the Bethe-Salpeter equation (BSE). We tackle this challenge by…
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…
The graph Laplacian, a typical representation of a network, is an important matrix that can tell us much about the network structure. In particular its eigenpairs (eigenvalues and eigenvectors) incubate precious topological information…
We consider and analyze applying a spectral inverse iteration algorithm and its subspace iteration variant for computing eigenpairs of an elliptic operator with random coefficients. With these iterative algorithms the solution is sought…
There are many numerical methods for simulate three-dimensional photonic crystals, after comparison, we choose Yee's scheme to be our discrete method. So far, this method can only be applied to simple cubic lattice and face-centered cubic…
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…