Related papers: Generation of orthogonal rational functions by pro…
This paper describes a set of rational filtering algorithms to compute a few eigenvalues (and associated eigenvectors) of non-Hermitian matrix pencils. Our interest lies in computing eigenvalues located inside a given disk, and the proposed…
The inversion problem for rational B\'ezier curves is addressed by using resultant matrices for polynomials expressed in the Bernstein basis. The aim of the work is not to construct an inversion formula but finding the corresponding value…
A popular method for solving large sparse regular eigenvalue problem is the shift-and-invert Arnoldi method. This paper aims to use the method for large sparse singular pencils. In three recent papers, {\em Hochstenbach, Mehl, and…
The nonlinear inverse problem of exponential data fitting is separable since the fitting function is a linear combination of parameterized exponential functions, thus allowing to solve for the linear coefficients separately from the…
We present a class of fast subspace tracking algorithms based on orthogonal iterations for structured matrices/pencils that can be represented as small rank perturbations of unitary matrices. The algorithms rely upon an updated data sparse…
For large-scale eigenvalue problems requiring many mutually orthogonal eigenvectors, traditional numerical methods suffer substantial computational and communication costs with limited parallel scalability, primarily due to explicit…
Such problems as computation of spectra of spin chains and vibrational spectra of molecules can be written as high-dimensional eigenvalue problems, i.e., when the eigenvector can be naturally represented as a multidimensional tensor. Tensor…
Based on the novel prescription for the power of a complex number, a new expression for the eigenfunction of the operator of the third component of the angular momentum is presented. These functions are normalizable, single valued and are…
Inverse iteration is known to be an effective method for computing eigenvectors corresponding to simple and well-separated eigenvalues. In the non-symmetric case, the solution of shifted Hessenberg systems is a central step. Existing…
In present article the self-contained derivation of eigenvalue inverse problem results is given by using a discrete approximation of the Schroedinger operator on a bounded interval as a finite three-diagonal symmetric Jacobi matrix. This…
We consider matrix orthogonal polynomials related to Jacobi type matrices of weights that can be defined in terms of a given matrix Pearson equation. Stating a Riemann-Hilbert problem we can derive first and second order differential…
We consider PDE eigenvalue problems as they occur in two-dimensional photonic crystal modeling. If the permittivity of the material is frequency-dependent, then the eigenvalue problem becomes nonlinear. In the lossless case, linearization…
Contour-integral-based rational filter leads to interior eigensolvers for non-Hermitian generalized eigenvalue problems. Based on Zolotarev's third problem, this paper proves the asymptotic optimality of the trapezoidal quadrature of the…
A general framework for oblique projections of nonhermitian matrices onto rational Krylov subspaces is developed. To obtain this framework we revisit the classical rational Krylov subspace algorithm and prove that the projected matrix can…
The computation of matrix functions is a well-studied problem. Of special importance are the exponential and the logarithm of a matrix, where the latter also raises existence and uniqueness questions. This is particularly relevant in the…
A finite family of $R_I$ polynomials is introduced and studied. It consists in a set of polynomials of $_{3}F_{2}$ form whose biorthogonality to an ensemble of rational functions is spelled out. These polynomials are shown to satisfy two…
The numerical solution of the generalized eigenvalue problem for a singular matrix pencil is challenging due to the discontinuity of its eigenvalues. Classically, such problems are addressed by first extracting the regular part through the…
The parallel orbital-updating approach is an orbital/eigenfunction iteration based approach for solving eigenvalue problems when many eigenpairs are required. It has been proven to be efficient, for instance, in electronic structure…
We consider a pencil of matrix Sturm-Liouville operators on a finite interval. We study properties of its spectral characteristics and inverse problems that consist in recovering of the pencil by the spectral data: eigenvalues and…
The main of this work is to use the unit lower triangular matrices for solving inverse eigenvalue problem of nonnegative matrices and present the easier method to solve this problem.