Efficient computation of N-point correlation functions in D dimensions

We present efficient algorithms for computing the N-point correlation functions (NPCFs) of random fields in arbitrary D-dimensional homogeneous and isotropic spaces. Such statistics appear throughout the physical sciences and provide a natural tool to describe stochastic processes. Typically, algori...

Descripción completa

Detalles Bibliográficos
Autores principales: Philcox, Oliver H. E., Slepian, Zachary
Formato: Online Artículo Texto
Lenguaje:English
Publicado: National Academy of Sciences 2022
Materias:
Physical Sciences
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9388109/
https://www.ncbi.nlm.nih.gov/pubmed/35939667
http://dx.doi.org/10.1073/pnas.2111366119

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9388109/
https://www.ncbi.nlm.nih.gov/pubmed/35939667
http://dx.doi.org/10.1073/pnas.2111366119

Ejemplares similares