2021
DOI: 10.1088/1475-7516/2021/06/013
|View full text |Cite
|
Sign up to set email alerts
|

Ultralocality and slow contraction

Abstract: We study the detailed process by which slow contraction smooths and flattens the universe using an improved numerical relativity code that accepts initial conditions with non-perturbative deviations from homogeneity and isotropy along two independent spatial directions. Contrary to common descriptions of the early universe, we find that the geometry first rapidly converges to an inhomogeneous, spatially-curved and anisotropic ultralocal state in which all spatial gradient contributions to the equations of moti… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
59
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
2

Relationship

4
3

Authors

Journals

citations
Cited by 22 publications
(63 citation statements)
references
References 25 publications
2
59
0
Order By: Relevance
“…While the refinement in AMR is every bit as deterministic as it is in a box-in-a-box approach, the complexity of the underlying algorithm makes it practically impossible for a user to predict when, if and where refinement will take place. Consider for example the convergence analysis of a simulation using the truncation-error based tagging criterion of (47); in some regions of the spacetime a low resolution run may encounter a sufficiently large truncation error to trigger refinement whereas a higher-resolution run will not. To counteract this effect, one may adjust the tagging threshold in anticipation of the reduction in the truncation error, but some experimentation is often necessary because different ingredients of the code have different orders of accuracy.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…While the refinement in AMR is every bit as deterministic as it is in a box-in-a-box approach, the complexity of the underlying algorithm makes it practically impossible for a user to predict when, if and where refinement will take place. Consider for example the convergence analysis of a simulation using the truncation-error based tagging criterion of (47); in some regions of the spacetime a low resolution run may encounter a sufficiently large truncation error to trigger refinement whereas a higher-resolution run will not. To counteract this effect, one may adjust the tagging threshold in anticipation of the reduction in the truncation error, but some experimentation is often necessary because different ingredients of the code have different orders of accuracy.…”
Section: Discussionmentioning
confidence: 99%
“…We note that the error (47) clearly must be computed before we average the finer grid values onto the coarser grid. As Chombo uses a cell-centered scheme, in order to compare the values of f on the two levels, we interpolate f from the coarser level onto the finer level using fourth order interpolation.…”
Section: Using Truncation Error For Tagging Cellsmentioning
confidence: 99%
See 2 more Smart Citations
“…This stiffness problem has been successfully addressed by using a 'Hubble-normalized' formulation in which the Hubble radius does not enter explicitly (see e.g. [20,6]). The analogous problem pertaining to studying the robustness of inflationary spacetimes to cosmic initial conditions is yet unresolved, as we will discuss below in Sec.…”
Section: Formal Dressing Of the Field Equationsmentioning
confidence: 99%