Related papers: Structure-Preserving {\Gamma}QR and {\Gamma}-Lancz…

We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

With the regular decomposition technique, we decompose the space $\mathbf{H}_0^s(\mathbf{curl}; \Omega)$ into the sum of a vector potential space and the gradient of a scalar space, both possessing higher regularity. Based on this new high…

This thesis presents an efficient quantum algorithm and explicit circuits for generating eigenstates of arbitrary SU(2) and SU(3) representations. These include a wide variety of highly entangled states. The algorithm uses Schur transform…

Quasi-degenerate eigenvalue problems are central to quantum chemistry and condensed-matter physics, where low-energy spectra often form manifolds of nearly degenerate states that determine physical properties. Standard quantum algorithms,…

We provide a novel method for large volatility matrix prediction with high-frequency data by applying eigen-decomposition to daily realized volatility matrix estimators and capturing eigenvalue dynamics with ARMA models. Given a sequence of…

For large-scale discrete-time algebraic Riccati equations (DAREs) with high-rank nonlinear and constant terms, the stabilizing solutions are no longer numerically low-rank, resulting in the obstacle in the computation and storage. However,…

The sparse generalized eigenvalue problem arises in a number of standard and modern statistical learning models, including sparse principal component analysis, sparse Fisher discriminant analysis, and sparse canonical correlation analysis.…

Finding a good approximation of the top eigenvector of a given $d\times d$ matrix $A$ is a basic and important computational problem, with many applications. We give two different quantum algorithms that, given query access to the entries…

This paper lies in the intersection of several fields: number theory, lattice theory, multilinear algebra, and scientific computing. We adapt existing solution algorithms for tensor eigenvalue problems to the tensor-train framework. As an…

The eigenvalue shift technique is the most well-known and fundamental tool for matrix computations. Applications include the search of eigeninformation, the acceleration of numerical algorithms, the study of Google's PageRank. The shift…

We consider a quadrature-based eigensolver to find eigenpairs of Hermitian matrices arising in lattice quantum chromodynamics. To reduce the computational cost for finding eigenpairs of such Hermitian matrices, we propose a new technique…

We propose gauge-covariant neural networks along with a specialized training algorithm for lattice QCD, designed to handle realistic quarks and gluons in four-dimensional space-time. We show that the smearing procedure can be interpreted as…

We describe a quantum algorithm for finding the smallest eigenvalue of a Hermitian matrix. This algorithm combines Quantum Phase Estimation and Quantum Amplitude Estimation to achieve a quadratic speedup with respect to the best classical…

In this paper, we show that the eigenvalues and eigenvectors of the spectral discretisation matrices resulted from the Legendre dual-Petrov-Galerkin (LDPG) method for the $m$th-order initial value problem (IVP): $u^{(m)}(t)=\sigma u(t),\,…

The application of eigenvalue theory to dual quaternion Hermitian matrices holds significance in the realm of multi-agent formation control. In this paper, we study the Rayleigh quotient iteration (RQI) for solving the right eigenpairs of…

We develop an eigenvalue-based approach for the stability assessment and stabilization of linear systems with multiple delays and periodic coefficient matrices. Delays and period are assumed commensurate numbers, such that the Floquet…

We analyze the systematic errors made when using the generalized eigenvalue problem to extract energies and matrix elements in lattice gauge theory. Effective theories such as HQET are also discussed. Numerical results are shown for the…

In this paper, we propose linearly implicit and arbitrary high-order conservative numerical schemes for ordinary differential equations with a quadratic invariant. Many differential equations have invariants, and numerical schemes for…

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…

Versions of GMRES with deflation of eigenvalues are applied to lattice QCD problems. Approximate eigenvectors corresponding to the smallest eigenvalues are generated at the same time that linear equations are solved. The eigenvectors…