TY - JOUR A1 - Schenkl, Sebastian A1 - Muggenthaler, Holger A1 - Hubig, Michael A1 - Erdmann, Bodo A1 - Weiser, Martin A1 - Zachow, Stefan A1 - Heinrich, Andreas A1 - Güttler, Felix Victor A1 - Teichgräber, Ulf A1 - Mall, Gita T1 - Automatic CT-based finite element model generation for temperature-based death time estimation: feasibility study and sensitivity analysis JF - International Journal of Legal Medicine N2 - Temperature based death time estimation is based either on simple phenomenological models of corpse cooling or on detailed physical heat transfer models. The latter are much more complex, but allow a higher accuracy of death time estimation as in principle all relevant cooling mechanisms can be taken into account. Here, a complete work flow for finite element based cooling simulation models is presented. The following steps are demonstrated on CT-phantoms: • CT-scan • Segmentation of the CT images for thermodynamically relevant features of individual geometries • Conversion of the segmentation result into a Finite Element (FE) simulation model • Computation of the model cooling curve • Calculation of the cooling time For the first time in FE-based cooling time estimation the steps from the CT image over segmentation to FE model generation are semi-automatically performed. The cooling time calculation results are compared to cooling measurements performed on the phantoms under controlled conditions. In this context, the method is validated using different CTphantoms. Some of the CT phantoms thermodynamic material parameters had to be experimentally determined via independent experiments. Moreover the impact of geometry and material parameter uncertainties on the estimated cooling time is investigated by a sensitivity analysis. KW - temperature based death time estimation KW - finite element method KW - CT segmentation KW - sensitivity analysis Y1 - 2017 U6 - https://doi.org/doi:10.1007/s00414-016-1523-0 VL - 131 IS - 3 SP - 699 EP - 712 ER - TY - JOUR A1 - Weiser, Martin A1 - Freytag, Yvonne A1 - Erdmann, Bodo A1 - Hubig, Michael A1 - Mall, Gita T1 - Optimal Design of Experiments for Estimating the Time of Death in Forensic Medicine JF - Inverse Problems N2 - Estimation of time of death based on a single measurement of body core temperature is a standard procedure in forensic medicine. Mechanistic models using simulation of heat transport promise higher accuracy than established phenomenological models in particular in nonstandard situations, but involve many not exactly known physical parameters. Identifying both time of death and physical parameters from multiple temperature measurements is one possibility to reduce the uncertainty significantly. In this paper, we consider the inverse problem in a Bayesian setting and perform both local and sampling-based uncertainty quantification, where proper orthogonal decomposition is used as model reduction for fast solution of the forward model. Based on the local uncertainty quantification, optimal design of experiments is performed in order to minimize the uncertainty in the time of death estimate for a given number of measurements. For reasons of practicability, temperature acquisition points are selected from a set of candidates in different spatial and temporal locations. Applied to a real corpse model, a significant accuracy improvement is obtained already with a small number of measurements. Y1 - 2018 U6 - https://doi.org/10.1088/1361-6420/aae7a5 VL - 34 IS - 12 SP - 125005 ER - TY - JOUR A1 - Götschel, Sebastian A1 - Schiela, Anton A1 - Weiser, Martin T1 - Kaskade 7 - a Flexible Finite Element Toolbox JF - Computers and Mathematics with Applications N2 - Kaskade 7 is a finite element toolbox for the solution of stationary or transient systems of partial differential equations, aimed at supporting application-oriented research in numerical analysis and scientific computing. The library is written in C++ and is based on the \textsc{Dune} interface. The code is independent of spatial dimension and works with different grid managers. An important feature is the mix-and-match approach to discretizing systems of PDEs with different ansatz and test spaces for all variables. We describe the mathematical concepts behind the library as well as its structure, illustrating its use at several examples on the way. Y1 - 2021 U6 - https://doi.org/10.1016/j.camwa.2020.02.011 VL - 81 SP - 444 EP - 458 ER - TY - CHAP A1 - Krause, Rolf A1 - Weiser, Martin T1 - Multilevel augmented Lagrangian solvers for overconstrained contact formulations T2 - ESAIM: ProcS N2 - Multigrid methods for two-body contact problems are mostly based on special mortar discretizations, nonlinear Gauss-Seidel solvers, and solution-adapted coarse grid spaces. Their high computational efficiency comes at the cost of a complex implementation and a nonsymmetric master-slave discretization of the nonpenetration condition. Here we investigate an alternative symmetric and overconstrained segment-to-segment contact formulation that allows for a simple implementation based on standard multigrid and a symmetric treatment of contact boundaries, but leads to nonunique multipliers. For the solution of the arising quadratic programs, we propose augmented Lagrangian multigrid with overlapping block Gauss-Seidel smoothers. Approximation and convergence properties are studied numerically at standard test problems. Y1 - 2021 U6 - https://doi.org/10.1051/proc/202171175 VL - 71 SP - 175 EP - 184 ER - TY - JOUR A1 - Alhaddad, Samer A1 - Förstner, Jens A1 - Groth, Stefan A1 - Grünewald, Daniel A1 - Grynko, Yevgen A1 - Hannig, Frank A1 - Kenter, Tobias A1 - Pfreundt, Franz-Josef A1 - Plessl, Christian A1 - Schotte, Merlind A1 - Steinke, Thomas A1 - Teich, Jürgen A1 - Weiser, Martin A1 - Wende, Florian T1 - HighPerMeshes - A Domain-Specific Language for Numerical Algorithms on Unstructured Grids JF - Euro-Par 2020: Parallel Processing Workshops. N2 - Solving partial differential equations on unstructured grids is a cornerstone of engineering and scientific computing. Nowadays, heterogeneous parallel platforms with CPUs, GPUs, and FPGAs enable energy-efficient and computationally demanding simulations. We developed the HighPerMeshes C++-embedded Domain-Specific Language (DSL) for bridging the abstraction gap between the mathematical and algorithmic formulation of mesh-based algorithms for PDE problems on the one hand and an increasing number of heterogeneous platforms with their different parallel programming and runtime models on the other hand. Thus, the HighPerMeshes DSL aims at higher productivity in the code development process for multiple target platforms. We introduce the concepts as well as the basic structure of the HighPer-Meshes DSL, and demonstrate its usage with three examples, a Poisson and monodomain problem, respectively, solved by the continuous finite element method, and the discontinuous Galerkin method for Maxwell’s equation. The mapping of the abstract algorithmic description onto parallel hardware, including distributed memory compute clusters is presented. Finally, the achievable performance and scalability are demonstrated for a typical example problem on a multi-core CPU cluster. Y1 - 2021 U6 - https://doi.org/10.1007/978-3-030-71593-9_15 SP - 185 EP - 196 PB - Springer ER - TY - CHAP A1 - Müller, Jan A1 - Götschel, Sebastian A1 - Weiser, Martin A1 - Maierhofer, Christiane T1 - Thermografie mit optimierter Anregung für die quantitative Untersuchung von Delaminationen in kohlenstofffaserverstärkten Kunststoffen T2 - NDT.net Proc. DGZfP 2017 N2 - Da kohlenstofffaserverstärkte Kunststoffe (CFK) in anspruchsvollen sicherheitsrelevanten Einsatzgebieten wie im Automobilbau und in der Luftfahrt eingesetzt werden, besteht ein zunehmender Bedarf an zerstörungsfreien Prüfmethoden. Ziel ist die Gewährleistung der Sicherheit und Zuverlässigkeit der eingesetzten Bauteile. Aktive Thermografieverfahren ermöglichen die effiziente Prüfung großer Flächen mit hoher Auflösung in wenigen Arbeitsschritten. Ein wichtiges Teilgebiet der Prüfungen ist die Ortung und Charakterisierung von Delaminationen, die sowohl bereits in der Fertigung als auch während der Nutzung eines Bauteils auftreten können, und dessen strukturelle Integrität schwächen. ;In diesem Beitrag werden CFK-Strukturen mit künstlichen und natürlichen Delaminationen mit Hilfe unterschiedlich zeitlich modulierter Strahlungsquellen experimentell untersucht. Verwendet werden dabei Anregungen mit Blitzlampen und mit frequenzmodulierten Halogenlampen. Mittels Filterfunktionen im Zeit- und Frequenzbereich wird das Kontrast-zu-Rausch-Verhältnis (CNR) der detektierten Fehlstellen optimiert. Verglichen werden anschließend die Nachweisempfindlichkeit, das CNR und die Ortsauflösung der zu charakterisierenden Delaminationen für die unterschiedlichen Anregungs- und Auswertungstechniken. Ergänzt werden die Experimente durch numerische Simulationen des dreidimensionalen Wärmetransportes. Y1 - 2017 ER - TY - GEN A1 - Weiser, Martin A1 - Freytag, Yvonne A1 - Erdmann, Bodo A1 - Hubig, Michael A1 - Mall, Gita T1 - Optimal Design of Experiments for Estimating the Time of Death in Forensic Medicine N2 - Estimation of time of death based on a single measurement of body core temperature is a standard procedure in forensic medicine. Mechanistic models using simulation of heat transport promise higher accuracy than established phenomenological models in particular in nonstandard situations, but involve many not exactly known physical parameters. Identifying both time of death and physical parameters from multiple temperature measurements is one possibility to reduce the uncertainty significantly. In this paper, we consider the inverse problem in a Bayesian setting and perform both local and sampling-based uncertainty quantification, where proper orthogonal decomposition is used as model reduction for fast solution of the forward model. Based on the local uncertainty quantification, optimal design of experiments is performed in order to minimize the uncertainty in the time of death estimate for a given number of measurements. For reasons of practicability, temperature acquisition points are selected from a set of candidates in different spatial and temporal locations. Applied to a real corpse model, a significant accuracy improvement is obtained already with a small number of measurements. T3 - ZIB-Report - 18-08 Y1 - 2018 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-67247 SN - 1438-0064 ER - TY - JOUR A1 - Moldenhauer, Marian A1 - Weiser, Martin A1 - Zachow, Stefan T1 - Adaptive Algorithms for Optimal Hip Implant Positioning JF - PAMM N2 - In an aging society where the number of joint replacements rises, it is important to also increase the longevity of implants. In particular hip implants have a lifetime of at most 15 years. This derives primarily from pain due to implant migration, wear, inflammation, and dislocation, which is affected by the positioning of the implant during the surgery. Current joint replacement practice uses 2D software tools and relies on the experience of surgeons. Especially the 2D tools fail to take the patients’ natural range of motion as well as stress distribution in the 3D joint induced by different daily motions into account. Optimizing the hip joint implant position for all possible parametrized motions under the constraint of a contact problem is prohibitively expensive as there are too many motions and every position change demands a recalculation of the contact problem. For the reduction of the computational effort, we use adaptive refinement on the parameter domain coupled with the interpolation method of Kriging. A coarse initial grid is to be locally refined using goal-oriented error estimation, reducing locally high variances. This approach will be combined with multi-grid optimization such that numerical errors are reduced. Y1 - 2017 U6 - https://doi.org/10.1002/pamm.201710071 VL - 17 IS - 1 SP - 203 EP - 204 ER - TY - JOUR A1 - Tierney, Nicholas J. A1 - Mira, Antonietta A1 - Reinhold, J. Jost A1 - Weiser, Martin A1 - Burkart, Roman A1 - Benvenuti, Claudio A1 - Auricchio, Angelo T1 - Novel relocation methods for automatic external defibrillator improve out-of-hospital cardiac arrest coverage under limited resources JF - Resuscitation N2 - Background Mathematical optimisation models have recently been applied to identify ideal Automatic External Defibrillator (AED) locations that maximise coverage of Out of Hospital Cardiac Arrest (OHCA). However, these fixed location models cannot relocate existing AEDs in a flexible way, and have nearly exclusively been applied to urban regions. We developed a flexible location model for AEDs, compared its performance to existing fixed location and population models, and explored how these perform across urban and rural regions. Methods Optimisation techniques were applied to AED deployment and OHCA coverage was assessed. A total of 2802 geolocated OHCAs occurred in Canton Ticino, Switzerland, from January 1st 2005 to December 31st 2015. Results There were 719 AEDs in Canton Ticino. 635 (23%) OHCA events occurred within 100m of an AED, with 306 (31%) in urban, and 329 (18%) in rural areas. Median distance from OHCA events to the nearest AED was 224m (168m urban vs. 269m rural). Flexible location models performed better than fixed location and population models, with the cost to deploy 20 new AEDs instead relocating 171 existing AEDs to new locations, improving OHCA coverage to 38%, compared to 26% using fixed models, and 24% with the population based model. Conclusions Optimisation models for AEDs placement are superior to population models and should be strongly considered by communities when selecting areas for AED deployment. Compared to other models, flexible location models increase overall OHCA coverage, and decreases the distance to nearby AEDs, even in rural areas, while saving significant financial resources. Y1 - 2018 U6 - https://doi.org/10.1016/j.resuscitation.2018.01.055 IS - 125 SP - 83 EP - 89 ER - TY - JOUR A1 - Weiser, Martin A1 - Erdmann, Bodo A1 - Schenkl, Sebastian A1 - Muggenthaler, Holger A1 - Hubig, Michael A1 - Mall, Gita A1 - Zachow, Stefan T1 - Uncertainty in Temperature-Based Determination of Time of Death JF - Heat and Mass Transfer N2 - Temperature-based estimation of time of death (ToD) can be per- formed either with the help of simple phenomenological models of corpse cooling or with detailed mechanistic (thermodynamic) heat transfer mod- els. The latter are much more complex, but allow a higher accuracy of ToD estimation as in principle all relevant cooling mechanisms can be taken into account. The potentially higher accuracy depends on the accuracy of tissue and environmental parameters as well as on the geometric resolution. We in- vestigate the impact of parameter variations and geometry representation on the estimated ToD based on a highly detailed 3D corpse model, that has been segmented and geometrically reconstructed from a computed to- mography (CT) data set, differentiating various organs and tissue types. Y1 - 2018 U6 - https://doi.org/10.1007/s00231-018-2324-4 VL - 54 IS - 9 SP - 2815 EP - 2826 PB - Springer ER - TY - GEN A1 - Özel, M. Neset A1 - Kulkarni, Abhishek A1 - Hasan, Amr A1 - Brummer, Josephine A1 - Moldenhauer, Marian A1 - Daumann, Ilsa-Maria A1 - Wolfenberg, Heike A1 - Dercksen, Vincent J. A1 - Kiral, F. Ridvan A1 - Weiser, Martin A1 - Prohaska, Steffen A1 - von Kleist, Max A1 - Hiesinger, Peter Robin T1 - Serial synapse formation through filopodial competition for synaptic seeding factors N2 - Following axon pathfinding, growth cones transition from stochastic filopodial exploration to the formation of a limited number of synapses. How the interplay of filopodia and synapse assembly ensures robust connectivity in the brain has remained a challenging problem. Here, we developed a new 4D analysis method for filopodial dynamics and a data-driven computational model of synapse formation for R7 photoreceptor axons in developing Drosophila brains. Our live data support a 'serial synapse formation' model, where at any time point only a single 'synaptogenic' filopodium suppresses the synaptic competence of other filopodia through competition for synaptic seeding factors. Loss of the synaptic seeding factors Syd-1 and Liprin-α leads to a loss of this suppression, filopodial destabilization and reduced synapse formation, which is sufficient to cause the destabilization of entire axon terminals. Our model provides a filopodial 'winner-takes-all' mechanism that ensures the formation of an appropriate number of synapses. T3 - ZIB-Report - 19-45 KW - filopodia KW - growth cone dynamics KW - brain wiring KW - 2-photon microscopy KW - model Y1 - 2019 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-74397 SN - 1438-0064 ER - TY - GEN A1 - Götschel, Sebastian A1 - Weiser, Martin T1 - Lossy Compression for Large Scale PDE Problems N2 - Solvers for partial differential equations (PDE) are one of the cornerstones of computational science. For large problems, they involve huge amounts of data that needs to be stored and transmitted on all levels of the memory hierarchy. Often, bandwidth is the limiting factor due to relatively small arithmetic intensity, and increasingly so due to the growing disparity between computing power and bandwidth. Consequently, data compression techniques have been investigated and tailored towards the specific requirements of PDE solvers during the last decades. This paper surveys data compression challenges and corresponding solution approaches for PDE problems, covering all levels of the memory hierarchy from mass storage up to main memory. Exemplarily, we illustrate concepts at particular methods, and give references to alternatives. T3 - ZIB-Report - 19-32 KW - partial differential equation KW - data compression KW - floating point compression KW - lossy compression Y1 - 2019 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-73817 SN - 1438-0064 ER - TY - GEN A1 - Götschel, Sebastian A1 - Schiela, Anton A1 - Weiser, Martin T1 - Kaskade 7 -- a Flexible Finite Element Toolbox N2 - Kaskade 7 is a finite element toolbox for the solution of stationary or transient systems of partial differential equations, aimed at supporting application-oriented research in numerical analysis and scientific computing. The library is written in C++ and is based on the Dune interface. The code is independent of spatial dimension and works with different grid managers. An important feature is the mix-and-match approach to discretizing systems of PDEs with different ansatz and test spaces for all variables. We describe the mathematical concepts behind the library as well as its structure, illustrating its use at several examples on the way. T3 - ZIB-Report - 19-48 KW - finite elements KW - generic programming KW - partial differential equations Y1 - 2019 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-74616 SN - 1438-0064 ER - TY - JOUR A1 - Schneck, Jakob A1 - Weiser, Martin A1 - Wende, Florian T1 - Impact of mixed precision and storage layout on additive Schwarz smoothers JF - Numerical Linear Algebra with Applications N2 - The growing discrepancy between CPU computing power and memory bandwidth drives more and more numerical algorithms into a bandwidth-bound regime. One example is the overlapping Schwarz smoother, a highly effective building block for iterative multigrid solution of elliptic equations with higher order finite elements. Two options of reducing the required memory bandwidth are sparsity exploiting storage layouts and representing matrix entries with reduced precision in floating point or fixed point format. We investigate the impact of several options on storage demand and contraction rate, both analytically in the context of subspace correction methods and numerically at an example of solid mechanics. Both perspectives agree on the favourite scheme: fixed point representation of Cholesky factors in nested dissection storage. Y1 - 2021 U6 - https://doi.org/10.1002/nla.2366 VL - 28 IS - 4 ER - TY - GEN A1 - Deuflhard, Peter A1 - Weiser, Martin T1 - Local Inexact Newton Multilevel FEM for Nonlinear Elliptic Problems N2 - The finite element setting for nonlinear elliptic PDEs directly leads to the minimization of convex functionals. Uniform ellipticity of the underlying PDE shows up as strict convexity of the arising nonlinear functional. The paper analyzes computational variants of Newton's method for convex optimization in an affine conjugate setting, which reflects the appropriate affine transformation behavior for this class of problems. First, an affine conjugate Newton--Mysovskikh type theorem on the local quadratic convergence of the exact Newton method in Hilbert spaces is given. It can be easily extended to inexact Newton methods, where the inner iteration is only approximately solved. For fixed finite dimension, a special implementation of a Newton--PCG algorithm is worked out. In this case, the suggested monitor for the inner iteration guarantees quadratic convergence of the outer iteration. In infinite dimensional problems, the PCG method may be just formally replaced by any Galerkin method such as FEM for linear elliptic problems. Instead of the algebraic inner iteration errors we now have to control the FE discretization errors, which is a standard task performed within any adaptive multilevel method. A careful study of the information gain per computational effort leads to the result that the quadratic convergence mode of the Newton--Galerkin algorithm is the best mode for the fixed dimensional case, whereas for an adaptive variable dimensional code a special linear convergence mode of the algorithm is definitely preferable. The theoretical results are then illustrated by numerical experiments with a {\sf NEWTON--KASKADE} algorithm. T3 - ZIB-Report - SC-96-29 Y1 - 1996 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-2401 ER - TY - GEN A1 - Deuflhard, Peter A1 - Weiser, Martin T1 - Global Inexact Multilevel FEM for Nonlinear Elliptic Problems N2 - The paper deals with the multilevel solution of {\em elliptic} partial differential equations (PDEs) in a {\em finite element} setting: {\em uniform ellipticity} of the PDE then goes with {\em strict monotonicity} of the derivative of a nonlinear convex functional. A {\em Newton multigrid method} is advocated, wherein {\em linear residuals} are evaluated within the multigrid method for the computation of the Newton corrections. The globalization is performed by some {\em damping} of the ordinary Newton corrections. The convergence results and the algorithm may be regarded as an extension of those for local Newton methods presented recently by the authors. An {\em affine conjugate} global convergence theory is given, which covers both the {\em exact} Newton method (neglecting the occurrence of approximation errors) and {\em inexact} Newton--Galerkin methods addressing the crucial issue of accuracy matching between discretization and iteration errors. The obtained theoretical results are directly applied for the construction of adaptive algorithms. Finally, illustrative numerical experiments with a~{\sf NEWTON--KASKADE} code are documented. T3 - ZIB-Report - SC-96-33 Y1 - 1996 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-2430 ER - TY - GEN A1 - Weiser, Martin T1 - Interior Point Methods in Function Space N2 - A primal-dual interior point method for optimal control problems is considered. The algorithm is directly applied to the infinite dimensional problem. Existence and convergence of the central path are analyzed, and linear convergence of a short step pathfollowing method is established. T3 - ZIB-Report - 03-35 KW - interior point methods in function space KW - optimal control KW - complementarity functions Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7578 ER - TY - GEN A1 - Weiser, Martin A1 - Schiela, Anton A1 - Deuflhard, Peter T1 - Asymptotic Mesh Independence of Newton's Method Revisited N2 - The paper presents a new affine invariant theory on asymptotic mesh independence of Newton's method in nonlinear PDEs. Compared to earlier attempts, the new approach is both much simpler and more natural from the algorithmic point of view. The theory is exemplified at collocation methods for ODE boundary value problems and at finite element methods for elliptic PDE problems. T3 - ZIB-Report - 03-13 KW - mesh independence KW - nonlinear partial differential equations KW - Newton method KW - finite element method KW - collocation method Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7352 ER - TY - GEN A1 - Horenko, Illia A1 - Weiser, Martin T1 - Adaptive Integration of Multidimensional Molecular Dynamics with Quantum Initial Conditions N2 - The paper presents a particle method framework for resolving molecular dynamics. Error estimators for both the temporal and spatial discretization are advocated and facilitate a fully adaptive propagation. For time integration, the implicit trapezoidal rule is employed, where an explicit predictor enables large time steps. The framework is developed and exemplified in the context of the classical Liouville equation, where Gaussian phase-space packets are used as particles. Simplified variants are discussed shortly, which should prove to be easily implementable in common molecular dynamics codes. A concept is illustrated by numerical examples for one-dimensional dynamics in double well potential. T3 - ZIB-Report - 02-29 KW - particle methods KW - adaptivity KW - classical Liouville equation KW - molecular dynamics Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6967 ER - TY - GEN A1 - Deuflhard, Peter A1 - Nowak, Ulrich A1 - Weiser, Martin T1 - Affine Invariant Adaptive Newton Codes for Discretized PDEs N2 - The paper deals with three different Newton algorithms that have recently been worked out in the general frame of affine invariance. Of particular interest is their performance in the numerical solution of discretized boundary value problems (BVPs) for nonlinear partial differential equations (PDEs). Exact Newton methods, where the arising linear systems are solved by direct elimination, and inexact Newton methods, where an inner iteration is used instead, are synoptically presented, both in affine invariant convergence theory and in numerical experiments. The three types of algorithms are: (a) affine covariant (formerly just called affine invariant) Newton algorithms, oriented toward the iterative errors, (b) affine contravariant Newton algorithms, based on iterative residual norms, and (c) affine conjugate Newton algorithms for convex optimization problems and discrete nonlinear elliptic PDEs. T3 - ZIB-Report - 02-33 KW - Affine invariant Newton methods KW - global Newton methods KW - inexact Newton methods KW - adaptive trust region methods KW - nonlinear partial differential equa Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7005 ER - TY - GEN A1 - Powell, Gary A1 - Weiser, Martin T1 - Container Adaptors N2 - The C++ standard template library has many useful containers for data. The standard library includes two adpators, queue, and stack. The authors have extended this model along the lines of relational database semantics. Sometimes the analogy is striking, and we will point it out occasionally. An adaptor allows the standard algorithms to be used on a subset or modification of the data without having to copy the data elements into a new container. The authors provide many useful adaptors which can be used together to produce interesting views of data in a container. T3 - ZIB-Report - SC-99-41 KW - C++ KW - STL KW - views Y1 - 1999 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-4308 ER - TY - GEN A1 - Schiela, Anton A1 - Weiser, Martin T1 - Superlinear Convergence of the Control Reduced Interior Point Method for PDE Constrained Optimization N2 - A thorough convergence analysis of the Control Reduced Interior Point Method in function space is performed. This recently proposed method is a primal interior point pathfollowing scheme with the special feature, that the control variable is eliminated from the optimality system. Apart from global linear convergence we show, that this method converges locally almost quadratically, if the optimal solution satisfies a function space analogue to a non-degeneracy condition. In numerical experiments we observe, that a prototype implementation of our method behaves in compliance with our theoretical results. T3 - ZIB-Report - 05-15 KW - interior point methods in function space KW - optimal control KW - superlinear convergence Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8490 ER - TY - GEN A1 - Weiser, Martin A1 - Schiela, Anton T1 - Function space interior point methods for PDE constrained optimization N2 - A primal-dual interior point method for optimal control problems with PDE constraints is considered. The algorithm is directly applied to the infinite dimensional problem. Existence and convergence of the central path are analyzed. Numerical results from an inexact continuation method applied to a model problem are shown. T3 - ZIB-Report - 04-27 KW - interior point methods in function space KW - optimal control KW - complementarity functions Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8027 ER - TY - JOUR A1 - Schenk, O. A1 - Wächter, Andreas A1 - Weiser, Martin T1 - Inertia Revealing Preconditioning For Large-Scale Nonconvex Constrained Optimization JF - SIAM J. Sci. Comp. Y1 - 2008 VL - 31 IS - 2 SP - 939 EP - 960 ER - TY - JOUR A1 - Weiser, Martin A1 - Deuflhard, Peter T1 - Inexact central path following algorithms for optimal control problems JF - SIAM J. Control Opt. Y1 - 2007 VL - 46 IS - 3 SP - 792 EP - 815 ER - TY - CHAP A1 - Deuflhard, Peter A1 - Weiser, Martin ED - et al. Bristeau, M.-O. T1 - Local inexact Newton multilevel FEM for nonlinear elliptic problems T2 - Computational science for the 21st century Y1 - 1997 SP - 129 EP - 138 PB - Chichester: John Wiley & Sons. ER - TY - CHAP A1 - Deuflhard, Peter A1 - Weiser, Martin ED - et al. Hackbusch, Wolfgang T1 - Global inexact Newton multilevel FEM for nonlinear elliptic problems T2 - Multigrid methods V. proceedings of the 5th European multigrid conference, held in Stuttgart, Germany, October 1–4, 1996. Y1 - 1998 VL - 3 SP - 71 EP - 89 PB - Berlin: Springer ER - TY - BOOK A1 - Deuflhard, Peter A1 - Weiser, Martin T1 - Numerische Mathematik 3 Y1 - 2011 PB - de Gruyter, Berlin ER - TY - BOOK A1 - Deuflhard, Peter A1 - Weiser, Martin T1 - Adaptive numerical solution of PDEs Y1 - 2012 PB - de Gruyter CY - Berlin ER - TY - JOUR A1 - Deuflhard, Peter A1 - Weiser, Martin A1 - Zachow, Stefan T1 - Mathematics in Facial Surgery JF - AMS Notices Y1 - 2006 VL - 53 IS - 9 SP - 1012 EP - 1016 ER - TY - JOUR A1 - Weiser, Martin A1 - Zachow, Stefan A1 - Deuflhard, Peter T1 - Craniofacial Surgery Planning Based on Virtual Patient Models JF - it - Information Technology Y1 - 2010 U6 - https://doi.org/10.1524/itit.2010.0600 VL - 52 IS - 5 SP - 258 EP - 263 PB - Oldenbourg Verlagsgruppe ER - TY - CHAP A1 - Weiser, Martin A1 - Scacchi, Simone T1 - Spectral Deferred Correction methods for adaptive electro-mechanical coupling in cardiac simulation T2 - G. Russo et al.(eds.) Progress in Industrial Mathematics at ECMI 2014 N2 - We investigate spectral deferred correction (SDC) methods for time stepping and their interplay with spatio-temporal adaptivity, applied to the solution of the cardiac electro-mechanical coupling model. This model consists of the Monodomain equations, a reaction-diffusion system modeling the cardiac bioelectrical activity, coupled with a quasi-static mechanical model describing the contraction and relaxation of the cardiac muscle. The numerical approximation of the cardiac electro-mechanical coupling is a challenging multiphysics problem, because it exhibits very different spatial and temporal scales. Therefore, spatio-temporal adaptivity is a promising approach to reduce the computational complexity. SDC methods are simple iterative methods for solving collocation systems. We exploit their flexibility for combining them in various ways with spatio-temporal adaptivity. The accuracy and computational complexity of the resulting methods are studied on some numerical examples. Y1 - 2017 U6 - https://doi.org/10.1007/978-3-319-23413-7_42 SP - 321 EP - 328 PB - Springer ER - TY - GEN A1 - Lubkoll, Lars A1 - Schiela, Anton A1 - Weiser, Martin T1 - An affine covariant composite step method for optimization with PDEs as equality constraints N2 - We propose a composite step method, designed for equality constrained optimization with partial differential equations. Focus is laid on the construction of a globalization scheme, which is based on cubic regularization of the objective and an affine covariant damped Newton method for feasibility. We show finite termination of the inner loop and fast local convergence of the algorithm. We discuss preconditioning strategies for the iterative solution of the arising linear systems with projected conjugate gradient. Numerical results are shown for optimal control problems subject to a nonlinear heat equation and subject to nonlinear elastic equations arising from an implant design problem in craniofacial surgery. T3 - ZIB-Report - 15-09 KW - composite step methods KW - cubic regularization KW - affine covariant KW - optimization with PDEs Y1 - 2015 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-53954 SN - 1438-0064 ER - TY - GEN A1 - Weiser, Martin A1 - Ghosh, Sunayana T1 - Theoretically optimal inexact SDC methods N2 - In several inital value problems with particularly expensive right hand side computation, there is a trade-off between accuracy and computational effort in evaluating the right hand sides. We consider inexact spectral deferred correction (SDC) methods for solving such non-stiff initial value problems. SDC methods are interpreted as fixed point iterations and, due to their corrective iterative nature, allow to exploit the accuracy-work-tradeoff for a reduction of the total computational effort. On one hand we derive an error model bounding the total error in terms of the right hand side evaluation errors. On the other hand, we define work models describing the computational effort in terms of the evaluation accuracy. Combining both, a theoretically optimal tolerance selection is worked out by minimizing the total work subject to achieving the requested tolerance. T3 - ZIB-Report - 16-52 KW - Spectral deferred correction, initial value problems, error propagation, adaptive control of tolerances Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-53140 SN - 1438-0064 ER - TY - CHAP A1 - Sagnol, Guillaume A1 - Hege, Hans-Christian A1 - Weiser, Martin T1 - Using sparse kernels to design computer experiments with tunable precision T2 - 22nd Intern. Conf. on Computational Statistics - COMPSTAT 2016, Oviedo, Spain, 23-26 August 2016, Proceedings ISBN 978-90-73592-36-0 Y1 - 2016 SP - 397 EP - 408 ER - TY - CHAP A1 - Götschel, Sebastian A1 - Höhne, Christian A1 - Kolkoori, Sanjeevareddy A1 - Mitzscherling, Steffen A1 - Prager, Jens A1 - Weiser, Martin T1 - Ray Tracing Boundary Value Problems: Simulation and SAFT Reconstruction for Ultrasonic Testing T2 - Proceedings 19th World Conference on Non-Destructive Testing (WCNDT 2016) Y1 - 2016 UR - https://www.wcndt2016.com/portals/wcndt/bb/Fr1H4.pdf ER - TY - CHAP A1 - Götschel, Sebastian A1 - Maierhofer, Christiane A1 - Müller, Jan A1 - Rothbart, Nick A1 - Weiser, Martin T1 - Quantitative Defect Reconstruction in Active Thermography for Fiber-Reinforced Composites T2 - Proceedings 19th World Conference on Non-Destructive Testing (WCNDT 2016) Y1 - 2016 UR - https://www.wcndt2016.com/portals/wcndt/bb/Th4C4.pdf ER - TY - CHAP A1 - Müller, Jan A1 - Götschel, Sebastian A1 - Maierhofer, Christiane A1 - Weiser, Martin T1 - Determining the material parameters for the reconstruction of defects in carbon fiber reinforced polymers from data measured by flash thermography T2 - AIP Conference Proceedings Y1 - 2017 U6 - https://doi.org/10.1063/1.4974671 VL - 1806 ER - TY - GEN A1 - Fischer, Lisa A1 - Götschel, Sebastian A1 - Weiser, Martin T1 - Lossy data compression reduces communication time in hybrid time-parallel integrators N2 - Parallel in time methods for solving initial value problems are a means to increase the parallelism of numerical simulations. Hybrid parareal schemes interleaving the parallel in time iteration with an iterative solution of the individual time steps are among the most efficient methods for general nonlinear problems. Despite the hiding of communication time behind computation, communication has in certain situations a significant impact on the total runtime. Here we present strict, yet no sharp, error bounds for hybrid parareal methods with inexact communication due to lossy data compression, and derive theoretical estimates of the impact of compression on parallel efficiency of the algorithms. These and some computational experiments suggest that compression is a viable method to make hybrid parareal schemes robust with respect to low bandwidth setups. T3 - ZIB-Report - 17-25 KW - parallel-in-time integration KW - hybrid parareal KW - convergence KW - lossy compression KW - MPI Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-63961 SN - 1438-0064 ER - TY - GEN A1 - Weiser, Martin A1 - Erdmann, Bodo A1 - Schenkl, Sebastian A1 - Muggenthaler, Holger A1 - Hubig, Michael A1 - Mall, Gita A1 - Zachow, Stefan T1 - Uncertainty in Temperature-Based Determination of Time of Death N2 - Temperature-based estimation of time of death (ToD) can be per- formed either with the help of simple phenomenological models of corpse cooling or with detailed mechanistic (thermodynamic) heat transfer mod- els. The latter are much more complex, but allow a higher accuracy of ToD estimation as in principle all relevant cooling mechanisms can be taken into account. The potentially higher accuracy depends on the accuracy of tissue and environmental parameters as well as on the geometric resolution. We in- vestigate the impact of parameter variations and geometry representation on the estimated ToD based on a highly detailed 3D corpse model, that has been segmented and geometrically reconstructed from a computed to- mography (CT) data set, differentiating various organs and tissue types. From that we identify the most crucial parameters to measure or estimate, and obtain a local uncertainty quantifcation for the ToD. T3 - ZIB-Report - 17-18 KW - forensic medicine KW - determination of time of death KW - heat transfer equation KW - sensitivity i.r.t. thermal parameters KW - sensitivity i.r.t. geometric resolution Y1 - 2017 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-63818 SN - 1438-0064 ER - TY - JOUR A1 - Fischer, Lisa A1 - Götschel, Sebastian A1 - Weiser, Martin T1 - Lossy data compression reduces communication time in hybrid time-parallel integrators JF - Comput. Vis. Sci. N2 - Parallel in time methods for solving initial value problems are a means to increase the parallelism of numerical simulations. Hybrid parareal schemes interleaving the parallel in time iteration with an iterative solution of the individual time steps are among the most efficient methods for general nonlinear problems. Despite the hiding of communication time behind computation, communication has in certain situations a significant impact on the total runtime. Here we present strict, yet no sharp, error bounds for hybrid parareal methods with inexact communication due to lossy data compression, and derive theoretical estimates of the impact of compression on parallel efficiency of the algorithms. These and some computational experiments suggest that compression is a viable method to make hybrid parareal schemes robust with respect to low bandwidth setups. Y1 - 2018 U6 - https://doi.org/10.1007/s00791-018-0293-2 VL - 19 IS - 1 SP - 19 EP - 30 ER - TY - GEN A1 - Weiser, Martin A1 - Scacchi, Simone T1 - Spectral Deferred Correction methods for adaptive electro-mechanical coupling in cardiac simulation N2 - We investigate spectral deferred correction (SDC) methods for time stepping and their interplay with spatio-temporal adaptivity, applied to the solution of the cardiac electro-mechanical coupling model. This model consists of the Monodomain equations, a reaction-diffusion system modeling the cardiac bioelectrical activity, coupled with a quasi-static mechanical model describing the contraction and relaxation of the cardiac muscle. The numerical approximation of the cardiac electro-mechanical coupling is a challenging multiphysics problem, because it exhibits very different spatial and temporal scales. Therefore, spatio-temporal adaptivity is a promising approach to reduce the computational complexity. SDC methods are simple iterative methods for solving collocation systems. We exploit their flexibility for combining them in various ways with spatio-temporal adaptivity. The accuracy and computational complexity of the resulting methods are studied on some numerical examples. T3 - ZIB-Report - 14-22 Y1 - 2014 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-50695 SN - 1438-0064 ER - TY - GEN A1 - Deuflhard, Peter A1 - Kornhuber, Ralf A1 - Sander, Oliver A1 - Schiela, Anton A1 - Weiser, Martin ED - Deuflhard, Peter ED - Grötschel, Martin ED - Hömberg, Dietmar ED - Horst, Ulrich ED - Kramer, Jürg ED - Mehrmann, Volker ED - Polthier, Konrad ED - Schmidt, Frank ED - Schütte, Christof ED - Skutella, Martin ED - Sprekels, Jürgen T1 - Mathematics cures virtual patients T2 - MATHEON-Mathematics for Key Technologies Y1 - 2014 VL - 1 SP - 7 EP - 25 PB - European Mathematical Society ER - TY - JOUR A1 - Moualeu-Ngangue, Dany Pascal A1 - Weiser, Martin A1 - Ehrig, Rainald A1 - Deuflhard, Peter T1 - Optimal control for a tuberculosis model with undetected cases in Cameroon JF - Communications in Nonlinear Science and Numerical Simulation N2 - This paper considers the optimal control of tuberculosis through education, diagnosis campaign and chemoprophylaxis of latently infected. A mathematical model which includes important components such as undiagnosed infectious, diagnosed infectious, latently infected and lost-sight infectious is formulated. The model combines a frequency dependent and a density dependent force of infection for TB transmission. Through optimal control theory and numerical simulations, a cost-effective balance of two different intervention methods is obtained. Seeking to minimize the amount of money the government spends when tuberculosis remain endemic in the Cameroonian population, Pontryagin's maximum principle is used to characterize the optimal control. The optimality system is derived and solved numerically using the forward-backward sweep method (FBSM). Results provide a framework for designing cost-effective strategies for diseases with multiple intervention methods. It comes out that combining chemoprophylaxis and education, the burden of TB can be reduced by 80 % in 10 years. Y1 - 2015 U6 - https://doi.org/10.1016/j.cnsns.2014.06.037 VL - 20 IS - 3 SP - 986 EP - 1003 ER - TY - GEN A1 - Götschel, Sebastian A1 - Weiser, Martin A1 - Maierhofer, Christiane A1 - Richter, Regina ED - Cardone, Gennaro T1 - Data Enhancement for Active Thermography T2 - E-book Proceedings, 11th International Conference on Quantitative Infrared Thermography, Naples N2 - Pulse thermography is a non-destructive testing method based on infrared imaging of transient thermal patterns. Heating the surface of the structure under test for a short period of time generates a non-stationary temperature distribution and thus a thermal contrast between the defect and the sound material. Due to measurement noise, preprocessing of the experimental data is necessary, before reconstruction algorithms can be applied. We propose a decomposition of the measured temperature into Green's function solutions to eliminate noise. Y1 - 2012 ER - TY - JOUR A1 - Weiser, Martin T1 - On goal-oriented adaptivity for elliptic optimal control problems JF - Opt. Meth. Softw. N2 - The paper proposes goal-oriented error estimation and mesh refinement for optimal control problems with elliptic PDE constraints using the value of the reduced cost functional as quantity of interest. Error representation, hierarchical error estimators, and greedy-style error indicators are derived and compared to their counterparts when using the all-at-once cost functional as quantity of interest. Finally, the efficiency of the error estimator and generated meshes are demonstrated on numerical examples. Y1 - 2013 VL - 28 IS - 13 SP - 969 EP - 992 ER - TY - JOUR A1 - Deuflhard, Peter A1 - Schiela, Anton A1 - Weiser, Martin T1 - Mathematical Cancer Therapy Planning in Deep Regional Hyperthermia JF - Acta Numerica N2 - This paper surveys the required mathematics for a typical challenging problem from computational medicine, the cancer therapy planning in deep regional hyperthermia. In the course of many years of close cooperation with clinics, the medical problem gave rise to quite a number of subtle mathematical problems, part of which had been unsolved when the common project started. Efficiency of numerical algorithms, i.e. computational speed and monitored reliability, play a decisive role for the medical treatment. Off-the-shelf software had turned out to be not sufficient to meet the requirements of medicine. Rather, new mathematical theory as well as new numerical algorithms had to be developed. In order to make our algorithms useful in the clinical environment, new visualization software, a virtual lab, including 3D geometry processing of individual virtual patients had to be designed and implemented. Moreover, before the problems could be attacked by numerical algorithms, careful mathematical modelling had to be done. Finally, parameter identification and constrained optimization for the PDEs had to be newly analyzed and realized over the individual patient's geometry. Our new techniques had an impact on the specificity of the individual patients' treatment and on the construction of an improved hyperthermia applicator. Y1 - 2012 VL - 21 SP - 307 EP - 378 ER - TY - GEN A1 - Götschel, Sebastian A1 - Weiser, Martin A1 - Schiela, Anton ED - Dedner, A. ED - Flemisch, B. ED - Klöfkorn, R. T1 - Solving Optimal Control Problems with the Kaskade 7 Finite Element Toolbox T2 - Advances in DUNE N2 - This paper presents concepts and implementation of the finite element toolbox Kaskade 7, a flexible C++ code for solving elliptic and parabolic PDE systems. Issues such as problem formulation, assembly and adaptivity are discussed at the example of optimal control problems. Trajectory compression for parabolic optimization problems is considered as a case study. Y1 - 2012 SP - 101 EP - 112 PB - Springer ER - TY - JOUR A1 - Weiser, Martin T1 - Faster SDC convergence on non-equidistant grids by DIRK sweeps JF - BIT Numerical Mathematics N2 - Spectral deferred correction methods for solving stiff ODEs are known to converge rapidly towards the collocation limit solution on equidistant grids, but show a much less favourable contraction on non-equidistant grids such as Radau-IIa points. We interprete SDC methods as fixed point iterations for the collocation system and propose new DIRK-type sweeps for stiff problems based on purely linear algebraic considerations. Good convergence is recovered also on non-equidistant grids. The properties of different variants are explored on a couple of numerical examples. Y1 - 2015 U6 - https://doi.org/10.1007/s10543-014-0540-y VL - 55 IS - 4 SP - 1219 EP - 1241 ER - TY - JOUR A1 - Weiser, Martin A1 - Götschel, Sebastian T1 - State Trajectory Compression for Optimal Control with Parabolic PDEs JF - SIAM J. Sci. Comput. N2 - In optimal control problems with nonlinear time-dependent 3D PDEs, full 4D discretizations are usually prohibitive due to the storage requirement. For this reason gradient and quasi-Newton methods working on the reduced functional are often employed. The computation of the reduced gradient requires one solve of the state equation forward in time, and one backward solve of the adjoint equation. The state enters into the adjoint equation, again requiring the storage of a full 4D data set. We propose a lossy compression algorithm using an inexact but cheap predictor for the state data, with additional entropy coding of prediction errors. As the data is used inside a discretized, iterative algorithm, lossy coding maintaining an error bound is sufficient. Y1 - 2012 U6 - https://doi.org/10.1137/11082172X VL - 34 IS - 1 SP - A161 EP - A184 ER - TY - GEN A1 - Nadobny, Johanna A1 - Weihrauch, Mirko A1 - Weiser, Martin A1 - Gellermann, Johanna A1 - Wlodarczyk, Waldemar A1 - Budach, Volker A1 - Wust, Peter T1 - Advances in the Planning and Control of the MR-guided Regional Hyperthermia Applications T2 - Proc. Int. Conf. Electromagnetics in Advanced Applications, ICEAA 2007, Torino, Italy Y1 - 2007 SP - 1010 EP - 1013 ER - TY - JOUR A1 - Götschel, Sebastian A1 - Weiser, Martin T1 - State Trajectory Compression in Optimal Control JF - PAMM N2 - In optimal control problems with nonlinear time-dependent 3D PDEs, the computation of the reduced gradient by adjoint methods requires one solve of the state equation forward in time, and one backward solve of the adjoint equation. Since the state enters into the adjoint equation, the storage of a 4D discretization is necessary. We propose a lossy compression algorithm using a cheap predictor for the state data, with additional entropy coding of prediction errors. Analytical and numerical results indicate that compression factors around 30 can be obtained without exceeding the FE discretization error. Y1 - 2010 U6 - https://doi.org/10.1002/pamm.201010282 VL - 10 IS - 1 SP - 579 EP - 580 ER - TY - GEN A1 - Weiser, Martin T1 - Delayed Residual Compensation for Bidomain Equations T2 - AIP Conference Proceedings N2 - The biodomain model of cardioelectric excitation consists of a reaction‐diffusion equation, an elliptic algebraic constraint, and a set of pointwise ODEs. Fast reaction enforces small time steps, such that for common mesh sizes the reaction‐diffusion equation is easily solved implicitly due to a dominating mass matrix. In contrast, the elliptic constraint does not benefit from small time steps and requires a comparably expensive solution. We propose a delayed residual compensation that improves the solution of the elliptic constraint and thus alleviates the need for long iteration times. Y1 - 2010 U6 - https://doi.org/10.1063/1.3498495 VL - 1281 SP - 419 EP - 422 ER - TY - GEN A1 - Weiser, Martin A1 - Erdmann, Bodo A1 - Deuflhard, Peter ED - Wilson, E. ED - Fitt, A. ED - Ockendon, H. ED - Norbury, J. T1 - On Efficiency and Accuracy in Cardioelectric Simulation T2 - Progress in Industrial Mathematics at ECMI 2008 N2 - Reasons for the failure of adaptive methods to deliver improved efficiency when integrating monodomain models for myocardiac excitation are discussed. Two closely related techniques for reducing the computational complexity of linearly implicit integrators, deliberate sparsing and splitting, are investigated with respect to their impact on computing time and accuracy. Y1 - 2010 SP - 371 EP - 376 PB - Springer ER - TY - JOUR A1 - Wilhelms, Mathias A1 - Seemann, Gunnar A1 - Weiser, Martin A1 - Dössel, Olaf T1 - Benchmarking Solvers of the Monodomain Equation in Cardiac Electrophysiological Modeling JF - Biomed. Engineer. Y1 - 2010 U6 - https://doi.org/10.1515/BMT.2010.712 VL - 55 SP - 99 EP - 102 ER - TY - GEN A1 - Wust, Peter A1 - Weihrauch, Mirko A1 - Weiser, Martin A1 - Gellermann, Johanna A1 - Eisenhardt, Steffen A1 - Chobrok, Thorsten A1 - Budach, Volker ED - Dössel, O. ED - Schlegel, W. ED - Magjarevic, R. T1 - Optimization of clinical radiofrequency hyperthermia by use of MR-thermography in a hybrid system T2 - World Congress on Medical Physics and Biomedical Engineering, September 2009, Munich, Germany Y1 - 2010 SP - 174 EP - 175 PB - Springer ER - TY - JOUR A1 - Lubkoll, Lars A1 - Schiela, Anton A1 - Weiser, Martin T1 - An optimal control problem in polyconvex hyperelasticity JF - SIAM J. Control Opt. N2 - We consider a shape implant design problem that arises in the context of facial surgery. We introduce a reformulation as an optimal control problem, where the control acts as a boundary force. The state is modelled as a minimizer of a polyconvex hyperelastic energy functional. We show existence of optimal solutions and derive - on a formal level - first order optimality conditions. Finally, preliminary numerical results are presented. Y1 - 2014 U6 - https://doi.org/10.1137/120876629 VL - 52 IS - 3 SP - 1403 EP - 1422 ER - TY - JOUR A1 - Günther, Andreas A1 - Lamecker, Hans A1 - Weiser, Martin T1 - Flexible Shape Matching with Finite Element Based LDDMM JF - International Journal of Computer Vision N2 - We consider Large Deformation Diffeomorphic Metric Mapping of general $m$-currents. After stating an optimization algorithm in the function space of admissable morph generating velocity fields, two innovative aspects in this framework are presented and numerically investigated: First, we spatially discretize the velocity field with conforming adaptive finite elements and discuss advantages of this new approach. Second, we directly compute the temporal evolution of discrete $m$-current attributes. Y1 - 2013 U6 - https://doi.org/10.1007/s11263-012-0599-3 VL - 105 IS - 2 SP - 128 EP - 143 ER - TY - GEN A1 - Günther, Andreas A1 - Lamecker, Hans A1 - Weiser, Martin ED - Pennec, X. ED - Joshi, S. ED - Nielsen, M. T1 - Direct LDDMM of Discrete Currents with Adaptive Finite Elements T2 - Proceedings of the Third International Workshop on Mathematical Foundations of Computational Anatomy - Geometrical and Statistical Methods for Modelling Biological Shape Variability N2 - We consider Large Deformation Diffeomorphic Metric Mapping of general $m$-currents. After stating an optimization algorithm in the function space of admissable morph generating velocity fields, two innovative aspects in this framework are presented and numerically investigated: First, we spatially discretize the velocity field with conforming adaptive finite elements and discuss advantages of this new approach. Second, we directly compute the temporal evolution of discrete $m$-current attributes. Y1 - 2011 SP - 1 EP - 14 ER - TY - GEN A1 - Schiela, Anton A1 - Weiser, Martin ED - Diehl, M. ED - Glineur, F. ED - Jarlebring, E. ED - Michiels, W. T1 - Barrier methods for a control problem from hyperthermia treatment planning T2 - Recent Advances in Optimization and its Applications in Engineering (Proceedings of 14th Belgian-French-German Conference on Optimization 2009) N2 - We consider an optimal control problem from hyperthermia treatment planning and its barrier regularization. We derive basic results, which lay the groundwork for the computation of optimal solutions via an interior point path-following method. Further, we report on a numerical implementation of such a method and its performance at an example problem. Y1 - 2010 SP - 419 EP - 428 PB - Springer ER - TY - JOUR A1 - Weiser, Martin A1 - Röllig, Mathias A1 - Arndt, Ralf A1 - Erdmann, Bodo T1 - Development and test of a numerical model for pulse thermography in civil engineering JF - Heat and Mass Transfer N2 - Pulse thermography of concrete structures is used in civil engineering for detecting voids, honeycombing and delamination. The physical situation is readily modeled by Fourier's law. Despite the simplicity of the PDE structure, quantitatively realistic numerical 3D simulation faces two major obstacles. First, the short heating pulse induces a thin boundary layer at the heated surface which encapsulates all information and therefore has to be resolved faithfully. Even with adaptive mesh refinement techniques, obtaining useful accuracies requires an unsatisfactorily fine discretization. Second, bulk material parameters and boundary conditions are barely known exactly. We address both issues by a semi-analytic reformulation of the heat transport problem and by parameter identification. Numerical results are compared with measurements of test specimens. Y1 - 2010 VL - 46 IS - 11-12 SP - 1419 EP - 1428 ER - TY - JOUR A1 - Ranneberg, Maximilian A1 - Weiser, Martin A1 - Weihrauch, Mirko A1 - Budach, Volker A1 - Gellermann, Johanna A1 - Wust, Peter T1 - Regularized Antenna Profile Adaptation in Online Hyperthermia Treatment JF - Medical Physics Y1 - 2010 U6 - https://doi.org/10.1118/1.3488896 VL - 37 SP - 5382 EP - 5394 ER - TY - JOUR A1 - Lubkoll, Lars A1 - Schiela, Anton A1 - Weiser, Martin T1 - An affine covariant composite step method for optimization with PDEs as equality constraints JF - Optimization Methods and Software N2 - We propose a composite step method, designed for equality constrained optimization with partial differential equations. Focus is laid on the construction of a globalization scheme, which is based on cubic regularization of the objective and an affine covariant damped Newton method for feasibility. We show finite termination of the inner loop and fast local convergence of the algorithm. We discuss preconditioning strategies for the iterative solution of the arising linear systems with projected conjugate gradient. Numerical results are shown for optimal control problems subject to a nonlinear heat equation and subject to nonlinear elastic equations arising from an implant design problem in craniofacial surgery. Y1 - 2017 U6 - https://doi.org/10.1080/10556788.2016.1241783 VL - 32 IS - 5 SP - 1132 EP - 1161 ER - TY - GEN A1 - Götschel, Sebastian A1 - Maierhofer, Christiane A1 - Müller, Jan P. A1 - Rothbart, Nick A1 - Weiser, Martin T1 - Quantitative Defect Reconstruction in Active Thermography for Fiber-Reinforced Composites N2 - Carbon-fiber reinforced composites are becoming more and more important in the production of light-weight structures, e.g., in the automotive and aerospace industry. Thermography is often used for non-destructive testing of these products, especially to detect delaminations between different layers of the composite. In this presentation, we aim at methods for defect reconstruction from thermographic measurements of such carbon-fiber reinforced composites. The reconstruction results shall not only allow to locate defects, but also give a quantitative characterization of the defect properties. We discuss the simulation of the measurement process using finite element methods, as well as the experimental validation on flat bottom holes. Especially in pulse thermography, thin boundary layers with steep temperature gradients occurring at the heated surface need to be resolved. Here we use the combination of a 1D analytical solution combined with numerical solution of the remaining defect equation. We use the simulations to identify material parameters from the measurements. Finally, fast heuristics for reconstructing defect geometries are applied to the acquired data, and compared for their accuracy and utility in detecting different defects like back surface defects or delaminations. T3 - ZIB-Report - 16-13 KW - thermography KW - inverse problems KW - parameter identification KW - geometry identification KW - nondestructive testing Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-58374 UR - https://www.wcndt2016.com/portals/wcndt/bb/Th4C4.pdf SN - 1438-0064 ER - TY - GEN A1 - Götschel, Sebastian A1 - Höhne, Christian A1 - Kolkoori, Sanjeevareddy A1 - Mitzscherling, Steffen A1 - Prager, Jens A1 - Weiser, Martin T1 - Ray Tracing Boundary Value Problems: Simulation and SAFT Reconstruction for Ultrasonic Testing N2 - The application of advanced imaging techniques for the ultrasonic inspection of inhomogeneous anisotropic materials like austenitic and dissimilar welds requires information about acoustic wave propagation through the material, in particular travel times between two points in the material. Forward ray tracing is a popular approach to determine traveling paths and arrival times but is ill suited for inverse problems since a large number of rays have to be computed in order to arrive at prescribed end points. In this contribution we discuss boundary value problems for acoustic rays, where the ray path between two given points is determined by solving the eikonal equation. The implementation of such a two point boundary value ray tracer for sound field simulations through an austenitic weld is described and its efficiency as well as the obtained results are compared to those of a forward ray tracer. The results are validated by comparison with experimental results and commercially available UT simulation tools. As an application, we discuss an implementation of the method for SAFT (Synthetic Aperture Focusing Technique) reconstruction. The ray tracer calculates the required travel time through the anisotropic columnar grain structure of the austenitic weld. There, the formulation of ray tracing as a boundary value problem allows a straightforward derivation of the ray path from a given transducer position to any pixel in the reconstruction area and reduces the computational cost considerably. T3 - ZIB-Report - 16-14 KW - ray tracing KW - ODE boundary value problems KW - ultrasonics KW - nondestructive testing Y1 - 2016 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-58386 UR - https://www.wcndt2016.com/portals/wcndt/bb/Fr1H4.pdf SN - 1438-0064 ER - TY - BOOK A1 - Weiser, Martin T1 - Inside Finite Elements N2 - All relevant implementation aspects of finite element methods are discussed in this book. The focus is on algorithms and data structures as well as on their concrete implementation. Theory is covered as far as it gives insight into the construction of algorithms.Throughout the exercises a complete FE-solver for scalar 2D problems will be implemented in Matlab/Octave. Y1 - 2016 PB - De Gruyter ER - TY - GEN A1 - Volkwein, Stefan A1 - Weiser, Martin T1 - Affine Invariant Convergence Analysis for Inexact Augmented Lagrangian-SQP Methods N2 - An affine invariant convergence analysis for inexact augmented Lagrangian-SQP methods is presented. The theory is used for the construction of an accuracy matching between iteration errors and truncation errors, which arise from the inexact linear system solves. The theoretical investigations are illustrated numerically by an optimal control problem for the Burgers equation. T3 - ZIB-Report - 00-56 KW - nonlinear programming KW - multiplier methods KW - affine invariant norms KW - Burgers' equation Y1 - 2000 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6243 ER - TY - GEN A1 - Weiser, Martin A1 - Deuflhard, Peter T1 - The Central Path towards the Numerical Solution of Optimal Control Problems N2 - A new approach to the numerical solution of optimal control problems including control and state constraints is presented. Like hybrid methods, the approach aims at combining the advantages of direct and indirect methods. Unlike hybrid methods, however, our method is directly based on interior-point concepts in function space --- realized via an adaptive multilevel scheme applied to the complementarity formulation and numerical continuation along the central path. Existence of the central path and its continuation towards the solution point is analyzed in some theoretical detail. An adaptive stepsize control with respect to the duality gap parameter is worked out in the framework of affine invariant inexact Newton methods. Finally, the performance of a first version of our new type of algorithm is documented by the successful treatment of the well-known intricate windshear problem. T3 - ZIB-Report - 01-12 KW - optimal control KW - interior point methods KW - affine invariance Y1 - 2001 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6380 ER - TY - GEN A1 - Weiser, Martin T1 - Linear convergence of an interior point method for linear control constrained optimal control problems N2 - The paper provides a detailed analysis of a short step interior point algorithm applied to linear control constrained optimal control problems. Using an affine invariant local norm and an inexact Newton corrector, the well-known convergence results from finite dimensional linear programming can be extended to the infinite dimensional setting of optimal control. The present work complements a recent paper of Weiser and Deuflhard, where convergence rates have not been derived. The choice of free parameters, i.e. the corrector accuracy and the number of corrector steps, is discussed. T3 - ZIB-Report - 02-13 KW - linear optimal control KW - infinite dimensional KW - interior point methods KW - inexact Newton methods Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6809 ER - TY - GEN A1 - Weiser, Martin T1 - Pointwise Nonlinear Scaling for Reaction-Diffusion-Equations N2 - Parabolic reaction-diffusion systems may develop sharp moving reaction fronts which pose a challenge even for adaptive finite element methods. We propose a method to transform the equation into an equivalent form that usually exhibits solutions which are easier to discretize, giving higher accuracy for a given number of degrees of freedom. The transformation is realized as an efficiently computable pointwise nonlinear scaling that is optimized for prototypical planar travelling wave solutions of the underlying reaction-diffusion equation. The gain in either performance or accuracy is demonstrated on different numerical examples. T3 - ZIB-Report - 07-45 KW - reaction-diffusion equations KW - travelling waves KW - nonlinear scaling KW - discretization error Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-10493 SN - 1438-0064 ER - TY - GEN A1 - Schenk, Olaf A1 - Wächter, Andreas A1 - Weiser, Martin T1 - Inertia Revealing Preconditioning For Large-Scale Nonconvex Constrained Optimization N2 - Fast nonlinear programming methods following the all-at-once approach usually employ Newton's method for solving linearized Karush-Kuhn-Tucker (KKT) systems. In nonconvex problems, the Newton direction is only guaranteed to be a descent direction if the Hessian of the Lagrange function is positive definite on the nullspace of the active constraints, otherwise some modifications to Newton's method are necessary. This condition can be verified using the signs of the KKT's eigenvalues (inertia), which are usually available from direct solvers for the arising linear saddle point problems. Iterative solvers are mandatory for very large-scale problems, but in general do not provide the inertia. Here we present a preconditioner based on a multilevel incomplete $LBL^T$ factorization, from which an approximation of the inertia can be obtained. The suitability of the heuristics for application in optimization methods is verified on an interior point method applied to the CUTE and COPS test problems, on large-scale 3D PDE-constrained optimal control problems, as well as 3D PDE-constrained optimization in biomedical cancer hyperthermia treatment planning. The efficiency of the preconditioner is demonstrated on convex and nonconvex problems with $150^3$ state variables and $150^2$ control variables, both subject to bound constraints. T3 - ZIB-Report - 07-32 KW - nonconvex constrained optimization KW - interior-point method KW - inertia KW - multilevel incomplete factorization Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-10314 SN - 1438-0064 ER - TY - GEN A1 - Griesse, Roland A1 - Weiser, Martin T1 - On the Interplay Between Interior Point Approximation and Parametric Sensitivities in Optimal Control N2 - This paper is concerned with the sensitivities of function space oriented interior point approximations in parameter dependent problems. For an abstract setting that covers control constrained optimal control problems, the convergence of interior point sensitivities to the sensitivities of the optimal solution is shown. Error bounds for $L_q$ norms are derived and illustrated with numerical examples. T3 - ZIB-Report - 05-44 KW - interior point methods KW - parametric sensitivity KW - optimal control Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8773 ER - TY - GEN A1 - Weiser, Martin A1 - Hubig, Michael A1 - Shanmugam Subramaniam, Jayant T1 - Reconstructing Ambient Temperature Changes in Death Time Estimation with a Bayesian Double-Exponential Approach T2 - Zenodo N2 - Code and data for the reconstruction of ambient temperature drop in time of death estimation We provide Octave code and temperature measurement data for - empirircally estimating thermal sensor likelihood - estimating time and amplitude of a single sudden ambient temperature drop from temperature measurement data in two thermally different compartments. Y1 - 2025 U6 - https://doi.org/10.5281/zenodo.17702240 ER - TY - GEN A1 - Villani, Paolo A1 - Weiser, Martin T1 - Adaptive Gaussian process regression for inverse problems. ALGORITMY 2024 N2 - This submission contains the code used for the proceedings paper for ALGORITMY 2024, concerning surrogate model-based inverse problems. Version 2 modified plot appearances and fixed some minor typos. Y1 - 2024 ER - TY - CHAP A1 - Semler, Phillip A1 - Weiser, Martin ED - Fackeldey, Konstantin ED - Kannan, Aswin ED - Pokutta, Sebastian ED - Sharma, Kartikey ED - Walter, Daniel ED - Walther, Andrea ED - Weiser, Martin T1 - Adaptive gradient-enhanced Gaussian process surrogates for inverse problems T2 - Mathematical Optimization for Machine Learning: Proceedings of the MATH+ Thematic Einstein Semester 2023 N2 - Generating simulated training data needed for constructing sufficiently accurate surrogate models to be used for efficient optimization or parameter identification can incur a huge computational effort in the offline phase. We consider a fully adaptive greedy approach to the computational design of experiments problem using gradient-enhanced Gaussian process regression as surrogates. Designs are incrementally defined by solving an optimization problem for accuracy given a certain computational budget. We address not only the choice of evaluation points but also of required simulation accuracy, both of values and gradients of the forward model. Numerical results show a significant reduction of the computational effort compared to just position-adaptive and static designs as well as a clear benefit of including gradient information into the surrogate training. Y1 - 2025 U6 - https://doi.org/10.1515/9783111376776-005 SP - 59 EP - 78 PB - De Gruyter ER - TY - CHAP A1 - Villani, Paolo A1 - Unger, Jörg F. A1 - Weiser, Martin T1 - Adaptive Gaussian Process Regression for Bayesian inverse problems T2 - Proceedings of the Conference Algoritmy 2024 N2 - We introduce a novel adaptive Gaussian Process Regression (GPR) methodology for efficient construction of surrogate models for Bayesian inverse problems with expensive forward model evaluations. An adaptive design strategy focuses on optimizing both the positioning and simulation accuracy of training data in order to reduce the computational cost of simulating training data without compromising the fidelity of the posterior distributions of parameters. The method interleaves a goal-oriented active learning algorithm selecting evaluation points and tolerances based on the expected impact on the Kullback-Leibler divergence of surrogated and true posterior with a Markov Chain Monte Carlo sampling of the posterior. The performance benefit of the adaptive approach is demonstrated for two simple test problems. Y1 - 2024 SP - 214 EP - 224 ER - TY - JOUR A1 - Andrés Arcones, Daniel A1 - Weiser, Martin A1 - Koutsourelakis, Faidon-Stelios A1 - Unger, Jörg F. T1 - A Bayesian Framework for Simulation-based Digital Twins of Bridges JF - EUROSTRUCT 2023:European Association on Quality Control of Bridges and Structures: Digital Transformation in Sustainability N2 - Simulation-based digital twins have emerged as a powerful tool for evaluating the mechanical response of bridges. As virtual representations of physical systems, digital twins can provide a wealth of information that complements traditional inspection and monitoring data. By incorporating virtual sensors and predictive maintenance strategies, they have the potential to improve our understanding of the behavior and performance of bridges over time. However, as bridges age and undergo regular loading and extreme events, their structural characteristics change, often differing from the predictions of their initial design. Digital twins must be continuously adapted to reflect these changes. In this article, we present a Bayesian framework for updating simulation-based digital twins in the context of bridges. Our approach integrates information from measurements to account for inaccuracies in the simulation model and quantify uncertainties. Through its implementation and assessment, this work demonstrates the potential for digital twins to provide a reliable and up-to-date representation of bridge behavior, helping to inform decision-making for maintenance and management. Y1 - 2023 U6 - https://doi.org/10.1002/cepa.2177 VL - 6 IS - 5 SP - 734 EP - 740 ER - TY - CHAP A1 - Andrés Arcones, Daniel A1 - Weiser, Martin A1 - Koutsourelakis, Faidon-Stelios A1 - Unger, Jörg F. T1 - Evaluation of Model Bias Identification Approaches Based on Bayesian Inference and Applications to Digital Twins T2 - 5th ECCOMAS Thematic Conference on Uncertainty Quantification in Computational Sciences and Engineering N2 - In recent years, the use of simulation-based digital twins for monitoring and assessment of complex mechanical systems has greatly expanded. Their potential to increase the information obtained from limited data makes them an invaluable tool for a broad range of real-world applications. Nonetheless, there usually exists a discrepancy between the predicted response and the measurements of the system once built. One of the main contributors to this difference in addition to miscalibrated model parameters is the model error. Quantifying this socalled model bias (as well as proper values for the model parameters) is critical for the reliable performance of digital twins. Model bias identification is ultimately an inverse problem where information from measurements is used to update the original model. Bayesian formulations can tackle this task. Including the model bias as a parameter to be inferred enables the use of a Bayesian framework to obtain a probability distribution that represents the uncertainty between the measurements and the model. Simultaneously, this procedure can be combined with a classic parameter updating scheme to account for the trainable parameters in the original model. This study evaluates the effectiveness of different model bias identification approaches based on Bayesian inference methods. This includes more classical approaches such as direct parameter estimation using MCMC in a Bayesian setup, as well as more recent proposals such as stat-FEM or orthogonal Gaussian Processes. Their potential use in digital twins, generalization capabilities, and computational cost is extensively analyzed. Y1 - 2023 UR - https://2023.uncecomp.org/proceedings/pdf/19795.pdf SP - 1 EP - 15 ER - TY - JOUR A1 - Maier, Kristina A1 - Weiser, Martin A1 - Conrad, Tim T1 - Hybrid PDE-ODE Models for Efficient Simulation of Infection Spread in Epidemiology JF - Proceedings of the Royal Society A N2 - This paper introduces a novel hybrid model combining Partial Differential Equations (PDEs) and Ordinary Differential Equations (ODEs) to simulate infectious disease dynamics across geographic regions. By leveraging the spatial detail of PDEs and the computational efficiency of ODEs, the model enables rapid evaluation of public health interventions. Applied to synthetic environments and real-world scenarios in Lombardy, Italy, and Berlin, Germany, the model highlights how interactions between PDE and ODE regions affect infection dynamics, especially in high-density areas. Key findings reveal that the placement of model boundaries in densely populated regions can lead to inaccuracies in infection spread, suggesting that boundaries should be positioned in areas of lower population density to better reflect transmission dynamics. Additionally, regions with low population density hinder infection flow, indicating a need for incorporating, e.g., jumps in the model to enhance its predictive capabilities. Results indicate that the hybrid model achieves a balance between computational speed and accuracy, making it a valuable tool for policymakers in real-time decision-making and scenario analysis in epidemiology and potentially in other fields requiring similar modeling approaches. Y1 - 2025 U6 - https://doi.org/10.1098/rspa.2024.0421 VL - 481 IS - 2306 PB - Royal Society ER - TY - JOUR A1 - Andrés Arcones, Daniel A1 - Weiser, Martin A1 - Koutsourelakis, Faidon-Stelios A1 - Unger, Jörg F. T1 - Model bias identification for Bayesian calibration of stochastic digital twins of bridges JF - Applied Stochastic Models in Business and Industry N2 - Simulation-based digital twins must provide accurate, robust and reliable digital representations of their physical counterparts. Quantifying the uncertainty in their predictions plays, therefore, a key role in making better-informed decisions that impact the actual system. The update of the simulation model based on data must be then carefully implemented. When applied to complex standing structures such as bridges, discrepancies between the computational model and the real system appear as model bias, which hinders the trustworthiness of the digital twin and increases its uncertainty. Classical Bayesian updating approaches aiming to infer the model parameters often fail at compensating for such model bias, leading to overconfident and unreliable predictions. In this paper, two alternative model bias identification approaches are evaluated in the context of their applicability to digital twins of bridges. A modularized version of Kennedy and O'Hagan's approach and another one based on Orthogonal Gaussian Processes are compared with the classical Bayesian inference framework in a set of representative benchmarks. Additionally, two novel extensions are proposed for such models: the inclusion of noise-aware kernels and the introduction of additional variables not present in the computational model through the bias term. The integration of such approaches in the digital twin corrects the predictions, quantifies their uncertainty, estimates noise from unknown physical sources of error and provides further insight into the system by including additional pre-existing information without modifying the computational model. Y1 - 2024 U6 - https://doi.org/10.1002/asmb.2897 VL - 41 IS - 3 ER - TY - JOUR A1 - Göbel, Fritz A1 - Huynh, Ngoc Mai Monica A1 - Chegini, Fatemeh A1 - Pavarino, Luca A1 - Weiser, Martin A1 - Scacchi, Simone A1 - Anzt, Hartwig T1 - A BDDC Preconditioner for the Cardiac EMI Model in three Dimensions JF - SIAM J. Sci. Comput. N2 - We analyze a Balancing Domain Decomposition by Constraints (BDDC) preconditioner for the solution of three dimensional composite Discontinuous Galerkin discretizations of reaction-diffusion systems of ordinary and partial differential equations arising in cardiac cell-by-cell models like the Extracellular space, Membrane and Intracellular space (EMI) Model. These microscopic models are essential for the understanding of events in aging and structurally diseased hearts which macroscopic models relying on homogenized descriptions of the cardiac tissue, like Monodomain and Bidomain models, fail to adequately represent. The modeling of each individual cardiac cell results in discontinuous global solutions across cell boundaries, requiring the careful construction of dual and primal spaces for the BDDC preconditioner. We provide a scalable condition number bound for the precondition operator and validate the theoretical results with extensive numerical experiments. Y1 - 2025 ER - TY - JOUR A1 - Andrés Arcones, Daniel A1 - Weiser, Martin A1 - Koutsourelakis, Phaedon-Stelios A1 - Unger, Jörg F. T1 - Bias Identification Approaches for Model Updating of Simulation-based Digital Twins of Bridges JF - Structural Health Monitoring in the Light of Climate Impact and Data Science. Research and Review Journal of Nondestructive Testing N2 - Simulation-based digital twins of bridges have the potential not only to serve as monitoring devices of the current state of the structure but also to generate new knowledge through physical predictions that allow for better-informed decisionmaking. For an accurate representation of the bridge, the underlying models must be tuned to reproduce the real system. Nevertheless, the necessary assumptions and simplifications in these models irremediably introduce discrepancies between measurements and model response. We will show that quantifying the extent of the uncertainties introduced through the models that lead to such discrepancies provides a better understanding of the real system, enhances the model updating process, and creates more robust and trustworthy digital twins. The inclusion of an explicit bias term will be applied to a representative demonstrator case based on the thermal response of the Nibelungenbrücke of Worms. The findings from this work are englobed in the initiative SPP 100+, whose main aim is the extension of the service life of structures, especially through the implementation of digital twins. Y1 - 2024 U6 - https://doi.org/10.58286/30524 VL - 2 IS - 2 ER - TY - CHAP A1 - Chegini, Fatemeh A1 - Kopanicakova, Alena A1 - Weiser, Martin A1 - Krause, Rolf T1 - Quantitative Analysis of Nonlinear MultifidelityOptimization for Inverse Electrophysiology T2 - Domain Decomposition Methods in Science and Engineering XXVI N2 - The electric conductivity of cardiac tissue determines excitation propagation and is important for quantifying ischemia and scar tissue and for building personalized models. Estimating conductivity distributions from endocardial mapping data is a challenging inverse problem due to the computational complexity of the monodomain equation, which describes the cardiac excitation. For computing a maximum posterior estimate, we investigate different optimization approaches based on adjoint gradient computation: steepest descent, limited memory BFGS, and recursive multilevel trust region methods, which are using mesh hierarchies or heterogeneous model hierarchies. We compare overall performance, asymptotic convergence rate, and pre-asymptotic progress on selected examples in order to assess the benefit of our multifidelity acceleration. Y1 - 2022 SP - 65 EP - 76 PB - Springer ER - TY - JOUR A1 - Alhaddad, Samer A1 - Förstner, Jens A1 - Groth, Stefan A1 - Grünewald, Daniel A1 - Grynko, Yevgen A1 - Hannig, Frank A1 - Kenter, Tobias A1 - Pfreundt, F.J. A1 - Plessl, Christian A1 - Schotte, Merlind A1 - Steinke, Thomas A1 - Teich, J. A1 - Weiser, Martin A1 - Wende, Florian T1 - The HighPerMeshes Framework for Numerical Algorithms on Unstructured Grids JF - Concurrency and Computation: Practice and Experience N2 - Solving PDEs on unstructured grids is a cornerstone of engineering and scientific computing. Heterogeneous parallel platforms, including CPUs, GPUs, and FPGAs, enable energy-efficient and computationally demanding simulations. In this article, we introduce the HPM C++-embedded DSL that bridges the abstraction gap between the mathematical formulation of mesh-based algorithms for PDE problems on the one hand and an increasing number of heterogeneous platforms with their different programming models on the other hand. Thus, the HPM DSL aims at higher productivity in the code development process for multiple target platforms. We introduce the concepts as well as the basic structure of the HPM DSL, and demonstrate its usage with three examples. The mapping of the abstract algorithmic description onto parallel hardware, including distributed memory compute clusters, is presented. A code generator and a matching back end allow the acceleration of HPM code with GPUs. Finally, the achievable performance and scalability are demonstrated for different example problems. Y1 - 2022 U6 - https://doi.org/10.1002/cpe.6616 VL - 34 IS - 14 ER - TY - GEN A1 - Weiser, Martin A1 - Chegini, Fatemeh T1 - Higher-order time integration using spectral deferred correction method (SDC) in a cell by cell discretization of cardiac excitation N2 - This C++ code implements a cell-by-cell model of cardiac excitation using a piecewise-continuous finite element discretization and spectral deferred correction time stepping. The code is based on the Kaskade 7 finite element toolbox and forms a prototype for the µCarp code to be implemented in the Microcard project. Y1 - 2022 U6 - https://doi.org/10.35097/716 ER - TY - JOUR A1 - Niemann, Jan-Hendrik A1 - Uram, Samuel A1 - Wolf, Sarah A1 - Conrad, Natasa Djurdjevac A1 - Weiser, Martin T1 - Multilevel Optimization for Policy Design with Agent-Based Epidemic Models JF - Computational Science N2 - Epidemiological models can not only be used to forecast the course of a pandemic like COVID-19, but also to propose and design non-pharmaceutical interventions such as school and work closing. In general, the design of optimal policies leads to nonlinear optimization problems that can be solved by numerical algorithms. Epidemiological models come in different complexities, ranging from systems of simple ordinary differential equations (ODEs) to complex agent-based models (ABMs). The former allow a fast and straightforward optimization, but are limited in accuracy, detail, and parameterization, while the latter can resolve spreading processes in detail, but are extremely expensive to optimize. We consider policy optimization in a prototypical situation modeled as both ODE and ABM, review numerical optimization approaches, and propose a heterogeneous multilevel approach based on combining a fine-resolution ABM and a coarse ODE model. Numerical experiments, in particular with respect to convergence speed, are given for illustrative examples. Y1 - 2024 U6 - https://doi.org/10.1016/j.jocs.2024.102242 VL - 77 SP - 102242 ER - TY - CHAP A1 - Gander, Lia A1 - Krause, Rolf A1 - Weiser, Martin A1 - Costabal, Francisco A1 - Pezzuto, Simone T1 - On the Accuracy of Eikonal Approximations in Cardiac Electrophysiology in the Presence of Fibrosis T2 - Functional Imaging and Modeling of the Heart. FIMH 2023. N2 - Fibrotic tissue is one of the main risk factors for cardiac arrhythmias. It is therefore a key component in computational studies. In this work, we compare the monodomain equation to two eikonal models for cardiac electrophysiology in the presence of fibrosis. We show that discontinuities in the conductivity field, due to the presence of fibrosis, introduce a delay in the activation times. The monodomain equation and eikonal-diffusion model correctly capture these delays, contrarily to the classical eikonal equation. Importantly, a coarse space discretization of the monodomain equation amplifies these delays, even after accounting for numerical error in conduction velocity. The numerical discretization may also introduce artificial conduction blocks and hence increase propagation complexity. Therefore, some care is required when comparing eikonal models to the discretized monodomain equation. Y1 - 2023 U6 - https://doi.org/10.1007/978-3-031-35302-4_14 VL - 13958 PB - Springer, Cham ER - TY - JOUR A1 - Subramaniam, Jayant S. A1 - Hubig, Michael A1 - Muggenthaler, Holger A1 - Schenkl, Sebastian A1 - Ullrich, Julia A1 - Pourtier, Grégroire A1 - Weiser, Martin A1 - Mall, Gita T1 - Sensitivity of temperature-based time since death estimation on measurement location JF - International Journal of Legal Medicine N2 - Rectal temperature measurement (RTM) from crime scenes is an important parameter for temperature-based time of death estimation (TDE). Various influential variables exist in TDE methods like the uncertainty in thermal and environmental parameters. Although RTM depends in particular on the location of measurement position, this relationship has never been investigated separately. The presented study fills this gap using Finite Element (FE) simulations of body cooling. A manually meshed coarse human FE model and an FE geometry model developed from the CT scan of a male corpse are used for TDE sensitivity analysis. The coarse model is considered with and without a support structure of moist soil. As there is no clear definition of ideal rectal temperature measurement location for TDE, possible variations in RTM location (RTML) are considered based on anatomy and forensic practice. The maximum variation of TDE caused by RTML changes is investigated via FE simulation. Moreover, the influence of ambient temperature, of FE model change and of the models positioning on a wet soil underground are also discussed. As a general outcome, we notice that maximum TDE deviations of up to ca. 2-3 h due to RTML deviations have to be expected. The direction of maximum influence of RTML change on TDE generally was on the line caudal to cranial. Y1 - 2023 U6 - https://doi.org/10.1007/s00414-023-03040-y VL - 137 SP - 1815 EP - 1837 ER - TY - JOUR A1 - Semler, Phillip A1 - Weiser, Martin T1 - Adaptive Gaussian Process Regression for Efficient Building of Surrogate Models in Inverse Problems JF - Inverse Problems N2 - In a task where many similar inverse problems must be solved, evaluating costly simulations is impractical. Therefore, replacing the model y with a surrogate model y(s) that can be evaluated quickly leads to a significant speedup. The approximation quality of the surrogate model depends strongly on the number, position, and accuracy of the sample points. With an additional finite computational budget, this leads to a problem of (computer) experimental design. In contrast to the selection of sample points, the trade-off between accuracy and effort has hardly been studied systematically. We therefore propose an adaptive algorithm to find an optimal design in terms of position and accuracy. Pursuing a sequential design by incrementally appending the computational budget leads to a convex and constrained optimization problem. As a surrogate, we construct a Gaussian process regression model. We measure the global approximation error in terms of its impact on the accuracy of the identified parameter and aim for a uniform absolute tolerance, assuming that y(s) is computed by finite element calculations. A priori error estimates and a coarse estimate of computational effort relate the expected improvement of the surrogate model error to computational effort, resulting in the most efficient combination of sample point and evaluation tolerance. We also allow for improving the accuracy of already existing sample points by continuing previously truncated finite element solution procedures. Y1 - 2023 U6 - https://doi.org/10.1088/1361-6420/ad0028 VL - 39 IS - 12 SP - 125003 ER - TY - JOUR A1 - Ullrich, Julia A1 - Weiser, Martin A1 - Subramaniam, Jayant A1 - Schenkl, Sebastian A1 - Muggenthaler, Holger A1 - Hubig, Michael A1 - Mall, Gita T1 - The impact of anatomy variation on temperature based time of death estimation JF - International Journal of Legal Medicine N2 - Temperature-based time of death estimation (TTDE) using simulation methods such as the finite element (FE) method promises higher accuracy and broader applicability in nonstandard cooling scenarios than established phenomenological methods. Their accuracy depends crucially on the simulation model to capture the actual situation. The model fidelity in turn hinges on the representation of the corpse’s anatomy in form of computational meshes as well as on the thermodynamic parameters. While inaccuracies in anatomy representation due to coarse mesh resolution are known to have a minor impact on the estimated time of death, the sensitivity with respect to larger differences in the anatomy has so far not been studied. We assess this sensitivity by comparing four independently generated and vastly different anatomical models in terms of the estimated time of death in an identical cooling scenario. In order to isolate the impact of shape variation, the models are scaled to a reference size, and the possible impact of measurement location variation is excluded explicitly, which gives a lower bound on the impact of anatomy on the estimated time of death. Y1 - 2023 U6 - https://doi.org/10.1007/s00414-023-03026-w VL - 137 SP - 1615 EP - 1627 ER - TY - CHAP A1 - Chegini, Fatemeh A1 - Steinke, Thomas A1 - Weiser, Martin T1 - Efficient adaptivity for simulating cardiac electrophysiology with spectral deferred correction methods N2 - The locality of solution features in cardiac electrophysiology simulations calls for adaptive methods. Due to the overhead incurred by established mesh refinement and coarsening, however, such approaches failed in accelerating the computations. Here we investigate a different route to spatial adaptivity that is based on nested subset selection for algebraic degrees of freedom in spectral deferred correction methods. This combination of algebraic adaptivity and iterative solvers for higher order collocation time stepping realizes a multirate integration with minimal overhead. This leads to moderate but significant speedups in both monodomain and cell-by-cell models of cardiac excitation, as demonstrated at four numerical examples. Y1 - 2022 ER - TY - JOUR A1 - Huynh, Ngoc A1 - Chegini, Fatemeh A1 - Pavarino, Luca A1 - Weiser, Martin A1 - Scacchi, Simone T1 - Convergence analysis of BDDC preconditioners for hybrid DG discretizations of the cardiac cell-by-cell model JF - SIAM Journal on Scientific Computing N2 - A Balancing Domain Decomposition by Constraints (BDDC) preconditioner is constructed and analyzed for the solution of hybrid Discontinuous Galerkin discretizations of reaction-diffusion systems of ordinary and partial differential equations arising in cardiac cell-by-cell models. The latter are different from the classical Bidomain and Monodomain cardiac models based on homogenized descriptions of the cardiac tissue at the macroscopic level, and therefore they allow the representation of individual cardiac cells, cell aggregates, damaged tissues and nonuniform distributions of ion channels on the cell membrane. The resulting discrete cell-by-cell models have discontinuous global solutions across the cell boundaries, hence the proposed BDDC preconditioner is based on appropriate dual and primal spaces with additional constraints which transfer information between cells (subdomains) without influencing the overall discontinuity of the global solution. A scalable convergence rate bound is proved for the resulting BDDC cell-by-cell preconditioned operator, while numerical tests validate this bound and investigate its dependence on the discretization parameters. Y1 - 2023 VL - 45 IS - 6 SP - A2836 EP - A2857 ER - TY - JOUR A1 - Carderera, Alejandro A1 - Pokutta, Sebastian A1 - Schütte, Christof A1 - Weiser, Martin T1 - An efficient first-order conditional gradient algorithm in data-driven sparse identification of nonlinear dynamics to solve sparse recovery problems under noise JF - Journal of Computational and Applied Mathematics N2 - Governing equations are essential to the study of nonlinear dynamics, often enabling the prediction of previously unseen behaviors as well as the inclusion into control strategies. The discovery of governing equations from data thus has the potential to transform data-rich fields where well-established dynamical models remain unknown. This work contributes to the recent trend in data-driven sparse identification of nonlinear dynamics of finding the best sparse fit to observational data in a large library of potential nonlinear models. We propose an efficient first-order Conditional Gradient algorithm for solving the underlying optimization problem. In comparison to the most prominent alternative algorithms, the new algorithm shows significantly improved performance on several essential issues like sparsity-induction, structure-preservation, noise robustness, and sample efficiency. We demonstrate these advantages on several dynamics from the field of synchronization, particle dynamics, and enzyme chemistry. Y1 - 2021 ER - TY - JOUR A1 - Chegini, Fatemeh A1 - Kopanicakova, Alena A1 - Krause, Rolf A1 - Weiser, Martin T1 - Efficient Identification of Scars using Heterogeneous Model Hierarchies JF - EP Europace N2 - Aims. Detection and quantification of myocardial scars are helpful both for diagnosis of heart diseases and for building personalized simulation models. Scar tissue is generally charac­terized by a different conduction of electrical excitation. We aim at estimating conductivity-related parameters from endocardial mapping data, in particular the conductivity tensor. Solving this inverse problem requires computationally expensive monodomain simulations on fine discretizations. Therefore, we aim at accelerating the estimation using a multilevel method combining electrophysiology models of different complexity, namely the mono­domain and the eikonal model. Methods. Distributed parameter estimation is performed by minimizing the misfit between simulated and measured electrical activity on the endocardial surface, subject to the mono­domain model and regularization, leading to a constrained optimization problem. We formulate this optimization problem, including the modeling of scar tissue and different regularizations, and design an efficient iterative solver. We consider monodomain grid hierarchies and monodomain-eikonal model hierarchies in a recursive multilevel trust-region method. Results. From several numerical examples, both the efficiency of the method and the estimation quality, depending on the data, are investigated. The multilevel solver is significantly faster than a comparable single level solver. Endocardial mapping data of realistic density appears to be just sufficient to provide quantitatively reasonable estimates of location, size, and shape of scars close to the endocardial surface. Conclusion. In several situations, scar reconstruction based on eikonal and monodomain models differ significantly, suggesting the use of the more accurate but more expensive monodomain model for this purpose. Still, eikonal models can be utilized to accelerate the computations considerably, enabling the use of complex electrophysiology models for estimating myocardial scars from endocardial mapping data. Y1 - 2021 U6 - https://doi.org/10.1093/europace/euaa402 VL - 23 SP - i113 EP - i122 ER - TY - BOOK A1 - Deuflhard, Peter A1 - Weiser, Martin T1 - Numerische Mathematik 3. Adaptive Lösung partieller Differentialgleichungen Y1 - 2020 SN - 978-3-11-069168-9 U6 - https://doi.org/10.1515/9783110689655 PB - de Gruyter ET - 2 ER - TY - JOUR A1 - Schiela, Anton A1 - Stöcklein, Matthias A1 - Weiser, Martin T1 - A primal dual projection algorithm for efficient constraint preconditioning JF - SIAM Journal on Scientific Computing N2 - We consider a linear iterative solver for large scale linearly constrained quadratic minimization problems that arise, for example, in optimization with PDEs. By a primal-dual projection (PDP) iteration, which can be interpreted and analysed as a gradient method on a quotient space, the given problem can be solved by computing sulutions for a sequence of constrained surrogate problems, projections onto the feasible subspaces, and Lagrange multiplier updates. As a major application we consider a class of optimization problems with PDEs, where PDP can be applied together with a projected cg method using a block triangular constraint preconditioner. Numerical experiments show reliable and competitive performance for an optimal control problem in elasticity. Y1 - 2021 U6 - https://doi.org/10.1137/20M1380739 VL - 43 IS - 6 SP - A4095 EP - A4120 ER - TY - CHAP A1 - Steyer, Joshua A1 - Chegini, Fatemeh A1 - Potse, Mark A1 - Loewe, Axel A1 - Weiser, Martin T1 - Continuity of Microscopic Cardiac Conduction in a Computational Cell-by-Cell Model T2 - 2023 Computing in Cardiology Conference (CinC) N2 - Conduction velocity in cardiac tissue is a crucial electrophysiological parameter for arrhythmia vulnerability. Pathologically reduced conduction velocity facilitates arrhythmogenesis because such conduction velocities decrease the wavelength with which re-entry may occur. Computational studies on CV and how it changes regionally in models at spatial scales multiple times larger than actual cardiac cells exist. However, microscopic conduction within cells and between them have been studied less in simulations. In this work, we study the relation of microscopic conduction patterns and clinically observable macroscopic conduction using an extracellular-membrane-intracellular model which represents cardiac tissue with these subdomains at subcellular resolution. By considering cell arrangement and non-uniform gap junction distribution, it yields anisotropic excitation propagation. This novel kind of model can for example be used to understand how discontinuous conduction on the microscopic level affects fractionation of electrograms in healthy and fibrotic tissue. Along the membrane of a cell, we observed a continuously propagating activation wavefront. When transitioning from one cell to the neighbouring one, jumps in local activation times occurred, which led to lower global conduction velocities than locally within each cell. Y1 - 2023 U6 - https://doi.org/10.22489/CinC.2023.385 SN - 2325-887X VL - 50 PB - Computing in Cardiology ER - TY - CHAP A1 - Chegini, Fatemeh A1 - Froehly, Algiane A1 - Huynh, Ngoc Mai Monica A1 - Pavarino, Luca A1 - Potse, Mark A1 - Scacchi, Simone A1 - Weiser, Martin T1 - Efficient numerical methods for simulating cardiac electrophysiology with cellular resolution T2 - 10th Int. Conf. Computational Methods for Coupled Problems in Science and Engineering 2023 N2 - The cardiac extracellular-membrane-intracellular (EMI) model enables the precise geometrical representation and resolution of aggregates of individual myocytes. As a result, it not only yields more accurate simulations of cardiac excitation compared to homogenized models but also presents the challenge of solving much larger problems. In this paper, we introduce recent advancements in three key areas: (i) the creation of artificial, yet realistic grids, (ii) efficient higher-order time stepping achieved by combining low-overhead spatial adaptivity on the algebraic level with progressive spectral deferred correction methods, and (iii) substructuring domain decomposition preconditioners tailored to address the complexities of heterogeneous problem structures. The efficiency gains of these proposed methods are demonstrated through numerical results on cardiac meshes of different sizes. Y1 - 2023 UR - https://www.scipedia.com/public/2023f U6 - https://doi.org/10.23967/c.coupled.2023.004 ER - TY - CHAP A1 - Steyer, Joshua A1 - Chegini, Fatemeh A1 - Starý, Tomas A1 - Potse, Mark A1 - Weiser, Martin A1 - Loewe, Axel T1 - Electrograms in a Cardiac Cell-by-Cell Model T2 - Workshop Biosignals 2024 N2 - Cardiac electrograms are an important tool to study the spread of excitation waves inside the heart, which in turn underlie muscle contraction. Electrograms can be used to analyse the dynamics of these waves, e.g. in fibrotic tissue. In computational models, these analyses can be done with greater detail than during minimally invasive in vivo procedures. Whilst homogenised models have been used to study electrogram genesis, such analyses have not yet been done in cellularly resolved models. Such high resolution may be required to develop a thorough understanding of the mechanisms behind abnormal excitation patterns leading to arrhythmias. In this study, we derived electrograms from an excitation propagation simulation in the Extracellular, Membrane, Intracellular (EMI) model, which represents these three domains explicitly in the mesh. We studied the effects of the microstructural excitation dynamics on electrogram genesis and morphology. We found that electrograms are sensitive to the myocyte alignment and connectivity, which translates into micro-fractionations in the electrograms. Y1 - 2024 U6 - https://doi.org/10.47952/gro-publ-194 ER - TY - CHAP A1 - Weiser, Martin A1 - Chegini, Fatemeh T1 - Adaptive multirate integration of cardiac electrophysiology with spectral deferred correction methods T2 - CMBE22 - 7th International Conference on Computational & Mathematical Biomedical Engineering N2 - The highly localized dynamics of cardiac electrophysiology models call for adaptive simulation methods. Unfortunately, the overhead incurred by classical mesh adaptivity turns out to outweigh the performance improvements achieved by reducing the problem size. Here, we explore a different approach to adaptivity based on algebraic degree of freedom subset selection during spectral deferred correction sweeps, which realizes a kind of multirate higher order integration. Numerical experience indicates a significant performance increase compared to uniform simulations. Y1 - 2022 SP - 528 EP - 531 ER - TY - JOUR A1 - Bartels, Tinko A1 - Fisikopoulos, Vissarion A1 - Weiser, Martin T1 - Fast Floating-Point Filters for Robust Predicates JF - BIT Numerical Mathematics N2 - Geometric predicates are at the core of many algorithms, such as the construction of Delaunay triangulations, mesh processing and spatial relation tests. These algorithms have applications in scientific computing, geographic information systems and computer-aided design. With floating-point arithmetic, these geometric predicates can incur round-off errors that may lead to incorrect results and inconsistencies, causing computations to fail. This issue has been addressed using a combination of exact arithmetic for robustness and floating-point filters to mitigate the computational cost of exact computations. The implementation of exact computations and floating-point filters can be a difficult task, and code generation tools have been proposed to address this. We present a new C++ meta-programming framework for the generation of fast, robust predicates for arbitrary geometric predicates based on polynomial expressions. We combine and extend different approaches to filtering, branch reduction, and overflow avoidance that have previously been proposed. We show examples of how this approach produces correct results for data sets that could lead to incorrect predicate results with naive implementations. Our benchmark results demonstrate that our implementation surpasses state-of-the-art implementations. Y1 - 2023 U6 - https://doi.org/10.1007/s10543-023-00975-x VL - 63 ER -