{"title":"快速辐射解算器的杂交技术","authors":"M. Leblond, F. Rousselle, C. Renaud","doi":"10.1109/CGI.2000.852342","DOIUrl":null,"url":null,"abstract":"The authors study, both theoretically and experimentally some properties of classical linear systems solvers, according to the radiosity assumptions. We prove important properties for some of these solvers which allow the user to choose the best one. We then introduce a new technique, so called hybridization, whose purpose is to increase the convergence speed of iterative methods. It provides very efficient results for the well-known Gauss-Seidel solver. This technique has been successfully applied to both a group progressive radiosity approach and a full-matrix radiosity method which has been specifically designed for plant growth simulation.","PeriodicalId":357548,"journal":{"name":"Proceedings Computer Graphics International 2000","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Hybridization techniques for fast radiosity solvers\",\"authors\":\"M. Leblond, F. Rousselle, C. Renaud\",\"doi\":\"10.1109/CGI.2000.852342\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors study, both theoretically and experimentally some properties of classical linear systems solvers, according to the radiosity assumptions. We prove important properties for some of these solvers which allow the user to choose the best one. We then introduce a new technique, so called hybridization, whose purpose is to increase the convergence speed of iterative methods. It provides very efficient results for the well-known Gauss-Seidel solver. This technique has been successfully applied to both a group progressive radiosity approach and a full-matrix radiosity method which has been specifically designed for plant growth simulation.\",\"PeriodicalId\":357548,\"journal\":{\"name\":\"Proceedings Computer Graphics International 2000\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Computer Graphics International 2000\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CGI.2000.852342\",\"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 Computer Graphics International 2000","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CGI.2000.852342","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Hybridization techniques for fast radiosity solvers
The authors study, both theoretically and experimentally some properties of classical linear systems solvers, according to the radiosity assumptions. We prove important properties for some of these solvers which allow the user to choose the best one. We then introduce a new technique, so called hybridization, whose purpose is to increase the convergence speed of iterative methods. It provides very efficient results for the well-known Gauss-Seidel solver. This technique has been successfully applied to both a group progressive radiosity approach and a full-matrix radiosity method which has been specifically designed for plant growth simulation.