English
Related papers

Related papers: An Accurate P$^{3}$M Algorithm for Gravitational L…

200 papers

The GRavitational lEnsing Accuracy Testing 3 (GREAT3) challenge is the third in a series of image analysis challenges, with a goal of testing and facilitating the development of methods for analyzing astronomical images that will be used to…

In this work, the computational complexity of a spin-glass three-dimensional (3D) Ising model (for the lattice size N = lmn, where l, m, n are the numbers of lattice points along three crystallographic directions) is studied. We prove that…

General Physics · Physics 2025-06-04 Zhidong Zhang

We develop the maximum-entropy weak shear mass reconstruction method presented in earlier papers by taking each background galaxy image shape as an independent estimator of the reduced shear field and incorporating an intrinsic smoothness…

Astrophysics · Physics 2009-11-07 P. J. Marshall , M. P. Hobson , S. F. Gull , S. L. Bridle

Recursive estimation of nonlinear dynamical systems is an important problem that arises in several engineering applications. Consistent and accurate propagation of uncertainties is important to ensuring good estimation performance. It is…

Systems and Control · Computer Science 2016-03-16 Dilshad Raihan Akkam Veettil , Suman Chakravorty

Mesh adaption procedures for finite element approximation allows one to adapt the resolution, by local refinement in the regions of strong variation of the function of interest. This procedure plays a key role in numerous applications of…

Numerical Analysis · Mathematics 2015-03-17 Jean-Marie Mirebeau

The minimum degree algorithm is one of the most widely-used heuristics for reducing the cost of solving large sparse systems of linear equations. It has been studied for nearly half a century and has a rich history of bridging techniques…

Data Structures and Algorithms · Computer Science 2023-04-11 Robert Cummings , Matthew Fahrbach , Animesh Fatehpuria

Over the last two decades, several fast, robust, and high-order accurate methods have been developed for solving the Poisson equation in complicated geometry using potential theory. In this approach, rather than discretizing the partial…

Numerical Analysis · Mathematics 2024-09-19 Fredrik Fryklund , Leslie Greengard , Shidong Jiang , Samuel Potter

Strong gravitational lensing of an extended object is described by a mapping from source to image coordinates that is nonlinear and cannot generally be inverted analytically. Determining the structure of the source intensity distribution…

Cosmology and Nongalactic Astrophysics · Physics 2015-05-27 Adam Rogers , Jason D. Fiege

Particle methods are a ubiquitous tool for solving the Vlasov-Poisson equation in comoving coordinates, which is used to model the gravitational evolution of dark matter in an expanding universe. However, these methods are known to produce…

Cosmology and Nongalactic Astrophysics · Physics 2016-01-12 Andrew Myers , Phillip Colella , Brian Van Straalen

Given a weighted graph $G$ with $n$ vertices and $m$ edges, and a positive integer $p$, the Hamiltonian $p$-median problem consists in finding $p$ cycles of minimum total weight such that each vertex of $G$ is in exactly one cycle. We…

Data Structures and Algorithms · Computer Science 2022-04-28 Dilson Lucas Pereira , Michel Wan Der Maas Soares

Optimisation problems are ubiquitous in particle and astrophysics, and involve locating the optimum of a complicated function of many parameters that may be computationally expensive to evaluate. We describe a number of global optimisation…

Generative models are increasingly central to scientific workflows, yet their systematic use and interpretation require a proper understanding of their limitations through rigorous validation. Classic approaches struggle with scalability,…

Machine Learning · Statistics 2025-11-26 Pietro Cappelli , Gaia Grosso , Marco Letizia , Humberto Reyes-González , Marco Zanetti

Monte Carlo simulations of physics processes at particle colliders like the Large Hadron Collider at CERN take up a major fraction of the computational budget. For some simulations, a single data point takes seconds, minutes, or even hours…

Computational Physics · Physics 2023-02-03 Fady Bishara , Ayan Paul , Jennifer Dy

Structural learning, a method to estimate the parameters for discrete energy minimization, has been proven to be effective in solving computer vision problems, especially in 3D scene parsing. As the complexity of the models increases,…

Computer Vision and Pattern Recognition · Computer Science 2017-01-13 Mengtian Li , Daniel Huber

Particle-based shape modeling (PSM) is a family of approaches that automatically quantifies shape variability across anatomical cohorts by positioning particles (pseudo landmarks) on shape surfaces in a consistent configuration. Recent…

Computer Vision and Pattern Recognition · Computer Science 2025-07-11 Hong Xu , Shireen Y. Elhabian

Modern applications of strong gravitational lensing require the ability to use precise and varied observational data to constrain complex lens models. I discuss two sets of computational methods for lensing calculations. The first is a new…

Astrophysics · Physics 2007-05-23 Charles R. Keeton

The Fast Multipole Method (FMM) offers an acceleration for pairwise interaction calculation, known as $N$-body problems, from $\mathcal{O}(N^2)$ to $\mathcal{O}(N)$ with $N$ particles. This has brought dramatic increase in the capability of…

Data Structures and Algorithms · Computer Science 2011-09-21 Felipe A. Cruz , L. A. Barba

The stability of a differentially rotating fluid subject to its own gravity is a problem with applications across wide areas of astrophysics--from protoplanetary discs (PPDs) to entire galaxies. The shearing box formalism offers a…

Instrumentation and Methods for Astrophysics · Physics 2026-02-04 S. Rendon Restrepo , O. Gressel

In this article, we present a three-dimensional anisotropic $hp$-mesh refinement strategy for ultraweak discontinuous Petrov--Galerkin (DPG) formulations with optimal test functions. The refinement strategy utilizes the built-in…

Computational Engineering, Finance, and Science · Computer Science 2023-09-06 Ankit Chakraborty , Stefan Henneking , Leszek Demkowicz

Finding an exact ground state of a three-dimensional (3D) Ising spin glass is proven to be an NP-hard problem (i.e., at least as hard as any problem in the nondeterministic polynomial-time (NP) class). Given validity of the exponential time…

Disordered Systems and Neural Networks · Physics 2025-07-30 Hao Zhang , Alex Kamenev