Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
435636 | Theoretical Computer Science | 2008 | 14 Pages |
Abstract
We apply our recent preconditioning techniques to the solution of linear systems of equations and computing determinants. We combine these techniques with the Sherman–Morrison–Woodbury formula, its new variations, aggregation, iterative refinement, and advanced algorithms that rapidly compute sums and products either error-free or with the desired high accuracy. Our theoretical and experimental study shows the power of this approach.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics