𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient Jacobi-like algorithm for parallel eigenvalue computation

✍ Scribed by Gotze, J.; Paul, S.; Sauer, M.

Book ID
118067630
Publisher
IEEE
Year
1993
Tongue
English
Weight
701 KB
Volume
42
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Parallel Ring Ordering Algorithm for E
A Parallel Ring Ordering Algorithm for Efficient One-Sided Jacobi SVD Computations
✍ B.B. Zhou; R.P. Brent πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 141 KB

In this paper we give evidence to show that in one-sided Jacobi SVD computation the sorting of column norms in each sweep is very important. An efficient parallel ring Jacobi ordering for computing singular value decomposition is described. This ordering can generate n(n -1)/2 different index pairs

Efficient Algorithms for Computing the J
Efficient Algorithms for Computing the Jacobi Symbol
✍ S.M. Eikenberry; J.P. Sorenson πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 464 KB

We present two new algorithms for computing the Jacobi Symbol: the right-shift and left-shift k-ary algorithms. For inputs of at most n bits in length, both algorithms take O(n 2 / log n) time and O(n) space. This is asymptotically faster than the traditional algorithm, which is based in Euclid's al

An efficient parallel algorithm for mult
An efficient parallel algorithm for multiselection
✍ S. Olariu; Z. Wen πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 211 KB

Olariu, S. and Z. Wen, An efficient parallel algorithm for multiselection, Parallel Computing 17 (1991) 689-693. The problem of multiselection arises frequently in databases. Here, given an unordered set S of n records and a sequence of m integers 1 ~< ql < q2 < .--< qm ~< n we are interested in an