𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An inexact Krylov–Schur algorithm for the unitary eigenvalue problem

✍ Scribed by Roden J.A. David; David S. Watkins


Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
173 KB
Volume
429
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

✦ Synopsis


We present an efficient inexact implicitly restarted Arnoldi algorithm to find a few eigenpairs of large unitary matrices. The approximating Krylov spaces are built using short-term recurrences derived from Gragg's isometric Arnoldi process. The implicit restarts are done by the Krylov-Schur methodology of Stewart. All of the operations of the restart are done in terms of the Schur parameters generated by the isometric Arnoldi process. Numerical results confirm the effectiveness of the algorithm.


📜 SIMILAR VOLUMES


The effects of inexact solvers in algori
✍ P. Smit; M.H.C. Paardekooper 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 797 KB

This paper analyses the effects of inaccurate linear solvers on the behaviour of inverse iteration and Rayleigh quotient iteration. We derive an expression for the worst-case perturbation of the convergence factor of the exact iteration, due to the inexact solution. A necessary and sufficient condi

An algorithm for addressing the real int
✍ Milan Hladík; David Daney; Elias P. Tsigaridas 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 511 KB

In this paper we present an algorithm for approximating the range of the real eigenvalues of interval matrices. Such matrices could be used to model real-life problems, where data sets suffer from bounded variations such as uncertainties (e.g. tolerances on parameters, measurement errors), or to stu

An algorithm for the solution of a third
✍ G. S. Schajer; C. D. Mote Jr. 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 302 KB

## Abstract A simple, rapidly convergent procedure is described for solving a third‐order symmetric eigenvalue problem Au = λ Bu typically arising in vibration analysis. The eigenvalue problem is represented in terms of its variational dual, the Rayleigh quotient, and the eigenosolution is obtained

An algorithm for an eigenvalues problem
✍ Ana B. González; Juan Getino; JoséM. Farto 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 580 KB

In this paper we present a new algorithm to parameterize some kind of hypersurfaces. Our technique extends the Newton-Puiseux algorithm for plane curves to several variables. It is based on the introduction of an order in the monomials of several variables compatible with the total degree and in a r