✦ LIBER ✦

A note on computing of positive integer powers for circulant matrices

✍ Scribed by Feng, Jishe

Book ID: 121300686
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 238 KB
Volume: 223
Category: Article
ISSN: 0096-3003
DOI: 10.1016/j.amc.2013.08.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Positive integer powers for one type of

Positive integer powers for one type of odd order circulant matrices

✍ Fikri Köken; Durmuş Bozkurt 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 171 KB

Positive integer powers and inverse for

Positive integer powers and inverse for one type of even order symmetric pentadiagonal matrices

✍ Arslan, Saadet; Köken, Fikri; Bozkurt, Durmuş 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 195 KB

A fast algorithm for computing the deter

A fast algorithm for computing the determinants of banded circulant matrices

✍ Chen, Xie-Bin 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 307 KB

On computing of arbitrary positive power

On computing of arbitrary positive powers for one type of anti-tridiagonal matrices of even order

✍ Honglin Wu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 162 KB

On fractional Hadamard powers of positiv

On fractional Hadamard powers of positive definite matrices

✍ Carl H FitzGerald; Roger A Horn 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 520 KB

A p-adic algorithm for computing the inv

A p-adic algorithm for computing the inverse of integer matrices

✍ H. Haramoto; M. Matsumoto 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 270 KB

A method for computing the inverse of an (n × n) integer matrix A using p-adic approximation is given. The method is similar to Dixon's algorithm, but ours has a quadratic convergence rate. The complexity of this algorithm (without using FFT or fast matrix multiplication) is O(n 4 (log n) 2 ), the s