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

A Low-Complexity Divide-and-Conquer Method for Computing Eigenvalues and Eigenvectors of Symmetric Band Matrices

โœ Scribed by W. N. Gansterer; J. Schneid; C. W. Ueberhuber

Book ID
110412722
Publisher
Springer Netherlands
Year
2001
Tongue
English
Weight
152 KB
Volume
41
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Another neural network based approach fo
Another neural network based approach for computing eigenvalues and eigenvectors of real skew-symmetric matrices
โœ Ying Tang; Jianping Li ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 390 KB

This paper introduces a novel neural network based approach for extracting the eigenvalues with the largest or smallest modulus of real skew-symmetric matrices, as well as the corresponding eigenvectors. To this end, unlike the previous neural network based methods that can be summarized by some 2n-

A concurrent algorithm for parallel calc
A concurrent algorithm for parallel calculation of eigenvalues and eigenvectors of real symmetric matrices
โœ Ramon Carbo; Lluรญs Molino; Blanca Calabuig ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 412 KB

Elementary Jacobi Rotations are used as the basic tools to obtain eigenvalues and eigenvectors of arbitrary real symmetric matrices. The proposed algorithm has a complete concurrent structure, that is: every eigenvalueeigenvector pair can be obtained in any order and in an independent way from the r