Related papers: An algorithm for the complete solution of the quar…
A novel method for finding the eigenvalues of a Sturm-Liouville problem is developed. Following the minimalist approach the problem is transformed to a single first-order differential equation with appropriate boundary conditions. Although…
Starting from a comparison of some established numerical algorithms for the computation of the eigenvalues (discrete or solitonic spectrum) of the non-Hermitian version of the Zakharov-Shabat spectral problem, this article delivers new…
Pole-swapping algorithms, which are generalizations of the QZ algorithm for the generalized eigenvalue problem, are studied. A new modular (and therefore more flexible) convergence theory that applies to all pole-swapping algorithms is…
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…
When applying eigenvalue decomposition on the quadratic term matrix in a type of linear equally constrained quadratic programming (EQP), there exists a linear mapping to project optimal solutions between the new EQP formulation where $Q$ is…
Pole-swapping algorithms, generalizations of bulge-chasing algorithms, have been shown to be a viable alternative to the bulge-chasing QZ algorithm for solving the generalized eigenvalue problem for a matrix pencil A - {\lambda}B. It is…
In this paper we presents an algorithm for finding a solution of the linear nonhomogeneous quaternionic-valued differential equations. Moveover, several examples shows the feasibility of our algorithm.
We calculate eigenvalues of one-dimensional quantum-systems by the exact numerical solution of the Lippmann-Schwinger equation, analogous to the scattering problem. To illustrate our method, we treat elementary problems: the harmonic and…
We consider time-harmonic scalar transmission problems between dielectric and dispersive materials with generalized Lorentz frequency laws. For certain frequency ranges such equations involve a sign-change in their principle part. Due to…
We consider the quadratic optimization problem $\max_{x \in C}\ x^T Q x + q^T x$, where $C\subseteq\mathbb{R}^n$ is a box and $r := \mathrm{rank}(Q)$ is assumed to be $\mathcal{O}(1)$ (i.e., fixed). We show that this case can be solved in…
We develop a quantum filter diagonalization method (QFD) that lies somewhere between the variational quantum eigensolver (VQE) and the phase estimation algorithm (PEA) in terms of required quantum circuit resources and conceptual…
Recently, a kind of eigensolvers based on contour integral were developed for computing the eigenvalues inside a given region in the complex plane. The CIRR method is a classic example among this kind of methods. In this paper, we propose a…
This paper introduces the use of tailored variational forms for variational quantum eigensolver that have properties of representing certain constraints on the search domain of a linear constrained quadratic binary optimization problem…
In this paper we consider generalized eigenvalue problems for a family of operators with a quadratic dependence on a complex parameter. Our model is $L(\lambda)=-\triangle +(P(x)-\lambda)^2$ in $L^2(\R^d)$ where $P$ is a positive elliptic…
In this paper, we propose a decomposition approach for eigenvalue problems with spatial symmetries, including the formulation, discretization as well as implementation. This approach can handle eigenvalue problems with either Abelian or…
The semi-relativistic equation is cast into a second-order Schrodinger-like equation with the inclusion of relativistic corrections up to order (v/c)^2. The resulting equation is solved via the shifted-l expansion technique, which has been…
The symplectic eigenvalue problem for symmetric positive-definite (spd) matrices plays a crucial role in various scientific fields, including quantum mechanics and control theory. This paper introduces a trace-penalty minimization method,…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
This work is a continuation of "Fast and backward stable computation of roots of polynomials" by J.L. Aurentz, T. Mach, R. Vandebril, and D.S. Watkins, SIAM Journal on Matrix Analysis and Applications, 36(3): 942--973, 2015. In that paper…
In this paper, we give a quadratic Goldreich-Levin algorithm that is close to optimal in the following ways. Given a bounded function $f$ on the Boolean hypercube $\mathbb{F}_2^n$ and any $\varepsilon>0$, the algorithm returns a quadratic…