{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/a-fast-route-to-non-linear-clustering","title":"A Fast Route to Non-Linear Clustering Statistics in Modified Gravity Theories","arxiv_id":"1403.6492","date":"2014-03-25","proceeding":null,"authors":["Hans A. Winther","Pedro G. Ferreira"],"abstract":"We propose a simple and computationally fast method for performing N-body simulations for a large class of modified gravity theories with a screening mechanism such as chameleons, symmetrons and galileons. By combining the linear Klein-Gordon equation with a screening factor, calculated from analytical solutions of spherical symmetric configurations, we obtain a modified field equation whose solution is exact in the linear regime while at the same time takes screening into account on non-linear scales. The resulting modified field equation remains linear and can be solved just as quickly as the Poisson equation without any of the convergence problems that can arise when solving the full equation. We test our method with N-body simulations and find that it compares remarkably well with full simulations well into the non-linear regime.","url_abs":"https://arxiv.org/abs/1403.6492v2","url_pdf":"https://arxiv.org/pdf/1403.6492v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"links_only","authors_date_abstract":"arXiv metadata, CC0 1.0 (https://info.arxiv.org/help/license), from the Kaggle arXiv metadata snapshot of 2026-09-12"},"code_links":[{"paper_slug":"a-fast-route-to-non-linear-clustering","repo_url":"https://github.com/HAWinther/MG-PICOLA-PUBLIC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-2.0"}},{"paper_slug":"a-fast-route-to-non-linear-clustering","repo_url":"https://github.com/HAWinther/RamsesPatchApproxMGSolver","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}