✦ LIBER ✦

On the arithmetic complexity of matrix Kronecker powers

✍ Scribed by Gadiel Seroussi; Fai Ma

Publisher: Elsevier Science
Year: 1983
Weight: 118 KB
Volume: 1
Category: Article
ISSN: 0167-7136
DOI: 10.1016/0167-7136(83)90291-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On some properties of KRONECKER Matrix P

On some properties of KRONECKER Matrix Products

✍ Oktaba, W. 📂 Article 📅 1975 🏛 Wiley (John Wiley & Sons) ⚖ 455 KB 👁 2 views

The bit-complexity of arithmetic algorit

The bit-complexity of arithmetic algorithms

✍ V Pan 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 953 KB

A characterization of the generalized sp

A characterization of the generalized spectral radius with Kronecker powers

✍ Jianhong Xu; Mingqing Xiao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 210 KB

The Complexity of Frobenius Powers of Id

The Complexity of Frobenius Powers of Ideals

✍ Mordechai Katzman 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 205 KB

A 222pn upper bound on the complexity of

A 222pn upper bound on the complexity of Presburger Arithmetic

✍ Derek C. Oppen 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 605 KB

The bit-operation complexity of approxim

The bit-operation complexity of approximate evaluation of matrix and polynomial products using modular arithmetic

✍ V. Pan 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 330 KB

The approximate evaluation with a given precision of matrix and polynomial products is performed using modular arithmetic. The resulting algorithms are numerically stable. At the same time they are as fast as or faster than the algorithms with arithmetic operations over real or complex numbers.