Location of Repository

} nq n1 n2 nq A well known strategy for high-performance Ax = b and Ax = λx solvers. Factoring for Performance One way to execute a matrix-vector product y = Fnx when Fn = At · · ·A2A1 is as follows: y = x for k = 1:t y = A kx end A different factorization Fn = algorithm. Ã˜t · · ·Ã1 would yield a differentThe Discrete Fourier Transform (n = 8) y = F8x = ω 0 8 ω0 8 ω0

Year: 2011

OAI identifier:
oai:CiteSeerX.psu:10.1.1.187.8501

Provided by:
CiteSeerX

Download PDF: