{"title":"用块Schur算法求解块Toeplitz系统","authors":"K. Gallivan, S. Thirumalai, P. Dooren","doi":"10.1109/ICPP.1994.136","DOIUrl":null,"url":null,"abstract":"This paper presents a block Schur algorithm to obtain a factorization of a symmetric block Toeplitz matrix. We develop a version based on block hyperbolic Householder reflectors by adapting the representation schemes for block Householder reflectors to the hyperbolic case. If a singular principal submatrix is encountered during the factorization, the matrix is perturbed and an approximate factorization is obtained. This is then combined with iterative refinement to obtain the final solution.","PeriodicalId":162043,"journal":{"name":"1994 International Conference on Parallel Processing Vol. 3","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"On Solving Block Toeplitz Systems Using a Block Schur Algorithm\",\"authors\":\"K. Gallivan, S. Thirumalai, P. Dooren\",\"doi\":\"10.1109/ICPP.1994.136\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a block Schur algorithm to obtain a factorization of a symmetric block Toeplitz matrix. We develop a version based on block hyperbolic Householder reflectors by adapting the representation schemes for block Householder reflectors to the hyperbolic case. If a singular principal submatrix is encountered during the factorization, the matrix is perturbed and an approximate factorization is obtained. This is then combined with iterative refinement to obtain the final solution.\",\"PeriodicalId\":162043,\"journal\":{\"name\":\"1994 International Conference on Parallel Processing Vol. 3\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1994 International Conference on Parallel Processing Vol. 3\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPP.1994.136\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1994 International Conference on Parallel Processing Vol. 3","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPP.1994.136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On Solving Block Toeplitz Systems Using a Block Schur Algorithm
This paper presents a block Schur algorithm to obtain a factorization of a symmetric block Toeplitz matrix. We develop a version based on block hyperbolic Householder reflectors by adapting the representation schemes for block Householder reflectors to the hyperbolic case. If a singular principal submatrix is encountered during the factorization, the matrix is perturbed and an approximate factorization is obtained. This is then combined with iterative refinement to obtain the final solution.