File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.tcs.2004.01.005
- Scopus: eid_2-s2.0-2042541397
- WOS: WOS:000221353000010
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Fast inversion of triangular Toeplitz matrices
Title | Fast inversion of triangular Toeplitz matrices |
---|---|
Authors | |
Keywords | Fast cosine transform Fast Fourier transform Interpolation Triangular Toeplitz matrix |
Issue Date | 2004 |
Publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/tcs |
Citation | Theoretical Computer Science, 2004, v. 315 n. 2-3, p. 511-523 How to Cite? |
Abstract | In this paper, we present an approximate inversion method for triangular Toeplitz matrices based on trigonometric polynomial interpolation. To obtain an approximate inverse of high accuracy for a triangular Toeplitz matrix of size n, our algorithm requires two fast Fourier transforms (FFTs) and one fast cosine transform of 2n-vectors. We then revise the approximate method proposed by Bini (SIAM J. Comput. 13 (1984) 268). The complexity of the revised Bini algorithm is two FFTs of 2n-vectors. © 2004 Published by Elsevier B.V. |
Persistent Identifier | http://hdl.handle.net/10722/75203 |
ISSN | 2023 Impact Factor: 0.9 2023 SCImago Journal Rankings: 0.570 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lin, FR | en_HK |
dc.contributor.author | Ching, WK | en_HK |
dc.contributor.author | Ng, MK | en_HK |
dc.date.accessioned | 2010-09-06T07:08:55Z | - |
dc.date.available | 2010-09-06T07:08:55Z | - |
dc.date.issued | 2004 | en_HK |
dc.identifier.citation | Theoretical Computer Science, 2004, v. 315 n. 2-3, p. 511-523 | en_HK |
dc.identifier.issn | 0304-3975 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/75203 | - |
dc.description.abstract | In this paper, we present an approximate inversion method for triangular Toeplitz matrices based on trigonometric polynomial interpolation. To obtain an approximate inverse of high accuracy for a triangular Toeplitz matrix of size n, our algorithm requires two fast Fourier transforms (FFTs) and one fast cosine transform of 2n-vectors. We then revise the approximate method proposed by Bini (SIAM J. Comput. 13 (1984) 268). The complexity of the revised Bini algorithm is two FFTs of 2n-vectors. © 2004 Published by Elsevier B.V. | en_HK |
dc.language | eng | en_HK |
dc.publisher | Elsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/tcs | en_HK |
dc.relation.ispartof | Theoretical Computer Science | en_HK |
dc.rights | Theoretical Computer Science. Copyright © Elsevier BV. | en_HK |
dc.subject | Fast cosine transform | en_HK |
dc.subject | Fast Fourier transform | en_HK |
dc.subject | Interpolation | en_HK |
dc.subject | Triangular Toeplitz matrix | en_HK |
dc.title | Fast inversion of triangular Toeplitz matrices | en_HK |
dc.type | Article | en_HK |
dc.identifier.email | Ching, WK:wching@hku.hk | en_HK |
dc.identifier.authority | Ching, WK=rp00679 | en_HK |
dc.description.nature | link_to_OA_fulltext | - |
dc.identifier.doi | 10.1016/j.tcs.2004.01.005 | en_HK |
dc.identifier.scopus | eid_2-s2.0-2042541397 | en_HK |
dc.identifier.hkuros | 97964 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-2042541397&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.volume | 315 | en_HK |
dc.identifier.issue | 2-3 | en_HK |
dc.identifier.spage | 511 | en_HK |
dc.identifier.epage | 523 | en_HK |
dc.identifier.isi | WOS:000221353000010 | - |
dc.publisher.place | Netherlands | en_HK |
dc.identifier.scopusauthorid | Lin, FR=7402777425 | en_HK |
dc.identifier.scopusauthorid | Ching, WK=13310265500 | en_HK |
dc.identifier.scopusauthorid | Ng, MK=34571761900 | en_HK |
dc.identifier.issnl | 0304-3975 | - |