Hybrid minimization algorithm for computationally expensive multi-dimensional fitting

arXiv (Cornell University)(2021)

Cited 0|Views1
No score
Abstract
Multi-dimensional optimization is widely used in virtually all areas of modern astrophysics. However, it is often too computationally expensive to evaluate a model on-the-fly. Typically, it is solved by pre-computing a grid of models for a predetermined set of positions in the parameter space and then interpolating. Here we present a hybrid minimization approach based on the local quadratic approximation of the $\chi^2$ profile from a discrete set of models in a multidimensional parameter space. The main idea of our approach is to eliminate the interpolation of models from the process of finding the best-fitting solution. We present several examples of applications of our minimization technique to the analysis of stellar and extragalactic spectra.
More
Translated text
Key words
hybrid minimization algorithm,multi-dimensional
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined