{"title":"椭圆型混合离散类似物边值问题的广义cholesky算法编程","authors":"A.A. Kobozeva, L.V. Maslovskaya","doi":"10.1016/0041-5553(90)90076-5","DOIUrl":null,"url":null,"abstract":"<div><p>An approach to the programming of a new algorithm involving a certain numbering of the unknowns is proposed, the use of which does not require permutation of rows and columns of the system to ensure stability of the solution algorithm. A method is proposed for solving the corresponding system of linear algebraic equations, whose matrix is not positive-definite but is of a special form.</p></div>","PeriodicalId":101271,"journal":{"name":"USSR Computational Mathematics and Mathematical Physics","volume":"30 2","pages":"Pages 56-62"},"PeriodicalIF":0.0000,"publicationDate":"1990-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0041-5553(90)90076-5","citationCount":"0","resultStr":"{\"title\":\"Programming a generalized cholesky algorithm for mixed discrete analogues of elliptic boundary-value problems\",\"authors\":\"A.A. Kobozeva, L.V. Maslovskaya\",\"doi\":\"10.1016/0041-5553(90)90076-5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>An approach to the programming of a new algorithm involving a certain numbering of the unknowns is proposed, the use of which does not require permutation of rows and columns of the system to ensure stability of the solution algorithm. A method is proposed for solving the corresponding system of linear algebraic equations, whose matrix is not positive-definite but is of a special form.</p></div>\",\"PeriodicalId\":101271,\"journal\":{\"name\":\"USSR Computational Mathematics and Mathematical Physics\",\"volume\":\"30 2\",\"pages\":\"Pages 56-62\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0041-5553(90)90076-5\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"USSR Computational Mathematics and Mathematical Physics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0041555390900765\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"USSR Computational Mathematics and Mathematical Physics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0041555390900765","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Programming a generalized cholesky algorithm for mixed discrete analogues of elliptic boundary-value problems
An approach to the programming of a new algorithm involving a certain numbering of the unknowns is proposed, the use of which does not require permutation of rows and columns of the system to ensure stability of the solution algorithm. A method is proposed for solving the corresponding system of linear algebraic equations, whose matrix is not positive-definite but is of a special form.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
