๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


A functional neural network computing so
โœ Yiguang Liu; Zhisheng You; Liping Cao ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 256 KB

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

Computation of eigenvalues and eigenvect
โœ David J. Evans ๐Ÿ“‚ Article ๐Ÿ“… 1977 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 556 KB

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

An efficient method for computing eigenv
โœ B.B Zhou; R.P Brent ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 221 KB

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