Show simple item record

FAST ALGORITHMS TO COMPUTE MATRIX-VECTOR PRODUCTS FOR PASCAL MATRICES

dc.contributor.authorTang, Zhihuien_US
dc.contributor.authorDuraiswami, Ramanien_US
dc.contributor.authorGumerov, Nail A.en_US
dc.date.accessioned2004-05-31T23:35:45Z
dc.date.available2004-05-31T23:35:45Z
dc.date.created2004-02en_US
dc.date.issued2004-03-25en_US
dc.identifier.urihttp://hdl.handle.net/1903/1338
dc.description.abstractThe Pascal matrix arises in a number of applications. We present a few ways to decompose the Pascal matrices of size $n \times n$ into products of matrices with structure. Based on these decompositions, we propose fast algorithms to compute the product of a Pascal matrix and a vector with omplexity $O(n\log n)$. We also present a strategy to stabilize the proposed algorithms. Finally, we also present some interesting properties of the Pascal matrices that help us to compute fast the product of the inverse of a Pascal matrix and a vector, and fast algorithms for generalized Pascal Matrices. UMIACS-TR-2004-08en_US
dc.format.extent264730 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4563en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-2004-08en_US
dc.titleFAST ALGORITHMS TO COMPUTE MATRIX-VECTOR PRODUCTS FOR PASCAL MATRICESen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record