TY - GEN A1 - Deuflhard, Peter A1 - Schiela, Anton A1 - Weiser, Martin T1 - Mathematical Cancer Therapy Planning in Deep Regional Hyperthermia 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. T3 - ZIB-Report - 11-39 KW - hyperthermia therapy planning KW - mathematical modelling KW - Maxwell equations KW - state constraints KW - parameter identification Y1 - 2011 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-14204 SN - 1438-0064 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 - GEN A1 - Prüfert, Uwe A1 - Tröltzsch, Fredi A1 - Weiser, Martin T1 - The convergence of an interior point method for an elliptic control problem with mixed control-state constraints N2 - The paper addresses primal interior point method for state constrained PDE optimal control problems. By a Lavrentiev regularization, the state constraint is transformed to a mixed control-state constraint with bounded Lagrange multiplier. Existence and convergence of the central path are established, and linear convergence of a short-step pathfollowing method is shown. The behaviour of the regularizations are demonstrated by numerical examples. T3 - ZIB-Report - 04-47 KW - interior point methods in function space KW - optimal control KW - mixed control-state constraints KW - Lavrentiev regularization Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8223 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 - 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 - GEN A1 - Götschel, Sebastian A1 - Nagaiah, Chamakuri A1 - Kunisch, Karl A1 - Weiser, Martin T1 - Lossy Compression in Optimal Control of Cardiac Defibrillation N2 - This paper presents efficient computational techniques for solving an optimization problem in cardiac defibrillation governed by the monodomain equations. Time-dependent electrical currents injected at different spatial positions act as the control. Inexact Newton-CG methods are used, with reduced gradient computation by adjoint solves. In order to reduce the computational complexity, adaptive mesh refinement for state and adjoint equations is performed. To reduce the high storage and bandwidth demand imposed by adjoint gradient and Hessian-vector evaluations, a lossy compression technique for storing trajectory data is applied. An adaptive choice of quantization tolerance based on error estimates is developed in order to ensure convergence. The efficiency of the proposed approach is demonstrated on numerical examples. T3 - ZIB-Report - 13-26 KW - monodomain model KW - defibrillation KW - optimal control KW - Newton-CG KW - trajectory storage KW - compression Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-18566 SN - 1438-0064 ER - TY - GEN A1 - Götschel, Sebastian A1 - Weiser, Martin T1 - Lossy Compression for PDE-constrained Optimization: Adaptive Error Control N2 - For the solution of optimal control problems governed by nonlinear parabolic PDEs, methods working on the reduced objective functional are often employed to avoid a full spatio-temporal discretization of the problem. The evaluation of the reduced gradient requires one solve of the state equation forward in time, and one backward solve of the ad-joint equation. The state enters into the adjoint equation, requiring the storage of a full 4D data set. If Newton-CG methods are used, two additional trajectories have to be stored. To get numerical results which are accurate enough, in many case very fine discretizations in time and space are necessary, which leads to a significant amount of data to be stored and transmitted to mass storage. Lossy compression methods were developed to overcome the storage problem by reducing the accuracy of the stored trajectories. The inexact data induces errors in the reduced gradient and reduced Hessian. In this paper, we analyze the influence of such a lossy trajectory compression method on Newton-CG methods for optimal control of parabolic PDEs and design an adaptive strategy for choosing appropriate quantization tolerances. T3 - ZIB-Report - 13-27 KW - optimal control KW - semilinear parabolic PDEs KW - Newton-CG KW - trajectory storage KW - lossy compression Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-18575 SN - 1438-0064 ER - TY - GEN A1 - Weiser, Martin T1 - Faster SDC convergence on non-equidistant grids by DIRK sweeps 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. T3 - ZIB-Report - 13-30 KW - spectral deferred correction Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-18662 SN - 1438-0064 ER - TY - GEN 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 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 T3 - ZIB-Report - 13-73 KW - Tuberculosis KW - Optimal control KW - Nonlinear dynamical systems Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-43142 SN - 1438-0064 ER - TY - JOUR A1 - Ozel, Mehmet 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, Ferdi 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 JF - Developmental Cell 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. Y1 - 2019 U6 - https://doi.org/10.1016/j.devcel.2019.06.014 VL - 50 IS - 4 SP - 447 EP - 461 ER - TY - GEN A1 - Schneck, Jakob A1 - Weiser, Martin A1 - Wende, Florian T1 - Impact of mixed precision and storage layout on additive Schwarz smoothers 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. T3 - ZIB-Report - 18-62 KW - higher order finite elements KW - mixed precision KW - overlapping Schwarz smoother Y1 - 2019 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-71305 SN - 1438-0064 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 - Götschel, Sebastian A1 - von Tycowicz, Christoph A1 - Polthier, Konrad A1 - Weiser, Martin T1 - Reducing Memory Requirements in Scientific Computing and Optimal Control N2 - In high accuracy numerical simulations and optimal control of time-dependent processes, often both many time steps and fine spatial discretizations are needed. Adjoint gradient computation, or post-processing of simulation results, requires the storage of the solution trajectories over the whole time, if necessary together with the adaptively refined spatial grids. In this paper we discuss various techniques to reduce the memory requirements, focusing first on the storage of the solution data, which typically are double precision floating point values. We highlight advantages and disadvantages of the different approaches. Moreover, we present an algorithm for the efficient storage of adaptively refined, hierarchic grids, and the integration with the compressed storage of solution data. T3 - ZIB-Report - 13-64 KW - optimal control KW - trajectory storage KW - mesh compression KW - compression Y1 - 2013 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-42695 SN - 1438-0064 ER - TY - JOUR A1 - Powell, Gary A1 - Weiser, Martin T1 - Views, A new form of container adaptors JF - C/C++ Users Journal 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. Y1 - 2000 VL - 18 IS - 4 SP - 40 EP - 51 ER -