相关论文: On the shift-invert Lanczos method for the bucklin…

The computation of the partial generalized singular value decomposition (GSVD) of large-scale matrix pairs can be approached by means of iterative methods based on expanding subspaces, particularly Krylov subspaces. We consider the joint…

KKL observer design consists in finding a smooth change of coordinates transforming the system dynamics into a linear filter of the output. The state of the original system is then reconstructed by implementing this filter from any initial…

We introduce concepts of essential numerical range for the linear operator pencil $\lambda\mapsto A-\lambda B$. In contrast to the operator essential numerical range, the pencil essential numerical ranges are, in general, neither convex nor…

Let $\left( X,\left\Vert \cdot\right\Vert_{X}\right) $ and $\left( Y,\left\Vert \cdot\right\Vert_{Y}\right) $ be Banach spaces over $\mathbb{R},$ with $X$ uniformly convex and compactly embedded into $Y.$ The inverse iteration method is…

LSQR, a Lanczos bidiagonalization based Krylov subspace iterative method, and its mathematically equivalent CGLS applied to normal equations system, are commonly used for large-scale discrete ill-posed problems. It is well known that LSQR…

We prove inclusion theorems for both spectra and essential spectra as well as two-sided bounds for isolated eigenvalues for Klein-Gordon type Hamiltonian operators. We first study operators of the form $JG$, where $J$, $G$ are selfadjoint…

For the Hermitian inexact Rayleigh quotient iteration (RQI), the author has established new local general convergence results, independent of iterative solvers for inner linear systems. The theory shows that the method locally converges…

Motivated by a recent analysis which presents explicitly the general solution, we consider the eigenvalue problem of the spinless Salpeter equation with a ("hard-core amended") Coulomb potential in one dimension. We prove the existence of a…

The numerical solution of eigenvalue problems is essential in various application areas of scientific and engineering domains. In many problem classes, the practical interest is only a small subset of eigenvalues so it is unnecessary to…

We introduce a new algorithm for finding the eigenvalues and eigenvectors of Hermitian matrices within a specified region, based upon the LANSO algorithm of Parlett and Scott. It uses selective reorthogonalization to avoid the duplication…

Recent work introduced a new framework for analyzing correlation functions with improved convergence and signal-to-noise properties, as well as rigorous quantification of excited-state effects, based on the Lanczos algorithm and spurious…

In the paper, we study an inverse spectral problem for quadratic pencils of the Sturm--Liouville operators with singular coefficients and entire functions in the boundary conditions. We prove that a subspectrum is sufficient for recovering…

This paper is a didactic commentary (a transcription with variations) to the paper of S.R. Foguel {\it Finite Dimensional Perturbations in Banach Spaces}. Addressed, mainly: postgraduates and related readers. Subject: Suppose we have two…

We investigate the following eigenvalue problem \begin{align*} \begin{cases} -\operatorname{div}\left( L(x) |\nabla u| ^{p-2}\nabla u\right)=\lambda K(x)|u|^{p-2}u \quad \text{in } A_{R_1}^{R_2} , u=0\quad \text{on } \partial A_{R_1}^{R_2}…

Pole-swapping algorithms, which are generalizations of the QZ algorithm for the generalized eigenvalue problem, are studied. A new modular (and therefore more flexible) convergence theory that applies to all pole-swapping algorithms is…

In this paper, we consider the following eigenvalue problem {{l} (|u"|^{p-2}u")"=\lambda m(x)|u|^{p-2}u, x\in (0,1), u(0)=u(1)=u"(0)=u"(1)=0, where $1<p<+\infty$, $\lambda$ is a real parameter and $m$ is sign-changing weight. We prove there…

We study the computational complexity of the eigenvalue problem for the Klein-Gordon equation in the framework of the Solvability Complexity Index Hierarchy. We prove that the eigenvalue of the Klein-Gordon equation with linearly decaying…

Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value…

Quadratic minimization problems with orthogonality constraints (QMPO) play an important role in many applications of science and engineering. However, some existing methods may suffer from low accuracy or heavy workload for large-scale…

Blind gain and phase calibration (BGPC) is a bilinear inverse problem involving the determination of unknown gains and phases of the sensing system, and the unknown signal, jointly. BGPC arises in numerous applications, e.g., blind albedo…