کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4603109 1631173 2008 15 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Fast QR factorization of Cauchy-like matrices
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات اعداد جبر و تئوری
پیش نمایش صفحه اول مقاله
Fast QR factorization of Cauchy-like matrices
چکیده انگلیسی

In this paper, we present two fast numerical methods for computing the QR factorization of an n×n Cauchy-like matrix C, C=QR, with data points lying on the real axis or on the unit circle in the complex plane. It is shown that the rows of the Q-factor of C are the eigenvectors of a rank structured matrix partially determined by some prescribed spectral data. This property establishes a basic connection between the computation of Q and the solution of an inverse eigenvalue problem for a rank structured matrix. Exploiting the structure of this problem enables us to develop quadratic time, i.e., O(n2), QR factorization algorithms.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Linear Algebra and its Applications - Volume 428, Issues 2–3, 15 January 2008, Pages 697-711