APPLYING THE EXPONENTIAL CHEBYSHEV INEQUALITY TO THE NONDETERMINISTIC COMPUTATION OF FORM FACTORS

Simple item page
dc.contributor.authorBaranoski, Gladimir V.G.eng
dc.contributor.authorRokne, Jon G.eng
dc.contributor.authorXu, Guangwueng
dc.date.accessioned2008-05-08T18:37:55Z
dc.date.available2008-05-08T18:37:55Z
dc.date.computerscience1999-05-27eng
dc.date.issued1999-03-01eng
dc.description.abstractThe computation of the fraction of radiation power that leaves a surface and arrives at another, which is specified by the form factor linking both surfaces, is central to radiative transfer simulations. Although there are several approaches that can be used to compute form factors, the application of nondeterministic methods is becoming increasingly important due to the simplicity of their procedures and their wide range of applications. These methods compute form factors implicitly through the application of standard Monte Carlo techniques and ray casting algorithms. Their accuracy and computational costs are, however, highly dependent on the ray density used in the computations. In this paper a mathematical bound, based on probability theory, is proposed to determine the number of rays needed to obtain asymptotically convergent estimates for form factors in a computationally efficient stochastic process. Specifically, the exponential Chebyshev inequality is introduced to the radiative transfer field in order to determine the ray density required to compute form factors with a high reliability/cost ratio. Numerical experiments are provided which illustrate the validity and usefulness of the proposed bound.eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1999-638-01eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30970
dc.identifier.urihttp://hdl.handle.net/1880/46401
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleAPPLYING THE EXPONENTIAL CHEBYSHEV INEQUALITY TO THE NONDETERMINISTIC COMPUTATION OF FORM FACTORSeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
1999-638-01.pdf.gz
Size:
129.67 KB
Format:
Unknown data format
Download
No Thumbnail Available
Name:
1999-638-01.ps
Size:
483.83 KB
Format:
Postscript Files
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications