2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1984)
Singer Island, FL
Oct. 24, 1984 to Oct. 26, 1984
W. Eberly , University of Toronto
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.
W. Eberly, "Very Fast Parallel Matrix and Polynomial Arithmetic", 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, vol. 00, no. , pp. 21-30, 1984, doi:10.1109/SFCS.1984.715897