Related papers: Spectral Transformation Algorithms for Computing U…
The ability to decompose a signal in an orthonormal basis (a set of orthogonal components, each normalized to have unit length) using a fast numerical procedure rests at the heart of many signal processing methods and applications. The…
The inverse spectral problem for the second-order differential pencil with quadratic dependence on the spectral parameter is studied. We obtain sufficient conditions for the global solvability of the inverse problem, prove its local…
In many applications it is important to understand the sensitivity of eigenvalues of a matrix polynomial to perturbations of the polynomial. The sensitivity commonly is described by condition numbers or pseudospectra. However, the…
Pseudospectral analysis is fundamental for quantifying the sensitivity and transient behavior of nonnormal matrices, yet its computational cost scales cubically with dimension, rendering it prohibitive for large-scale systems. While…
We consider a second order functional-differential pencil with two constant delays of the argument and study the inverse problem of recovering its coefficients from the spectra of two boundary value problems with one common boundary…
This paper is concerned with computations of a few smaller eigenvalues (in absolute value) of a large extremely ill-conditioned matrix. It is shown that smaller eigenvalues can be accurately computed for a diagonally dominant matrix or a…
The work reported in this article presents a high-order, stable, and efficient Gegenbauer pseudospectral method to solve numerically a wide variety of mathematical models. The proposed numerical scheme exploits the stability and the…
The eigenvalue problem for an irreducible non negative matrix $A=[a_{ij}]$ in the max-algebra is the form $A \otimes x = \lambda x$ where $(A \otimes x)_i = \max (a_{ij}x_j), x=(x_1,x_2, \dots, x_n)^t $ and $\lambda $ refers to maximum…
The paper describes several efficient parallel implementations of the one-sided hyperbolic Jacobi-type algorithm for computing eigenvalues and eigenvectors of Hermitian matrices. By appropriate blocking of the algorithms an almost ideal…
Programmable unitary photonic networks that interfere hundreds of modes are emerging as a key technology in energy-efficient sensing, machine learning, cryptography, and linear optical quantum computing applications. In this work, we…
We propose a natural application of Quantum Linear Systems Problem (QLSP) solvers such as the HHL algorithm to efficiently prepare highly excited interior eigenstates of physical Hamiltonians in a variational and targeted manner. This is…
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…
Phase retrieval refers to algorithmic methods for recovering a signal from its phaseless measurements. Local search algorithms that work directly on the non-convex formulation of the problem have been very popular recently. Due to the…
The matrix pencil method is an eigenvalue based approach for the parameter identification of sparse exponential sums. We derive a reconstruction algorithm for multivariate exponential sums that is based on simultaneous diagonalization.…
In this article we are interested for the numerical computation of spectra of non-self adjoint quadratic operators, in two and three spatial dimensions. Indeed, in the multidimensional case very few results are known on the location of the…
Spectral methods have emerged as a simple yet surprisingly effective approach for extracting information from massive, noisy and incomplete data. In a nutshell, spectral methods refer to a collection of algorithms built upon the eigenvalues…
Rigorous, non-asymptotic bounds for the Puiseux expansion of the eigenvalue at infinity are given. Error analysis is provided. Further, the expected value of the eigenvector condition number of a randomly perturbed matrix is estimated. The…
The study of solving the inverse eigenvalue problem for nonnegative matrices has been around for decades. It is clear that an inverse eigenvalue problem is trivial if the desirable matrix is not restricted to a certain structure. Provided…
We propose a second-order accurate method to estimate the eigenvectors of extremely large matrices thereby addressing a problem of relevance to statisticians working in the analysis of very large datasets. More specifically, we show that…
Linear optics (LO) prohibits certain transformations. In this paper, we study the conditions for a computation to be possible in LO. We find that there are finitely many polynomials such that each of these polynomials evaluates to the same…