2,838 research outputs found
FitSKIRT: genetic algorithms to automatically fit dusty galaxies with a Monte Carlo radiative transfer code
We present FitSKIRT, a method to efficiently fit radiative transfer models to
UV/optical images of dusty galaxies. These images have the advantage that they
have better spatial resolution compared to FIR/submm data. FitSKIRT uses the
GAlib genetic algorithm library to optimize the output of the SKIRT Monte Carlo
radiative transfer code. Genetic algorithms prove to be a valuable tool in
handling the multi- dimensional search space as well as the noise induced by
the random nature of the Monte Carlo radiative transfer code. FitSKIRT is
tested on artificial images of a simulated edge-on spiral galaxy, where we
gradually increase the number of fitted parameters. We find that we can recover
all model parameters, even if all 11 model parameters are left unconstrained.
Finally, we apply the FitSKIRT code to a V-band image of the edge-on spiral
galaxy NGC4013. This galaxy has been modeled previously by other authors using
different combinations of radiative transfer codes and optimization methods.
Given the different models and techniques and the complexity and degeneracies
in the parameter space, we find reasonable agreement between the different
models. We conclude that the FitSKIRT method allows comparison between
different models and geometries in a quantitative manner and minimizes the need
of human intervention and biasing. The high level of automation makes it an
ideal tool to use on larger sets of observed data.Comment: 14 pages, 10 figures; accepted for publication in Astronomy and
Astrophysic
Parameter estimation for the Euler-Bernoulli-beam
An approximation involving cubic spline functions for parameter estimation problems in the Euler-Bernoulli-beam equation (phrased as an optimization problem with respect to the parameters) is described and convergence is proved. The resulting algorithm was implemented and several of the test examples are documented. It is observed that the use of penalty terms in the cost functional can improve the rate of convergence
Algorithms and literate programs for weighted low-rank approximation with missing data
Linear models identification from data with missing values is posed as a weighted low-rank approximation problem with weights related to the missing values equal to zero. Alternating projections and variable projections methods for solving the resulting problem are outlined and implemented in a literate programming style, using Matlab/Octave's scripting language. The methods are evaluated on synthetic data and real data from the MovieLens data sets
- …