| | |
| | |
Stat |
Members: 3643 Articles: 2'487'895 Articles rated: 2609
29 March 2024 |
|
| | | |
|
Article overview
| |
|
Fast linear algebra is stable | James Demmel
; Ioana Dumitriu
; Olga Holtz
; | Date: |
10 Dec 2006 | Subject: | Numerical Analysis; Computational Complexity; Data Structures and
Algorithms | Abstract: | In an earlier paper, we showed that a large class of fast recursive matrix multiplication algorithms is stable in a normwise sense, and that in fact if multiplication of $n$-by-$n$ matrices can be done by any algorithm in $O(n^omega)$ operations, then it can be done stably in $O(n^{omega + eta})$ operations for any $eta > 0$. Here we extend this result to show that many standard linear algebra operations, including LU decomposition, QR decomposition, linear equation solving, matrix inversion, and determinant computation can also be done stably (in a normwise sense) in time $O(n^{omega + eta})$. | Source: | arXiv, math/0612264 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |