A computational method for eigenvalues and eigenvectors of a matrix with real eigenvalues
โ Scribed by A. N. Beavers; E. D. Denman
- Publisher
- Springer-Verlag
- Year
- 1973
- Tongue
- English
- Weight
- 317 KB
- Volume
- 21
- Category
- Article
- ISSN
- 0029-599X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
How to quickly compute eigenvalues and eigenvectors of a matrix, especially, a general real matrix, is significant in engineering. Since neural network runs in asynchronous and concurrent manner, and can achieve high rapidity, this paper designs a concise functional neural network (FNN) to extract s
A recursive algorithm for the implicit derivation of the determinant of a symmetric quindiagonal matrix is developed in terms of its leading principal minors. The algorithm is shown to yield a Sturmian sequence of polynomials from which the eigenvalues can be obtained by use of the bisection process
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