• DocumentCode
    2152417
  • Title

    Hybridization techniques for fast radiosity solvers

  • Author

    Leblond, Michel ; Rousselle, Francois ; Renaud, Christophe

  • Author_Institution
    Lab. de Math. Pures et Appl., Univ. du Littoral Cote d´´Opale, Calais, France
  • fYear
    2000
  • fDate
    2000
  • Firstpage
    269
  • Lastpage
    278
  • 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
  • Keywords
    brightness; convergence of numerical methods; iterative methods; linear algebra; rendering (computer graphics); Gauss-Seidel solver; classical linear systems solvers; convergence speed; fast radiosity solvers; full-matrix radiosity method; group progressive radiosity approach; hybridization techniques; iterative methods; plant growth simulation; radiosity assumptions; Acceleration; Computational modeling; Convergence; Equations; Gaussian processes; Iterative methods; Layout; Lighting; Linear systems; Transmission line matrix methods;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Graphics International, 2000. Proceedings
  • Conference_Location
    Geneva
  • Print_ISBN
    0-7695-0643-7
  • Type

    conf

  • DOI
    10.1109/CGI.2000.852342
  • Filename
    852342