Related papers: The infinite bi-Lanczos method for nonlinear eigen…
An application of an effective numerical algorithm for solving eigenvalue problems which arise in modelling electronic properties of quantum disordered systems is considered. We study the electron states at the localization-delocalization…
In this paper, we propose a method for computing eigenvalues of elliptic problems using Deep Learning techniques. A key feature of our approach is that it is independent of the space dimension and can compute arbitrary eigenvalues without…
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…
In this paper, linearly structured partial polynomial inverse eigenvalue problem is considered for the $n\times n$ matrix polynomial of arbitrary degree $k$. Given a set of $m$ eigenpairs ($1 \leqslant m \leqslant kn$), this problem…
The harmonic Lanczos bidiagonalization method can be used to compute the smallest singular triplets of a large matrix $A$. We prove that for good enough projection subspaces harmonic Ritz values converge if the columns of $A$ are strongly…
Numerical solution of nonlinear eigenvalue problems (NEPs) is frequently encountered in computational science and engineering. The applicability of most existing methods is limited by matrix structures, property of eigen-solutions, size of…
This paper combines two ingredients in order to get a rather surprising result on one of the most studied, elegant and powerful tools for solving convex feasibility problems, the method of alternating projections (MAP). Going back to names…
We extend the error bounds from [SIMAX, Vol. 43, Iss. 2, pp. 787-811 (2022)] for the Lanczos method for matrix function approximation to the block algorithm. Numerical experiments suggest that our bounds are fairly robust to changing block…
We present a novel approach to accelerate iterative methods to solve nonlinear Schr\"odinger eigenvalue problems using neural networks. Nonlinear eigenvector problems are fundamental in quantum mechanics and other fields, yet conventional…
The Lagrange mesh method is a very simple procedure to accurately solve eigenvalue problems starting from a given nonrelativistic or semirelativistic two-body Hamiltonian with local or nonlocal potential. We show in this work that it can be…
This paper revisits the error analysis of the Stochastic Lanczos Quadrature (SLQ) method for approximating the trace of matrix functions, with a specific focus on asymmetric Lanczos quadrature rules. We reexplain an existing theoretical…
In this paper, we discuss numerical methods for the eigenvalue decomposition of real symmetric matrices. While many existing methods can compute approximate eigenpairs with sufficiently small backward errors, the magnitude of the resulting…
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…
The Lorentz Integral Transform (LIT) method is reformulated via the Lanczos algorithm both for inclusive and exclusive reactions. The new technique is tested for the total photoabsorption cross section of 3H and 4He. Due to the rapid…
We propose a new method to solve the eigen-value problem with a two-center single-particle potential. This method combines the usual matrix diagonalization with the method of separable representation of a two-center potential, that is, an…
We introduce a new algorithm for finding the eigenvalues and eigenvectors of Hermitian matrices within a specified region, based upon the LANSO algorithm of Parlett and Scott. It uses selective reorthogonalization to avoid the duplication…
We present a comparative study of the application of modern eigenvalue algorithms to an eigenvalue problem arising in quantum physics, namely, the computation of a few interior eigenvalues and their associated eigenvectors for the large,…
Solving polynomial eigenvalue problems with eigenvector nonlinearities (PEPv) is an interesting computational challenge, outside the reach of the well-developed methods for nonlinear eigenvalue problems. We present a natural generalization…
We present a new structure preserving Lanczos algorithm for approximating the optical absorption spectrum in the context of solving full Bethe--Salpeter equation without Tamm--Dancoff approximation. The new algorithm is based on a structure…
We develop quaternion--native iterative methods for computing the Moore--Penrose (MP) pseudoinverse of quaternion matrices and analyze their convergence. Our starting point is a damped Newton--Schulz (NS) iteration tailored to…