Related papers: A structure preserving shift-invert infinite Arnol…
For nonrelativistic Hamiltonians which are shape invariant, analytic expressions for the eigenvalues and eigenvectors can be derived using the well known method of supersymmetric quantum mechanics. Most of these Hamiltonians also possess…
We address an algorithm for the least squares fitting of a subset of the eigenvalues of an unknown Hermitian matrix lying an an affine subspace, called the Lift and Projection (LP) method, due to Chen and Chu (SIAM Journal on Numerical…
In this paper, by introducing a class of relaxed filtered Krylov subspaces, we propose the relaxed filtered Krylov subspace method for computing the eigenvalues with the largest real parts and the corresponding eigenvectors of non-symmetric…
This paper proposes a new hybrid high-order discretization for the biharmonic problem and the corresponding eigenvalue problem. The discrete ansatz space includes degrees of freedom in $n-2$ dimensional submanifolds (e.g., nodal values in…
It is shown that the problem of balancing a nonnegative matrix by positive diagonal matrices can be recast as a constrained nonlinear multiparameter eigenvalue problem. Based on this equivalent formulation some adaptations of the power…
First, we derive explicit computable expressions of structured backward errors of approximate eigenelements of structured matrix polynomials including symmetric, skew-symmetric, Hermitian, skew-Hermitian, even and odd polynomials. We also…
When computing the eigenstructure of matrix pencils associated with the passivity analysis of perturbed port-Hamiltonian descriptor system using a structured generalized eigenvalue method, one should make sure that the computed spectrum…
This paper deals with the discrete system being the finite-difference approximation of the Sturm-Liouville problem with frozen argument. The inverse problem theory is developed for this discrete system. We describe the two principal cases:…
A common challenge faced in quantum physics is finding the extremal eigenvalues and eigenvectors of a Hamiltonian matrix in a vector space so large that linear algebra operations on general vectors are not possible. There are numerous…
This paper introduces a method for computing eigenvalues and eigenvectors of a generalized Hermitian, matrix eigenvalue problem. The work is focused on large scale eigenvalue problems, where the application of a direct inverse is out of…
A certified strategy for determining sharp intervals of enclosure for the eigenvalues of matrix differential operators with singular coefficients is examined. The strategy relies on computing the second order spectrum relative to subspaces…
The Arnoldi-Tikhonov method is a well-established regularization technique for solving large-scale ill-posed linear inverse problems. This method leverages the Arnoldi decomposition to reduce computational complexity by projecting the…
In this paper I describe a new optimal Krylov subspace solver for shifted unitary matrices called the Shifted Unitary Orthogonal Method (SUOM). This algorithm is used as a benchmark against any improvement like the two-grid algorithm. I use…
We extend the method for constructing symmetry operators of higher order for two-dimensional quantum Hamiltonians by Kalnins, Kress and Miller (2010). This expansion method expresses the integral in a finite power series in terms of lower…
A delay Lyapunov matrix corresponding to an exponentially stable system of linear time-invariant delay differential equations can be characterized as the solution of a boundary value problem involving a matrix valued delay differential…
In Parts I and II of this series of papers, three new methods for the computation of eigenvalues of singular pencils were developed: rank-completing perturbations, rank-projections, and augmentation. It was observed that a straightforward…
A powerful method for calculating the eigenvalues of a Hamiltonian operator consists of converting the energy eigenvalue equation into a matrix equation by means of an appropriate basis set of functions. The convergence of the method can be…
We introduce a novel eigenvalue algorithm for near-diagonal matrices inspired by Rayleigh-Schr\"odinger perturbation theory and termed Iterative Perturbative Theory (IPT). Contrary to standard eigenvalue algorithms, which are either…
The vertical modes of linearized equations of motion are widely used by the oceanographic community in numerous theoretical and observational contexts. However, the standard approach for solving the generalized eigenvalue problem using…
The goal of the paper is to investigate the dynamics of the eigenvalues of the Sturm-Liouville operator with summable PT-symmetric potential on the finite interval. It turns out that the case of a complex Airy operator presents an exactly…