{"title":"在连接机CM5上用基于fft的奇异值分解变换算法","authors":"T. Cao-Huu, C. Évéquoz","doi":"10.1109/CCECE.1995.526609","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":158581,"journal":{"name":"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1995-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Singular value decomposition transform with an FFT-based algorithm on the connection machine CM5\",\"authors\":\"T. Cao-Huu, C. Évéquoz\",\"doi\":\"10.1109/CCECE.1995.526609\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":158581,\"journal\":{\"name\":\"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCECE.1995.526609\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 1995 Canadian Conference on Electrical and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCECE.1995.526609","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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 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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
