Related papers: High Performance Solution of Skew-symmetric Eigenv…
We investigate a method to solve a class of Schr{\"o}dinger equation eigenvalue problems numerically to very high precision $P$ (from thousands to a million of decimals). The memory requirement, and the number of high precision algebraic…
In this paper, we consider the Newton-Schur method in Hilbert space and obtain quadratic convergence. For the symmetric elliptic eigenvalue problem discretized by the standard finite element method and non-overlapping domain decomposition…
A new method for solving the Bethe-Salpeter equation is developed. It allows to find the Bethe-Salpeter amplitudes both in Minkowski and in Euclidean spaces and, as a by product, the light-front wave function. The method is valid for any…
We propose a flexible machine-learning framework for solving eigenvalue problems of diffusion operators in moderately large dimension. We improve on existing Neural Networks (NNs) eigensolvers by demonstrating our approach ability to…
In one of the most important methods in Density Functional Theory - the Full-Potential Linearized Augmented Plane Wave (FLAPW) method - dense generalized eigenproblems are organized in long sequences. Moreover each eigenproblem is strongly…
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…
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…
Important computational physics problems are often large-scale in nature, and it is highly desirable to have robust and high performing computational frameworks that can quickly address these problems. However, it is no trivial task to…
The computation of the dominant eigenpair for symmetric positive semidefinite matrices is fundamental in numerical optimization. This work shifts the paradigm from the classical Rayleigh quotient to an unconstrained difference formulation,…
This work studies the problem of maximizing a higher degree real homogeneous multivariate polynomial over the unit sphere. This problem is equivalent to finding the leading eigenvalue of the associated symmetric tensor of higher order,…
The power method is a basic method for computing the dominant eigenpair of a matrix. In this paper, we propose a structure-preserving power-like method for computing the dominant conjugate pair of purely imaginary eigenvalues and the…
Operator eigenvalue problems play a critical role in various scientific fields and engineering applications, yet numerical methods are hindered by the curse of dimensionality. Recent deep learning methods provide an efficient approach to…
Inspired by the quantum computing algorithms for Linear Algebra problems [HHL,TaShma] we study how the simulation on a classical computer of this type of "Phase Estimation algorithms" performs when we apply it to solve the Eigen-Problem of…
We present a new algorithm for solving an eigenvalue problem for a real symmetric arrowhead matrix. The algorithm computes all eigenvalues and all components of the corresponding eigenvectors with high relative accuracy in $O(n^{2})$…
We describe an algorithm to compute the extremal eigenvalues and corresponding eigenvectors of a symmetric matrix by solving a sequence of Quadratic Binary Optimization problems. This algorithm is robust across many different classes of…
This paper introduces a new robust interior point method analysis for semidefinite programming (SDP). This new robust analysis can be combined with either logarithmic barrier or hybrid barrier. Under this new framework, we can improve the…
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…
We present an efficient implementation of the Bethe-Salpeter equation (BSE) method for obtaining core-level spectra including x-ray absorption (XAS), x-ray emission (XES), and both resonant and non-resonant inelastic x-ray scattering…
The discretized Bethe-Salpeter eigenvalue problem arises in the Green's function evaluation in many body physics and quantum chemistry. Discretization leads to a matrix eigenvalue problem for $H \in \mathbb{C}^{2n\times 2n}$ with a…
We present a method to linearize, without approximation, a specific class of eigenvalue problems with eigenvector nonlinearities (NEPv), where the nonlinearities are expressed by scalar functions that are defined by a quotient of linear…