Access Restriction

Author Delvaux, Steven ♦ Gemignani, Luca ♦ Barel, Marc Van
Source CiteSeerX
Content type Text
File Format PDF
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Displacement Rank ♦ Cauchy Matrix ♦ Semiseparability Rank ♦ Numerical Experiment ♦ Hankel-like Case ♦ Hankel-like Matrix ♦ General Case ♦ Certain Displacement ♦ Chasing Scheme ♦ General Scheme ♦ Recursive Construction ♦ Semiseparable Matrix ♦ Matrix Size
Abstract A general scheme is proposed for computing the QR-factorization of certain displacement structured matrices, including Cauchy-like, Vander-monde-like, Toeplitz-like and Hankel-like matrices, hereby extending some earlier work for the QR-factorization of the Cauchy matrix. The algorithm employs a chasing scheme for the recursive construction of a diagonal plus semiseparable matrix of semiseparability rank r, where r is equal to the given displacement rank. The complexity is O(r2n2) operations in the general case, and O(rn2) operations in the Toeplitz- and Hankel-like case, where n denotes the matrix size. Numerical experiments are provided.
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Publisher Date 2007-01-01