Loading...
Please wait, while we are loading the content...
A Traub-like algorithm for Hessenberg-quasiseparable-Vandermonde matrices of arbitrary order
| Content Provider | Semantic Scholar |
|---|---|
| Author | Bella, Tom Olshevsky, Vadim Zhlobich, Pavel Eidelman, Yuli Gohberg, Israel Tyrtyshnikov, Eugene E. |
| Copyright Year | 2010 |
| Abstract | Although Gaussian elimination uses O(n 3) operations to invert an arbitrary matrix, matrices with a special Vandermonde structure can be inverted in only O(n 2) operations by the fast Traub algorithm. The original version of Traub algorithm was numerically unstable although only a minor modification of it yields a high accuracy in practice. The Traub algorithm has been extended from Vandermonde matrices involving monomials to polynomial-Vandermonde matrices involving real orthogonal polynomials, and the Szego polynomials. |
| Starting Page | 127 |
| Ending Page | 154 |
| Page Count | 28 |
| File Format | PDF HTM / HTML |
| DOI | 10.1007/978-3-7643-8996-3_5 |
| Alternate Webpage(s) | http://www.math.uconn.edu/~olshevsky/papers//BEGOTZ.pdf |
| Alternate Webpage(s) | http://www.math.uconn.edu/~olshevsky/papers/BEGOTZ.pdf |
| Alternate Webpage(s) | https://doi.org/10.1007/978-3-7643-8996-3_5 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
