Termination Criteria for Linear Problems

Paskov, Spassimir H.

doi:10.1006/jcom.1995.1004

Search citation statements

Order By: Relevance

Paper Sections

Select...

Methods1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1995

2013

Publication Types

Select...

Book4

Article1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As mentioned in section 3.1, for adaptive termination of the preprocessing step we have to apply infinite low discrepancy sequences like the Faure-, Halton-, or Sobol-sequence. The termination criterion is similar to [Pas94]. For two numbers N 1 and N 2 of iterated paths, we determine an error by…”

Section: Methodsmentioning

confidence: 99%

A Quasi-Monte Carlo Algorithm for the Global Illumination Problem in the Radiosity Setting

Keller

1995

Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing

View full text Add to dashboard Cite

The main problem in computer graphics is to solve the global illumination problem, which is given by a Fredholm integral equation of the second kind, called the radiance equation (REQ). In order to achieve realistic images, a very complex kernel of the integral equation, modelling all physical effects of light, must be considered. Due to this complexity Monte Carlo methods seem tobe an a.ppropriate approach to solve the REQ approximately. We show tha.t replacing Monte Carlo by quasi-Monte Carlo in some steps of the algorithm results in a. faster convergence.

show abstract

Section: Methodsmentioning

confidence: 99%