𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Efficient algorithms for order basis computation

✍ Scribed by Wei Zhou; George Labahn

Book ID
113756552
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
354 KB
Volume
47
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Two new algorithms for efficient computa
Two new algorithms for efficient computation of Legendre moments
✍ J.D. Zhou; H.Z. Shu; L.M. Luo; W.X. Yu πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 147 KB

Orthogonal moments have been successfully used in the ΓΏeld of pattern recognition and image analysis. However, the direct computation of orthogonal moments is very expensive. In this paper, we present two new algorithms for fast computing the two-dimensional (2D) Legendre moments. The ΓΏrst algorithm

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