{"title":"Monitoring the stage of diagonalization in Jacobi-type methods","authors":"J. Gotze","doi":"10.1109/ICASSP.1994.389995","DOIUrl":null,"url":null,"abstract":"Since the stage of diagonalization of Jacobi-type methods is difficult to monitor in a parallel environment, it is usually proposed to execute a predetermined number of sweeps (iterations) on a parallel processor array. A possibility for monitoring the stage of diagonalization is essential in order to avoid the execution of a significant number of unnecessary sweeps. Based on a Lemma used for a generalized proof of the quadratic convergence of the Jacobi EVD and SVD methods a new criteria for monitoring the stage of diagonalization is derived. Using this criteria it can easily be monitored when the stage of quadratic convergence is reached (only one bit yields this information). Therefore, only the (small) number of quadratically convergent sweeps must be predetermined. A further similar criteria particularly useful for Jacobi-type methods using CORDIC-based approximate rotations is also given.<<ETX>>","PeriodicalId":290798,"journal":{"name":"Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing","volume":"183 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of ICASSP '94. IEEE International Conference on Acoustics, Speech and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICASSP.1994.389995","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
Since the stage of diagonalization of Jacobi-type methods is difficult to monitor in a parallel environment, it is usually proposed to execute a predetermined number of sweeps (iterations) on a parallel processor array. A possibility for monitoring the stage of diagonalization is essential in order to avoid the execution of a significant number of unnecessary sweeps. Based on a Lemma used for a generalized proof of the quadratic convergence of the Jacobi EVD and SVD methods a new criteria for monitoring the stage of diagonalization is derived. Using this criteria it can easily be monitored when the stage of quadratic convergence is reached (only one bit yields this information). Therefore, only the (small) number of quadratically convergent sweeps must be predetermined. A further similar criteria particularly useful for Jacobi-type methods using CORDIC-based approximate rotations is also given.<>