|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
25th Annual Symposium on Foundations of Computer Science (FOCS 1984)
Singer Island, FL
October 24-October 26
ISBN: 0-8186-0591-X
| ASCII Text | x | ||
| W. Eberly, "Very Fast Parallel Matrix and Polynomial Arithmetic," Foundations of Computer Science, IEEE Annual Symposium on, pp. 21-30, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984. | |||
| BibTex | x | ||
| @article{ 10.1109/SFCS.1984.715897, author = {W. Eberly}, title = {Very Fast Parallel Matrix and Polynomial Arithmetic}, journal ={Foundations of Computer Science, IEEE Annual Symposium on}, volume = {0}, year = {1984}, isbn = {0-8186-0591-X}, pages = {21-30}, doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.1984.715897}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Foundations of Computer Science, IEEE Annual Symposium on TI - Very Fast Parallel Matrix and Polynomial Arithmetic SN - 0-8186-0591-X SP21 EP30 A1 - W. Eberly, PY - 1984 VL - 0 JA - Foundations of Computer Science, IEEE Annual Symposium on ER - | |||
We present very efficient arithmetic circuits for the computation of the determinants and inverse of band matrices and for interpolation and polynomial arithmetic over arbitrary ground fields. For input size n the circuits for band matrix inversion (for constant band width) over infinite fields, and the circuits for polynomial arithmetic over arbitrary fields, have optimal depth 0(log n) and polynomial size. The algorithm for band matrix inversion is based on an extension of the method of modification (from numerical analysis) which includes a formula for the determinant of a modified matrix.
Citation:
W. Eberly, "Very Fast Parallel Matrix and Polynomial Arithmetic," focs, pp.21-30, 25th Annual Symposium on Foundations of Computer Science (FOCS 1984), 1984
Usage of this product signifies your acceptance of the Terms of Use.
