Jacobi-based algorithms have attracted attention as they have a high degree of potential parallelism and may be more accurate than QR-based algorithms. In this paper we discuss how to design efficient Jacobi-like algorithms for eigenvalue decomposition of a real normal matrix. We introduce a block J
β¦ LIBER β¦
The ELR Method for Computing the Eigenvalues of a General Matrix
β Scribed by Dax, A.; Kaniel, S.
- Book ID
- 118185131
- Publisher
- Society for Industrial and Applied Mathematics
- Year
- 1981
- Tongue
- English
- Weight
- 954 KB
- Volume
- 18
- Category
- Article
- ISSN
- 0036-1429
- DOI
- 10.1137/0718038
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
An efficient method for computing eigenv
β
B.B Zhou; R.P Brent
π
Article
π
2003
π
Elsevier Science
π
English
β 221 KB
Computing the eigenvectors of a matrix w
β
Chi Bin; Ye Qing-kai
π
Article
π
2004
π
Springer
π
English
β 331 KB
A computational method for eigenvalues a
β
A. N. Beavers; E. D. Denman
π
Article
π
1973
π
Springer-Verlag
π
English
β 317 KB
A Method for Computing the Generalized I
β
Noble, Ben
π
Article
π
1966
π
Society for Industrial and Applied Mathematics
π
English
β 192 KB
A method for computing the eigenvalues o
β
A. L. Roark; G. M. Wing
π
Article
π
1965
π
Springer-Verlag
π
English
β 557 KB
A Chebyshev collocation method for compu
β
Ya Yan Lu
π
Article
π
1995
π
John Wiley and Sons
π
English
β 598 KB
## Abstract Chebyshev collocation techniques are developed in this paper to compute the eigenvalues of the Laplacian based on a boundary integral formulation for twoβdimensional domains with piecewise smooth boundaries. Unlike the traditional domain methods (for example, the finite element method)