✦ LIBER ✦

Computing Rational Forms of Integer Matrices

✍ Scribed by Mark Giesbrecht; Arne Storjohann

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 326 KB
Volume: 34
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.2002.0554

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Computation of Elementary Divisor

On the Computation of Elementary Divisors of Integer Matrices

✍ Frank Lübeck 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 229 KB

We describe a "semi-modular" algorithm which computes for a given integer matrix A of known rank and a given prime p the multiplicities of p in the factorizations of the elementary divisors of A. Here "semi-modular" means that we apply operations to the integer matrix A but the operations are driven

Computation of J-inner–outer factorizati

Computation of J-inner–outer factorizations of rational matrices

✍ Andras Varga; Tohru Katayama 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB

A new numerically reliable computational approach is proposed to compute the factorization of a rational transfer function matrix G as a product of a J-lossless factor with a stable, minimum-phase factor. In contrast to existing computationally involved 'one-shot' methods which require the solution

Extendibility of Rational Matrices

✍ Ding-Xuan Zhou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 229 KB

A Characterization of extendibility of rational matrices is presented in terms of elementary properties. As a tool we give a solvability condition for a system of linear diophantine equations, which is of independent interest. Academic ## Press The property of extendibility of rational matrices

On computations involving stiffness matr

On computations involving stiffness matrices stored in rectangular form

✍ Y. C. Pao 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB

Nonlinear integer programming for variou

Nonlinear integer programming for various forms of constraints

✍ Mary W. Cooper; Keyvan Farhangian 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 425 KB

Computing the Rational Torsion of an Ell

Computing the Rational Torsion of an Elliptic Curve Using Tate Normal Form

✍ Irene Garcı́a-Selfa; Miguel A. Olalla; José M. Tornero 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 137 KB

It is a classical result (apparently due to Tate) that all elliptic curves with a torsion point of order n ð44n410; or n ¼ 12Þ lie in a one-parameter family. However, this fact does not appear to have been used ever for computing the torsion of an elliptic curve. We present here an extremely down-to