Singular value decomposition transform with an FFT-based algorithm on the connection machine CM5

We describe in this paper the parallel implementation of a modified, high radix fast Fourier transform (FFT) together with a Jacobi-based algorithm for matrix factorization to compute the singular value decomposition (SVD) of a 16384/spl times/16384 projection normal matrix arising from probability...

Full description

Saved in:
Bibliographic Details
Main Authors: Tuan Cao-Huu, Evequoz, C.
Format: Conference Proceeding
Language:English
Subjects:
Concurrent computing
Fast Fourier transforms
Image coding
Image processing
Jacobian matrices
Matrix decomposition
Parallel processing
Partitioning algorithms
Positron emission tomography
Singular value decomposition
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We describe in this paper the parallel implementation of a modified, high radix fast Fourier transform (FFT) together with a Jacobi-based algorithm for matrix factorization to compute the singular value decomposition (SVD) of a 16384/spl times/16384 projection normal matrix arising from probability measure estimation in positron emission tomography (PET). We simplify the analysis significantly by working with block matrices and the Kronecker products because the symmetries built into the orthogonal decompositions allow the computation of the various factorizations of interest.
ISSN:0840-7789
2576-7046
DOI:10.1109/CCECE.1995.526609