BEM-Based Magnetic Field Reconstruction by Ensemble Kálmán Filtering
Liebsch, M., Russenschuck, S., & Kurz, S. (2023). BEM-Based Magnetic Field Reconstruction by Ensemble Kálmán Filtering. Computational Methods in Applied Mathematics, 23(2), 405-424. https://doi.org/10.1515/cmam-2022-0121
Julkaistu sarjassa
Computational Methods in Applied MathematicsPäivämäärä
2023Tekijänoikeudet
© 2022 the author(s)
Magnetic fields generated by normal or superconducting electromagnets are used to guide and focus particle beams in storage rings, synchrotron light sources, mass spectrometers, and beamlines for radiotherapy. The accurate determination of the magnetic field by measurement is critical for the prediction of the particle beam trajectory and hence the design of the accelerator complex. In this context, state-of-the-art numerical field computation makes use of boundary-element methods (BEM) to express the magnetic field. This enables the accurate computation of higher-order partial derivatives and local expansions of magnetic potentials used in efficient numerical codes for particle tracking. In this paper, we present an approach to infer the boundary data of an indirect BEM formulation from magnetic field measurements by ensemble Kálmán filtering. In this way, measurement uncertainties can be propagated to the boundary data, magnetic field and potentials, and to the beam related quantities derived from particle tracking. We provide results obtained from real measurement data of a curved dipole magnet using a Hall probe mapper system.
...
Julkaisija
Walter de Gruyter GmbHISSN Hae Julkaisufoorumista
1609-4840Asiasanat
Julkaisu tutkimustietojärjestelmässä
https://converis.jyu.fi/converis/portal/detail/Publication/164403935
Metadata
Näytä kaikki kuvailutiedotKokoelmat
Lisätietoja rahoituksesta
The work of Melvin Liebsch is supported by the Graduate School CE within the Centre for Computational Engineering at Technische Universität Darmstadt.Lisenssi
Samankaltainen aineisto
Näytetään aineistoja, joilla on samankaltainen nimeke tai asiasanat.
-
Conditional particle filters with diffuse initial distributions
Karppinen, Santeri; Vihola, Matti (Springer, 2021)Conditional particle filters (CPFs) are powerful smoothing algorithms for general nonlinear/non-Gaussian hidden Markov models. However, CPFs can be inefficient or difficult to apply with diffuse initial distributions, which ... -
A Bayesian Reconstruction of a Historical Population in Finland, 1647–1850
Voutilainen, Miikka; Helske, Jouni; Högmander, Harri (Springer, 2020)This article provides a novel method for estimating historical population development. We review the previous literature on historical population time-series estimates and propose a general outline to address the well-known ... -
A New Method to Reconstruct Quantitative Food Webs and Nutrient Flows from Isotope Tracer Addition Experiments
López-Sepulcre, Andres; Bruneaux, Matthieu; Collins, Sarah M.; El-Sabaawi, Rana; Flecker, Alexander S.; Thomas, Steven A. (University of Chicago Press, 2020)Understanding how nutrients flow through food webs is central in ecosystem ecology. Tracer addition experiments are powerful tools to reconstruct nutrient flows by adding an isotopically enriched element into an ecosystem ... -
Statistical methods for adaptive river basin management and monitoring
Kotamäki, Niina (University of Jyväskylä, 2018)Decision-making at different phases of adaptive river basin management planning rely largely on the information that is gained through environmental monitoring. The aim of this thesis was to develop and test statistical ... -
Bayesian subcohort selection for longitudinal covariate measurements in follow‐up studies
Reinikainen, Jaakko; Karvanen, Juha (Wiley-Blackwell, 2022)We propose an approach for the planning of longitudinal covariate measurements in follow-up studies where covariates are time-varying. We assume that the entire cohort cannot be selected for longitudinal measurements due ...
Ellei toisin mainittu, julkisesti saatavilla olevia JYX-metatietoja (poislukien tiivistelmät) saa vapaasti uudelleenkäyttää CC0-lisenssillä.