Related papers: The Nearest Hermitian Inverse Eigenvalue Problem S…
Algebraic Multigrid (AMG) methods have been proven to be effective solvers for large-scale linear algebraic systems $Ax = b$ with Hermitian positive definite (HPD) matrix $A$. For such problems the convergence in the $A$-norm is well…
We study the problem of approximating a matrix $\mathbf{A}$ with a matrix that has a fixed sparsity pattern (e.g., diagonal, banded, etc.), when $\mathbf{A}$ is accessed only by matrix-vector products. We describe a simple randomized…
For compact self-adjoint operators in Hilbert spaces, two algorithms are proposed to provide fully computable a posteriori error estimate for eigenfunction approximation. Both algorithms apply well to the case of tight clusters and multiple…
This paper concerns some inverse eigenvalue problems of the quadratic $\star$-(anti)-palindromic system $Q(\lambda)=\lambda^2 A_1^{\star}+\lambda A_0 + \epsilon A_1$, where $\epsilon=\pm 1$, $A_1, A_0 \in \mathbb{C}^{n\times n}$,…
The largest eigenvalue of a matrix is always larger or equal than its largest diagonal entry. We show that for a large class of random Laplacian matrices, this bound is essentially tight: the largest eigenvalue is, up to lower order terms,…
We consider solving a probably ill-conditioned linear operator equation, where the operator is not modeled by physical laws but is specified via training pairs (consisting of images and data) of the input-output relation of the operator. We…
In this article a unified approach to iterative soft-thresholding algorithms for the solution of linear operator equations in infinite dimensional Hilbert spaces is presented. We formulate the algorithm in the framework of generalized…
When an eigenvector of a semi-bounded operator is positive, we show that a remarkably simple argument allows to obtain upper and lower bounds for its associated eigenvalue. This theorem is a substantial generalization of Barta-like…
Matrix quasi exactly solvable operators are considered and new conditions are determined to test whether a matrix differential operator possesses one or several finite dimensional invariant vector spaces. New examples of $2\times 2$-matrix…
In modeling quantum systems or wave phenomena, one is often interested in identifying eigenstates that approximately carry a specified property; scattering states approximately align with incoming and outgoing traveling waves, for instance,…
A method for approximate solution of initial value and spectral problems for one dimensional Dirac equation based on an analytic approximation of the transmutation operator is presented. In fact the problem of numerical approximation of…
In this work, we consider the approximation of Hilbert space-valued meromorphic functions that arise as solution maps of parametric PDEs whose operator is the shift of an operator with normal and compact resolvent, e.g. the Helmholtz…
In this paper we show how to recover a spectral approximations to broad classes of structured matrices using only a polylogarithmic number of adaptive linear measurements to either the matrix or its inverse. Leveraging this result we obtain…
We present numerical upscaling techniques for a class of linear second-order self-adjoint elliptic partial differential operators (or their high-resolution finite element discretization). As prototypes for the application of our theory we…
For the direct problem, we give the asymptotic distribution of the (real and non-real) transmission eigenvalues for the Schrodinger operator on the half line. For the inverse problem, we prove that the potential can be uniquely determined…
We propose the notion of $E_{2}$-quasi-exact solvability and apply this idea to find explicit solutions to the eigenvalue problem for a non-Hermitian Hamiltonian system depending on two parameters. The model considered reduces to the…
Eigenvalue problems for elliptic operators play an important role in science and engineering applications, where efficient and accurate numerical computation is essential. In this work, we propose a novel operator inference approach for…
Given a structured matrix $A$ we study the problem of finding the closest normal matrix with the same structure. The structures of our interest are: Hamiltonian, skew-Hamiltonian, per-Hermitian, and perskew-Hermitian. We develop a…
Standard perturbation theory of eigenvalue problems consists of obtaining approximations of eigenmodes in the neighborhood of an operator where the corresponding eigenmode is known. Nevertheless, if the corresponding eigenmodes of several…
Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…