Fast enclosure for a matrix inverse square root
A fast algorithm for computing an interval matrix containing the inverse square root of an n×n matrix A is proposed. This algorithm utilizes numerical spectral decomposition of A and requires only O(n3) operations. The principal property and uniqueness of the contained inverse square root can moreov...
Saved in:
| Published in: | Linear algebra and its applications Vol. 467; pp. 116 - 135 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Inc
15.02.2015
|
| Subjects: | |
| ISSN: | 0024-3795, 1873-1856 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!