✦ LIBER ✦

On lattice reduction for polynomial matrices

✍ Scribed by T. Mulders; A. Storjohann

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 423 KB
Volume: 35
Category: Article
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(02)00139-6

No coin nor oath required. For personal study only.

✦ Synopsis

A simple algorithm for lattice reduction of polynomial matrices is described and analysed. The algorithm is adapted and applied to various tasks, including rank profile and determinant computation, transformation to Hermite and Popov canonical form, polynomial linear system solving and short vector computation.

📜 SIMILAR VOLUMES

Column reduction of polynomial matrices

✍ W.H.L. Neven; C. Praagman 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 1000 KB

On syzygy modules for polynomial matrice

On syzygy modules for polynomial matrices

✍ Zhiping Lin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 103 KB

On polynomial EkP matrices

✍ AR. Meenakshi; N. Anandam 📂 Article 📅 1994 🏛 Springer Netherlands 🌐 English ⚖ 318 KB

On ∗-polynomial identities for n × n mat

On ∗-polynomial identities for n × n matrices

✍ Antonio Giambruno 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Permutation polynomials on matrices

✍ N.S. James; R. Lidl 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 539 KB

On a polynomial identity for n × n matri

On a polynomial identity for n × n matrices

✍ A Giambruno; S.K Sehgal 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 120 KB