Related papers: New numerical algorithm for deflation of infinite …
In this paper we present an iterative method, inspired by the inverse iteration with shift technique of finite linear algebra, designed to find the eigenvalues and eigenfunctions of the Laplacian with homogeneous Dirichlet boundary…
The polar decomposition for a matrix $A$ is $A=UB$, where $B$ is a positive Hermitian matrix and $U$ is unitary (or, if $A$ is not square, an isometry). This paper shows that the ability to apply a Hamiltonian $\pmatrix{ 0 & A^\dagger \cr A…
We propose two different strategies to find eigenvalues and eigenvectors of a given, not necessarily Hermitian, matrix $A$. Our methods apply also to the case of complex eigenvalues, making the strategies interesting for applications to…
A novel perturbative method, proposed by Panda {\it et al.} [1] to solve the Helmholtz equation in two dimensions, is extended to three dimensions for general boundary surfaces. Although a few numerical works are available in the literature…
In this article, we present two new greedy algorithms for the computation of the lowest eigenvalue (and an associated eigenvector) of a high-dimensional eigenvalue problem, and prove some convergence results for these algorithms and their…
The finite dimensional representations of associative quadratic algebras with three generators are investigated by using a technique based on the deformed parafermionic oscillator algebra. One application on the calculation of the…
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…
The aim of this paper is to develop an algebraic multigrid method to solve eigenvalue problems based on the combination of the multilevel correction scheme and the algebraic multigrid method for linear equations. Our approach uses the…
Recent studies on quantum computing algorithms focus on excavating features of quantum computers which have potential for contributing to computational model enhancements. Among various approaches, quantum annealing methods effectively…
Gradient descent method, as one of the major methods in numerical optimization, is the key ingredient in many machine learning algorithms. As one of the most fundamental way to solve the optimization problems, it promises the function value…
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…
This manuscript develops a new framework to analyze and design iterative optimization algorithms built on the notion of Integral Quadratic Constraints (IQC) from robust control theory. IQCs provide sufficient conditions for the stability of…
An algorithm for computing eigenvalues and eigenfunctions of the angular spheroidal wave equation, based on a known but scarcely used method, is developed. By requiring the regularity of the wave function, represented by its series…
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,…
A numerical matrix methodology is applied to quantum problems with periodic potentials. The procedure consists essentially in replacing the true potential by an alternative one, restricted by an infinite square well, and in expressing the…
An algorithm named EigenWave is described to compute eigenvalues and eigenvectors of elliptic boundary value problems. The algorithm, based on the recently developed WaveHoltz scheme, solves a related time-dependent wave equation as part of…
In this article, we describe an implementation of a polynomial system solver to compute the approximate solutions of a 0-dimensional polynomial system with finite precision p-adic arithmetic. We also describe an improvement to an algorithm…
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin…
The log-conformation formulation, although highly successful, was from the beginning formulated as a partial differential equation that contains an, for PDEs unusual, eigenvalue decomposition of the unknown field. To this day, most…
The Hadamard decomposition is a powerful technique for data analysis and matrix compression, which decomposes a given matrix into the element-wise product of two or more low-rank matrices. In this paper, we develop an efficient algorithm to…