# FAST ALGORITHMS TO COMPUTE MATRIX-VECTOR PRODUCTS FOR PASCAL MATRICES

 dc.contributor.author Tang, Zhihui en_US dc.contributor.author Duraiswami, Ramani en_US dc.contributor.author Gumerov, Nail A. en_US dc.date.accessioned 2004-05-31T23:35:45Z dc.date.available 2004-05-31T23:35:45Z dc.date.created 2004-02 en_US dc.date.issued 2004-03-25 en_US dc.identifier.uri http://hdl.handle.net/1903/1338 dc.description.abstract The Pascal matrix arises in a number of applications. We present a few ways en_US 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-08 dc.format.extent 264730 bytes dc.format.mimetype application/pdf dc.language.iso en_US dc.relation.ispartofseries UM Computer Science Department; CS-TR-4563 en_US dc.relation.ispartofseries UMIACS; UMIACS-TR-2004-08 en_US dc.title FAST ALGORITHMS TO COMPUTE MATRIX-VECTOR PRODUCTS FOR PASCAL MATRICES en_US dc.type Technical Report en_US dc.relation.isAvailableAt Digital Repository at the University of Maryland en_US dc.relation.isAvailableAt University of Maryland (College Park, Md.) en_US dc.relation.isAvailableAt Tech Reports in Computer Science and Engineering en_US dc.relation.isAvailableAt UMIACS Technical Reports en_US
﻿