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 methodo
β¦ LIBER β¦
The application of Schur's algorithm to an inverse eigenvalue problem
β Scribed by Gladwell, G M L
- Book ID
- 120379210
- Publisher
- Institute of Physics
- Year
- 1991
- Tongue
- English
- Weight
- 278 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0266-5611
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An inexact KrylovβSchur algorithm for th
β
Roden J.A. David; David S. Watkins
π
Article
π
2008
π
Elsevier Science
π
English
β 173 KB
An algorithm for constructing doubly sto
β
Mourad, Bassam; Abbas, Hassan; Mourad, Ayman; Ghaddar, Ahmad; Kaddoura, Issam
π
Article
π
2013
π
Elsevier Science
π
English
β 415 KB
An Algorithm of Katz and its Application
β
Michael Dettweiler; Stefan Reiter
π
Article
π
2000
π
Elsevier Science
π
English
β 540 KB
In this paper we present a new and elementary approach for proving the main results of Katz (1996) using the Jordan-Pochhammer matrices of Takano andBannai (1976) andHaraoka (1994). We find an explicit version of the middle convolution of Katz (1996) that connects certain tuples of matrices in linea
Application of the alternating direction
β
Zhao, Kang; Yao, Guozhu
π
Article
π
2014
π
Elsevier Science
π
English
β 559 KB
AN APPLICATION OF THE SCHUR-COHN ALGORIT
β
Roger W. Barnard; Kamal C. Chanda
π
Article
π
1995
π
John Wiley and Sons
π
English
β 201 KB
An application of Marquardt's procedure
β
Keys, R.G.
π
Article
π
1986
π
IEEE
π
English
β 887 KB