
arXiv: 1105.2737
Fast Fourier transforms are used to develop algorithms for the fast generation of correlated Gaussian random fields on d-dimensional rectangular regions. The complexities of the algorithms are derived, simulation results and error analysis are presented.
15 pages, 8 figures. Typos corrected in Algorithm 3, Remark (4), Algorithm 4, Remark (5), and Algorithm 5, Remark (5)
numerical examples, Gaussian random fields, Numerical Analysis (math.NA), White noise theory, algorithms, fast Fourier transform, 510, Other computational problems in probability, Complexity and performance of numerical algorithms, FOS: Mathematics, Random fields, complexities, Mathematics - Numerical Analysis, Numerical methods for discrete and fast Fourier transforms, error analysis, 65C05, 65C50, 60G60, 60H40
numerical examples, Gaussian random fields, Numerical Analysis (math.NA), White noise theory, algorithms, fast Fourier transform, 510, Other computational problems in probability, Complexity and performance of numerical algorithms, FOS: Mathematics, Random fields, complexities, Mathematics - Numerical Analysis, Numerical methods for discrete and fast Fourier transforms, error analysis, 65C05, 65C50, 60G60, 60H40
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 49 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
