Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userA numerical magnetohydrodynamic scheme using the hydrostatic approximation
93
0
0.0
(
0
)
Authors
Jonathan Braithwaite
Ask ChatGPT about the research
No Arabic abstract
In gravitationally stratified fluids, length scales are normally much greater in the horizontal direction than in the vertical one. When modelling these fluids it can be advantageous to use the hydrostatic approximation, which filters out vertically propagating sound waves and thus allows a greater timestep. We briefly review this approximation, which is commonplace in atmospheric physics, and compare it to other approximations used in astrophysics such as Boussinesq and anelastic, finding that it should be the best approximation to use in context such as radiative stellar zones, compact objects, stellar or planetary atmospheres and other contexts. We describe a finite-difference numerical scheme which uses this approximation, which includes magnetic fields.
rate research
Read More
The Max-Cut problem is a well known combinatorial optimization problem. In this paper we describe a fast approximation method. Given a graph G, we want to find a cut whose size is maximal among all possible cuts. A cut is a partition of the vertex set of G into two disjoint subsets. For an unweighted graph, the size of the cut is the number of edges that have one vertex on either side of the partition; we also consider a weighted version of the problem where each edge contributes a nonnegative weight to the cut. We introduce the signless Ginzburg-Landau functional and prove that this functional Gamma-converges to a Max-Cut objective functional. We approximately minimize this functional using a graph based signless Merriman-Bence-Osher scheme, which uses a signless Laplacian. We show experimentally that on some classes of graphs the resulting algorithm produces more accurate maximum cut approximations than the current state-of-the-art approximation algorithm. One of our methods of minimizing the functional results in an algorithm with a time complexity of O(|E|), where |E| is the total number of edges on G.
Both NASAs Solar Dynamics Observatory (SDO) and the JAXA/NASA Hinode mission include spectropolarimetric instruments designed to measure the photospheric magnetic field. SDOs Helioseismic and Magnetic Imager (HMI) emphasizes full-disk high-cadence and good spatial resolution data acquisition while Hinodes Solar Optical Telescope Spectro-Polarimeter (SOT-SP) focuses on high spatial resolution and spectral sampling at the cost of a limited field of view and slower temporal cadence. This work introduces a deep-learning system named SynthIA (Synthetic Inversion Approximation), that can enhance both missions by capturing the best of each instruments characteristics. We use SynthIA to produce a new magnetogram data product, SynodeP (Synthetic Hinode Pipeline), that mimics magnetograms from the higher spectral resolution Hinode/SOT-SP pipeline, but is derived from full-disk, high-cadence, and lower spectral-resolution SDO/HMI Stokes observations. Results on held-out data show that SynodeP has good agreement with the Hinode/SOT-SP pipeline
Model fitting is possibly the most extended problem in science. Classical approaches include the use of least-squares fitting procedures and maximum likelihood methods to estimate the value of the parameters in the model. However, in recent years, Bayesian inference tools have gained traction. Usually, Markov chain Monte Carlo methods are applied to inference problems, but they present some disadvantages, particularly when comparing different models fitted to the same dataset. Other Bayesian methods can deal with this issue in a natural and effective way. We have implemented an importance sampling algorithm adapted to Bayesian inference problems in which the power of the noise in the observations is not known a priori. The main advantage of importance sampling is that the model evidence can be derived directly from the so-called importance weights -- while MCMC methods demand considerable postprocessing. The use of our adaptive target, adaptive importance sampling (ATAIS) method is shown by inferring, on the one hand, the parameters of a simulated flaring event which includes a damped oscillation {and, on the other hand, real data from the Kepler mission. ATAIS includes a novel automatic adaptation of the target distribution. It automatically estimates the variance of the noise in the model. ATAIS admits parallelisation, which decreases the computational run-times notably. We compare our method against a nested sampling method within a model selection problem.
We present a public code to generate random fields with an arbitrary probability distribution function (PDF) and an arbitrary correlation function. The algorithm is cosmology-independent, applicable to any stationary stochastic process over a three dimensional grid. We implement it in the case of the matter density field, showing its benefits over the lognormal approximation, which is often used in cosmology for generation of mock catalogues. We find that the covariance of the power spectrum from the new fast realizations is more accurate than that from a lognormal model. As a proof of concept, we also apply the new simulation scheme to the divergence of the Lagrangian displacement field. We find that information from the correlation function and the PDF of the displacement-divergence provides modest improvement over other standard analytical techniques to describe the particle field in the simulation. This suggests that further progress in this direction should come from multi-scale or non-local properties of the initial matter distribution.
This paper presents a numerical method to implement the parameter estimation method using response statistics that was recently formulated by the authors. The proposed approach formulates the parameter estimation problem of It^o drift diffusions as a nonlinear least-squares problem. To avoid solving the model repeatedly when using an iterative scheme in solving the resulting least-squares problems, a polynomial surrogate model is employed on appropriate response statistics with smooth dependence on the parameters. The existence of minimizers of the approximate polynomial least-squares problems that converge to the solution of the true least square problem is established under appropriate regularity assumption of the essential statistics as functions of parameters. Numerical implementation of the proposed method is conducted on two prototypical examples that belong to classes of models with wide range of applications, including the Langevin dynamics and the stochastically forced gradient flows. Several important practical issues, such as the selection of the appropriate response operator to ensure the identifiability of the parameters and the reduction of the parameter space, are discussed. From the numerical experiments, it is found that the proposed approach is superior compared to the conventional approach that uses equilibrium statistics to determine the parameters.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
