𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast algorithm for index of annihilation computations

✍ Scribed by P.Y. Yalamov; M. Mitrouli

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
110 KB
Volume
108
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper a fast algorithm for computing the index of annihilation of the associated pencil of a given matrix is presented. Knowledge of this index leads us to the speciΓΏcation of the elementary divisors of the matrix and thus we can specify its canonical forms. It is shown that the new algorithm (which is based on the RRQR decomposition) is faster than the existing SVD approach. The algorithm can be also applied to matrix pencils and thus specify the structure of their elementary divisors.

πŸ“œ SIMILAR VOLUMES

A novel algorithm for fast computation o
A novel algorithm for fast computation of Zernike moments
✍ J. Gu; H.Z. Shu; C. Toumoulin; L.M. Luo πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 369 KB

Zernike moments (ZMs) have been successfully used in pattern recognition and image analysis due to their good properties of orthogonality and rotation invariance. However, their computation by a direct method is too expensive, which limits the application of ZMs. In this paper, we present a novel al