{"title":"线性系统叠列解的混沌方法","authors":"Rafael Bru , Violeta Migallon , José Penadés","doi":"10.1016/0956-0521(95)00046-1","DOIUrl":null,"url":null,"abstract":"<div><p>Chaotic synchronous and asynchronous schemes based on two-stage methods to solve nonsingular linear systems are presented. The convergence of these schemes is studied either when the chaotic parameters become sufficiently large or when the matrix in question is monotone. The results are illustrated by computational experiments on a shared memory multiprocessor vector computer.</p></div>","PeriodicalId":100325,"journal":{"name":"Computing Systems in Engineering","volume":"6 4","pages":"Pages 385-390"},"PeriodicalIF":0.0000,"publicationDate":"1995-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0956-0521(95)00046-1","citationCount":"17","resultStr":"{\"title\":\"Chaotic methods for the papallel solution of linear systems\",\"authors\":\"Rafael Bru , Violeta Migallon , José Penadés\",\"doi\":\"10.1016/0956-0521(95)00046-1\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Chaotic synchronous and asynchronous schemes based on two-stage methods to solve nonsingular linear systems are presented. The convergence of these schemes is studied either when the chaotic parameters become sufficiently large or when the matrix in question is monotone. The results are illustrated by computational experiments on a shared memory multiprocessor vector computer.</p></div>\",\"PeriodicalId\":100325,\"journal\":{\"name\":\"Computing Systems in Engineering\",\"volume\":\"6 4\",\"pages\":\"Pages 385-390\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1995-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/0956-0521(95)00046-1\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computing Systems in Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/0956052195000461\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computing Systems in Engineering","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0956052195000461","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Chaotic methods for the papallel solution of linear systems
Chaotic synchronous and asynchronous schemes based on two-stage methods to solve nonsingular linear systems are presented. The convergence of these schemes is studied either when the chaotic parameters become sufficiently large or when the matrix in question is monotone. The results are illustrated by computational experiments on a shared memory multiprocessor vector computer.