Gemignani, Luca (1996) Fast QR Factorization of Vandermonde-like matrices involving orthogonal polynomials. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.
Postscript (GZip) - Published Version Available under License Creative Commons Attribution No Derivatives. Download (194Kb) |
Official URL: http://compass2.di.unipi.it/TR/files/TR-96-11.ps.g...
Abstract
Fast orthogonalization schemes for m\times n Vandermonde matrices V=(z_i^j), introduced by Demeure, are extended to compute both a $QR$ factorization and an inverse QR factorization of Vandermonde-like matrices P=(p_j(z_i)) where the polynomials p_j(z) satisfy a three-term recurrence relation. In this way we are able to solve least squares (LS) problems of the form \begin{eqnarray*} {\rm minimize } \ ||{\bf b}-P{\bf x}||_2 \end{eqnarray*} using only O(mn) arithmetical operations and O(m) storage. \end{abstract} \bigskip
Item Type: | Book |
---|---|
Uncontrolled Keywords: | Least squares problems, QR factorization, Vandermonde-like matrices |
Subjects: | Area01 - Scienze matematiche e informatiche > INF/01 - Informatica |
Divisions: | Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA |
Depositing User: | dott.ssa Sandra Faita |
Date Deposited: | 23 Jan 2015 11:09 |
Last Modified: | 23 Jan 2015 11:09 |
URI: | http://eprints.adm.unipi.it/id/eprint/1962 |
Repository staff only actions
View Item |