Related papers: Variants of thick-restart Lanczos for the Bethe-Sa…
A generalized skew-symmetric Lanczos bidiagonalization (GSSLBD) method is proposed to compute several extreme eigenpairs of a large matrix pair $(A,B)$, where $A$ is skew-symmetric and $B$ is symmetric positive definite. The underlying…
We construct exact eigenvectors and eigenvalues for $U_q(\mathfrak{sp}_{2n})$- and $U_q(\mathfrak{so}_{2n})$-symmetric closed spin chains by means of a nested algebraic Bethe ansatz method. We use a fusion procedure to construct…
The linear response eigenvalue problem, which arises from many scientific and engineering fields, is quite challenging numerically for large-scale sparse/dense system, especially when it has zero eigenvalues. Based on a direct sum…
A hyperbolic system must have a set of linearly independent eigenvectors and corresponding real eigenvalues. In numerical simulations, however, the eigenvalues can be complex because truncation errors pollute a characteristic polynomial of…
We study the stability of the Lanczos algorithm run on problems whose eigenvector empirical spectral distribution is near to a reference measure with well-behaved orthogonal polynomials. We give a backwards stability result which can be…
The eigenvalue problem for the p-wave bound states formed by two unequal-mass scalar particles through the massive scalar particle exchange is analyzed numerically in the framework of the Bethe-Salpeter ladder model. As in the s-wave case,…
We report an efficient program for computing the eigenvalues and symmetry-adapted eigenvectors of very large quaternionic (or Hermitian skew-Hamiltonian) matrices, using which structure-preserving diagonalization of matrices of dimension N…
Building on previous work that provided analytical solutions to generalised matrix eigenvalue problems arising from numerical discretisations, this paper develops exact eigenvalues and eigenvectors for a broader class of $n$-dimensional…
For Hermitian positive definite linear systems and eigenvalue problems, the eigCG algorithm is a memory efficient algorithm that solves the linear system and simultaneously computes some of its eigenvalues. The algorithm is based on the…
We present numerical upscaling techniques for a class of linear second-order self-adjoint elliptic partial differential operators (or their high-resolution finite element discretization). As prototypes for the application of our theory we…
Observing renewed interest in long-standing (semi-) relativistic descriptions of bound states, we would like to make a few comments on the eigenvalue problem posed by the spinless Salpeter equation and, illustrated by the examples of the…
A two dimensional eigenvalue problem (2DEVP) of a Hermitian matrix pair $(A, C)$ is introduced in this paper. The 2DEVP can be viewed as a linear algebraic formulation of the well-known eigenvalue optimization problem of the parameter…
We describe preconditioned iterative methods for estimating the number of eigenvalues of a Hermitian matrix within a given interval. Such estimation is useful in a number of applications.In particular, it can be used to develop an efficient…
The eigenvectors of the Hamiltonian ${\cal H}_{N}$ of $N$-sites quantum spin chains with elliptic exchange are connected with the double Bloch meromorphic solutions of the quantum continuous elliptic Calogero-Moser problem. This fact allows…
Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value…
This paper introduces an efficient algorithm for finding the dominant generalized eigenvectors of a pair of symmetric matrices. Combining tools from approximation theory and convex optimization, we develop a simple scalable algorithm with…
This article is devoted to computing the lower and upper bounds of the Laplace eigenvalue problem. By using the special nonconforming finite elements, i.e., enriched Crouzeix-Raviart element and extension $Q_1^{\rm rot}$, we get the lower…
The technique that was used to build the EigCG algorithm for sparse symmetric linear systems is extended to the nonsymmetric case using the BiCG algorithm. We show that, similarly to the symmetric case, we can build an algorithm that is…
In this paper we present a mathematical and numerical analysis of an eigenvalue problem associated to the elasticity-Stokes equations stated in two and three dimensions. Both problems are related through the Herrmann pressure. Employing the…
Recently, there has been interest in high-precision approximations of the first eigenvalue of the Laplace-Beltrami operator on spherical triangles for combinatorial purposes. We compute improved and certified enclosures to these…