Related papers: Analysis of an iterative reconstruction method in …
The reconstruction algorithm introduced by \cite{Eis07}, which is widely used in clustering analysis, is based on the inference of the first order Lagrangian displacement field from the Gaussian smoothed galaxy density field in redshift…
We apply an iterative reconstruction method to galaxy mocks in redshift space obtained from $N$-body simulations. Comparing the two-point correlation functions for the reconstructed density field, we find that although the performance is…
Motivated by recent developments in perturbative calculations of the nonlinear evolution of large-scale structure, we present an iterative algorithm to reconstruct the initial conditions in a given volume starting from the dark matter…
We present an iterative method to reconstruct the linear-theory initial conditions from the late-time cosmological matter density field, with the intent of improving the recovery of the cosmic distance scale from the baryon acoustic…
Observations of galaxy clustering are made in redshift space, which results in distortions to the underlying isotropic distribution of galaxies. These redshift-space distortions (RSD) not only degrade important features of the matter…
With the availability of more powerful computers, iterative reconstruction algorithms are the subject of an ongoing work in the design of more efficient reconstruction algorithms for X-ray computed tomography. In this work, we show how two…
We apply nonlinear reconstruction to the dark matter density field in redshift space and solve for the nonlinear mapping from the initial Lagrangian position to the final redshift space position. The reconstructed anisotropic field inferred…
We present a fast iterative FFT-based reconstruction algorithm that allows for non- parallel redshift-space distortions (RSD). We test our algorithm on both N-body dark matter simulations and mock distributions of galaxies designed to…
We present a cosmic density field reconstruction method that augments the traditional reconstruction algorithms with a convolutional neural network (CNN). Following Shallue $\&$ Eisenstein (2022), the key component of our method is to use…
The next generation of galaxy surveys like the Dark Energy Spectroscopic Instrument (DESI) and Euclid will provide datasets orders of magnitude larger than anything available to date. Our ability to model nonlinear effects in late time…
Dual decomposition is a powerful technique for deriving decomposition schemes for convex optimization problems with separable structure. Although the Augmented Lagrangian is computationally more stable than the ordinary Lagrangian, the…
We present a self-consistent Bayesian formalism to sample the primordial density fields compatible with a set of dark matter density tracers after cosmic evolution observed in redshift space. Previous works on density reconstruction did not…
Applying standard algorithms to sparse data problems in photoacoustic tomography (PAT) yields low-quality images containing severe under-sampling artifacts. To some extent, these artifacts can be reduced by iterative image reconstruction…
The microstructure analyses of porous media have considerable research value for the study of macroscopic properties. As the premise of conducting these analyses, the accurate reconstruction of microstructure digital model is also an…
In this paper, we report a significant recovery of the linear baryonic acoustic oscillation (BAO) signature by applying the isobaric reconstruction algorithm to the non-linear matter density field. Assuming only the longitudinal component…
The density matrix renormalization group (DMRG) algorithm is a popular alternating minimization scheme for solving high-dimensional optimization problems in the tensor train format. Classical DMRG, however, is based on sequential…
Fitting half-integer generalized Laguerre functions to the evolved, real-space dark matter and halo correlation functions provides a simple way to reconstruct their initial shapes. We show that this methodology also works well in a wide…
Three dimensional surface reconstruction based on two dimensional sparse information in the form of only a small number of level lines of the surface with moderately complex structures, containing both structured and unstructured…
A new algorithm for solving large-scale convex optimization problems with a separable objective function is proposed. The basic idea is to combine three techniques: Lagrangian dual decomposition, excessive gap and smoothing. The main…
We propose an initialization procedure for the density-matrix renormalization group (DMRG): {\it the recursive sweep method}. In a conventional DMRG calculation, the infinite-algorithm, where two new sites are added to the system at each…