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 - 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 - Weiser, Martin A1 - Gänzler, Tobias A1 - Schiela, Anton T1 - A control reduced primal interior point method for a class of control constrained optimal control problems JF - Comput. Optim. Appl. Y1 - 2007 VL - 41 IS - 1 SP - 127 EP - 145 ER - TY - GEN A1 - Weiser, Martin A1 - Gänzler, Tobias A1 - Schiela, Anton T1 - A Control Reduced Primal Interior Point Method for PDE Constrained Optimization N2 - A primal interior point method for control constrained optimal control problems with PDE constraints is considered. Pointwise elimination of the control leads to a homotopy in the remaining state and dual variables, which is addressed by a short step pathfollowing method. The algorithm is applied to the continuous, infinite dimensional problem, where discretization is performed only in the innermost loop when solving linear equations. The a priori elimination of the least regular control permits to obtain the required accuracy with comparable coarse meshes. Convergence of the method and discretization errors are studied, and the method is illustrated at two numerical examples. T3 - ZIB-Report - 04-38 KW - interior point methods in function space KW - optimal control KW - finite elements KW - discretization error Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8138 ER - TY - JOUR A1 - Borndörfer, Ralf A1 - Danecker, Fabian A1 - Weiser, Martin T1 - A Discrete-Continuous Algorithm for Free Flight Planning JF - Algorithms N2 - We propose a hybrid discrete-continuous algorithm for flight planning in free flight airspaces. In a first step, our DisCOptER method discrete-continuous optimization for enhanced resolution) computes a globally optimal approximate flight path on a discretization of the problem using the A* method. This route initializes a Newton method that converges rapidly to the smooth optimum in a second step. The correctness, accuracy, and complexity of the method are goverened by the choice of the crossover point that determines the coarseness of the discretization. We analyze the optimal choice of the crossover point and demonstrate the asymtotic superority of DisCOptER over a purely discrete approach. KW - shortest path KW - flight planning KW - free flight KW - discrete-continuous algorithm KW - optimal control KW - discrete optimization Y1 - 2020 U6 - https://doi.org/10.3390/a14010004 SN - 1438-0064 VL - 14 IS - 1 SP - 4 PB - MDPI ER - TY - GEN A1 - Borndörfer, Ralf A1 - Danecker, Fabian A1 - Weiser, Martin T1 - A Discrete-Continuous Algorithm for Free Flight Planning N2 - We propose a hybrid discrete-continuous algorithm for flight planning in free flight airspaces. In a first step, our DisCOptER method discrete-continuous optimization for enhanced resolution) computes a globally optimal approximate flight path on a discretization of the problem using the A* method. This route initializes a Newton method that converges rapidly to the smooth optimum in a second step. The correctness, accuracy, and complexity of the method are goverened by the choice of the crossover point that determines the coarseness of the discretization. We analyze the optimal choice of the crossover point and demonstrate the asymtotic superority of DisCOptER over a purely discrete approach. T3 - ZIB-Report - 20-33 KW - shortest path KW - flight planning KW - free flight KW - discrete-continuous algorithm KW - optimal control KW - discrete optimization Y1 - 2020 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-81343 SN - 1438-0064 ER - TY - CHAP A1 - Borndörfer, Ralf A1 - Danecker, Fabian A1 - Weiser, Martin T1 - A Discrete-Continuous Algorithm for Globally Optimal Free Flight Trajectory Optimization T2 - 22nd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2022) N2 - We present an efficient algorithm that finds a globally optimal solution to the 2D Free Flight Trajectory Optimization Problem (aka Zermelo Navigation Problem) up to arbitrary precision in finite time. The algorithm combines a discrete and a continuous optimization phase. In the discrete phase, a set of candidate paths that densely covers the trajectory space is created on a directed auxiliary graph. Then Yen’s algorithm provides a promising set of discrete candidate paths which subsequently undergo a locally convergent refinement stage. Provided that the auxiliary graph is sufficiently dense, the method finds a path that lies within the convex domain around the global minimizer. From this starting point, the second stage will converge rapidly to the optimum. The density of the auxiliary graph depends solely on the wind field, and not on the accuracy of the solution, such that the method inherits the superior asymptotic convergence properties of the optimal control stage. Y1 - 2022 U6 - https://doi.org/10.4230/OASIcs.ATMOS.2022.2 VL - 106 SP - 1 EP - 13 ER - TY - JOUR A1 - Deuflhard, Peter A1 - Weiser, Martin A1 - Seebaß, Martin T1 - A New Nonlinear Elliptic Multilevel FEM Applied to Regional Hyperthermia JF - Comput. Visual. Sci. Y1 - 2000 U6 - https://doi.org/10.1007/PL00013546 VL - 3 SP - 1 EP - 6 ER - TY - GEN A1 - Deuflhard, Peter A1 - Weiser, Martin A1 - Seebass, Martin T1 - A New Nonlinear Elliptic Multilevel FEM Applied to Regional Hyperthermia N2 - In the clinical cancer therapy of regional hyperthermia nonlinear perfusion effects inside and outside the tumor seem to play a not negligible role. A stationary model of such effects leads to a nonlinear Helmholtz term within an elliptic boundary value problem. The present paper reports about the application of a recently designed adaptive multilevel FEM to this problem. For several 3D virtual patients, nonlinear versus linear model is studied. Moreover, the numerical efficiency of the new algorithm is compared with a former application of an adaptive FEM to the corresponding instationary model PDE. T3 - ZIB-Report - SC-98-35 KW - hyperthermia KW - nonlinear elliptic KW - multilevel FEM Y1 - 1998 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-3785 ER - TY - JOUR A1 - Deuflhard, Peter A1 - Weiser, Martin A1 - Seebass, Martin T1 - A new nonlinear elliptic multilevel FEM in clinical cancer therapy planning JF - Comput. Vis. Sci. Y1 - 2000 VL - 3 SP - 115 EP - 120 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 - JOUR A1 - Weihrauch, Mirko A1 - Wust, Peter A1 - Weiser, Martin A1 - Nadobny, Johanna A1 - Eisenhardt, Steffen A1 - Budach, Volker A1 - Gellermann, Johanna T1 - Adaptation of antenna profiles for control of MR guided hyperthermia (HT) in a hybrid MR-HT system JF - Medical Physics Y1 - 2007 VL - 34 IS - 12 SP - 4717 EP - 4725 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 - 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 - 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 - 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 - 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 - 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 - BOOK A1 - Deuflhard, Peter A1 - Weiser, Martin T1 - Adaptive numerical solution of PDEs Y1 - 2012 PB - de Gruyter CY - Berlin 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 - GEN A1 - Weiser, Martin A1 - Deuflhard, Peter A1 - Erdmann, Bodo T1 - Affine conjugate adaptive Newton methods for nonlinear elastomechanics N2 - The paper extends affine conjugate Newton methods from convex to nonconvex minimization, with particular emphasis on PDE problems originating from compressible hyperelasticity. Based on well-known schemes from finite dimensional nonlinear optimization, three different algorithmic variants are worked out in a function space setting, which permits an adaptive multilevel finite element implementation. These algorithms are tested on two well-known 3D test problems and a real-life example from surgical operation planning. T3 - ZIB-Report - 04-01 KW - affine conjugate Newton methods KW - nonconvex minimization KW - nonlinear elastomechnics KW - cranio-maxillofacial surgery KW - soft tissue simulation KW - multilev Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7768 ER - TY - JOUR A1 - Weiser, Martin A1 - Deuflhard, Peter A1 - Erdmann, Bodo T1 - Affine conjugate adaptive Newton methods for nonlinear elastomechanics JF - Opt. Meth. Softw. Y1 - 2007 VL - 22 IS - 3 SP - 413 EP - 431 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 - JOUR A1 - Volkwein, S. A1 - Weiser, Martin T1 - Affine Invariant Convergence Analysis for Inexact Augmented Lagrangian SQP Methods JF - SIAM J. Control Optim. Y1 - 2002 VL - 41 IS - 3 SP - 875 EP - 899 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 - 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 - 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 - 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 - 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 framework, the new framework 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 - 2025 U6 - https://doi.org/10.1016/j.cam.2025.116675 VL - 470 ER - TY - GEN A1 - Lubkoll, Lars A1 - Schiela, Anton A1 - Weiser, Martin T1 - An optimal control problem in polyconvex hyperelasticity 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. T3 - ZIB-Report - 12-08 KW - polyconvex elasticity KW - implant design KW - optimal control Y1 - 2012 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-14745 SN - 1438-0064 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 - 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 - JOUR A1 - Weiser, Martin A1 - Schiela, Anton A1 - Deuflhard, Peter T1 - Asymptotic Mesh Independence of Newton’s Method Revisited JF - SIAM J. Num. Anal. Y1 - 2005 VL - 42 IS - 5 SP - 1830 EP - 1845 ER - 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 - GEN A1 - Schiela, Anton A1 - Weiser, Martin T1 - Barrier methods for a control problem from hyperthermia treatment planning 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. T3 - ZIB-Report - 09-36 KW - hyperthermia treatment planning KW - optimal control KW - barrier methods Y1 - 2009 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-11567 SN - 1438-0064 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 - 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 - 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 - JOUR A1 - Gellermann, Johanna A1 - Weihrauch, Mirko A1 - Cho, C. A1 - Wlodarczyk, Waldemar A1 - Fähling, Horst A1 - Felix, Roland A1 - Budach, Volker A1 - Weiser, Martin A1 - Nadobny, Johanna A1 - Wust, Peter T1 - Comparison of MR-thermography and planning calculations in phantoms JF - Medical Physics Y1 - 2006 VL - 33 SP - 3912 EP - 3920 ER - TY - JOUR A1 - Götschel, Sebastian A1 - Weiser, Martin T1 - Compression Challenges in Large Scale Partial Differential Equation Solvers JF - Algorithms N2 - Solvers for partial differential equations (PDEs) are one of the cornerstones of computational science. For large problems, they involve huge amounts of data that need to be stored and transmitted on all levels of the memory hierarchy. Often, bandwidth is the limiting factor due to the relatively small arithmetic intensity, and increasingly 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 over the recent decades. This paper surveys data compression challenges and discusses examples of corresponding solution approaches for PDE problems, covering all levels of the memory hierarchy from mass storage up to the main memory. We illustrate concepts for particular methods, with examples, and give references to alternatives. Y1 - 2019 U6 - https://doi.org/10.3390/a12090197 VL - 12 IS - 9 SP - 197 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 - 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 - 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 - GEN A1 - Borndörfer, Ralf A1 - Danecker, Fabian A1 - Weiser, Martin T1 - Convergence Properties of Newton's Method for Globally Optimal Free Flight Trajectory Optimization N2 - The algorithmic efficiency of Newton-based methods for Free Flight Trajectory Optimization is heavily influenced by the size of the domain of convergence. We provide numerical evidence that the convergence radius is much larger in practice than what the theoretical worst case bounds suggest. The algorithm can be further improved by a convergence-enhancing domain decomposition. T3 - ZIB-Report - 23-19 KW - shortest path KW - flight planning KW - free flight KW - optimal control KW - global optimization KW - Newton's method Y1 - 2023 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-91309 SN - 1438-0064 ER - TY - CHAP A1 - Borndörfer, Ralf A1 - Danecker, Fabian A1 - Weiser, Martin T1 - Convergence Properties of Newton’s Method for Globally Optimal Free Flight Trajectory Optimization T2 - 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023) N2 - The algorithmic efficiency of Newton-based methods for Free Flight Trajectory Optimization is heavily influenced by the size of the domain of convergence. We provide numerical evidence that the convergence radius is much larger in practice than what the theoretical worst case bounds suggest. The algorithm can be further improved by a convergence-enhancing domain decomposition. Y1 - 2023 U6 - https://doi.org/10.4230/OASIcs.ATMOS.2023.3 VL - 115 SP - 3:1 EP - 3:6 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 - GEN A1 - Götschel, Sebastian A1 - Weiser, Martin A1 - Maierhofer, Christiane A1 - Richter, Regina T1 - Data Enhancement for Active Thermography 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. T3 - ZIB-Report - 12-20 KW - data enhancement KW - active thermography KW - quantitative reconstruction KW - Green's functions Y1 - 2012 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-15243 UR - http://qirt.gel.ulaval.ca/archives/qirt2012/papers/QIRT-2012-167.pdf SN - 1438-0064 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 - 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 -