FAST PARALLEL BAND MATRIX ARITHMETIC
| dc.contributor.author | Eberly, Wayne | eng |
| dc.date.accessioned | 2008-02-26T20:31:31Z | |
| dc.date.available | 2008-02-26T20:31:31Z | |
| dc.date.computerscience | 1999-05-27 | eng |
| dc.date.issued | 1990-08-01 | eng |
| dc.description.abstract | We present parallel algorithms for computation of the determinant, adjoint, characteristic polynomial and rank of band matrices, and for the solution of systems of linear equations with band matrices as coefficient matrices. The algorithms can be implemented using arithmetic-boolean circuits of polynomial size and depth O(log n logm), or depth O(log n log m + log n log log n) for computations over small finite fields, where n is the order and m the band width of the matrix given as input. They can be implemented for computations over number fields and finite fields using log space uniform boolean circuits of depth O(log n log m + log n log log n) and polynomial size, for input size n and band width m. | eng |
| dc.description.notes | We are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.ca | eng |
| dc.identifier.department | 1990-402-26 | eng |
| dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/30590 | |
| dc.identifier.uri | http://hdl.handle.net/1880/45472 | |
| dc.language.iso | Eng | eng |
| dc.publisher.corporate | University of Calgary | eng |
| dc.publisher.faculty | Science | eng |
| dc.subject | Computer Science | eng |
| dc.title | FAST PARALLEL BAND MATRIX ARITHMETIC | eng |
| dc.type | unknown | |
| thesis.degree.discipline | Computer Science | eng |