@article{DeuflhardWeiserSeebass2000, author = {Deuflhard, Peter and Weiser, Martin and Seebaß, Martin}, title = {A New Nonlinear Elliptic Multilevel FEM Applied to Regional Hyperthermia}, volume = {3}, journal = {Comput. Visual. Sci.}, doi = {10.1007/PL00013546}, pages = {1 -- 6}, year = {2000}, language = {en} } @article{HammerschmidtSchneiderSantiagoetal.2018, author = {Hammerschmidt, Martin and Schneider, Philipp-Immanuel and Santiago, Xavier Garcia and Zschiedrich, Lin and Weiser, Martin and Burger, Sven}, title = {Solving inverse problems appearing in design and metrology of diffractive optical elements by using Bayesian optimization}, volume = {10694}, journal = {Proc. SPIE}, doi = {10.1117/12.2315468}, pages = {1069407}, year = {2018}, language = {en} } @article{DeuflhardWeiserSeebass2000, author = {Deuflhard, Peter and Weiser, Martin and Seebass, Martin}, title = {A new nonlinear elliptic multilevel FEM in clinical cancer therapy planning}, volume = {3}, journal = {Comput. Vis. Sci.}, pages = {115 -- 120}, year = {2000}, language = {en} } @article{HammerschmidtWeiserSantiagoetal.2017, author = {Hammerschmidt, Martin and Weiser, Martin and Santiago, Xavier Garcia and Zschiedrich, Lin and Bodermann, Bernd and Burger, Sven}, title = {Quantifying parameter uncertainties in optical scatterometry using Bayesian inversion}, volume = {10330}, journal = {Proc. SPIE}, arxiv = {http://arxiv.org/abs/1707.08467}, doi = {10.1117/12.2270596}, pages = {1033004}, year = {2017}, language = {en} } @article{BecksLippoldWinkleretal.2024, author = {Becks, Henrik and Lippold, Lukas and Winkler, Paul and Rohrer, Maximilian and Leusmann, Thorsten and Anton, David and Sprenger, Bjarne and K{\"a}hler, Philipp and Rudenko, Iryna and Andr{\´e}s Arcones, Daniel and Koutsourelakis, Phaedon-Stelios and Unger, J{\"o}rg F. and Weiser, Martin and Petryna, Yuri and Schnellenbach-Held, Martina and Lowke, Dirk and Wessels, Henning and Lenzen, Armin and Zabel, Volkmar and K{\"o}nke, Carsten and Claßen, Martin and Hegger, Josef}, title = {Neuartige Konzepte f{\"u}r die Zustands{\"u}berwachung und -analyse von Br{\"u}ckenbauwerken - Einblicke in das Forschungsvorhaben SPP100+}, volume = {99}, journal = {Bauingenieur}, number = {10}, doi = {10.37544/0005-6650-2024-10-63}, pages = {327 -- 338}, year = {2024}, abstract = {Die Br{\"u}ckeninfrastruktur in Deutschland und Europa steht aufgrund steigender Verkehrslasten und alternder Bauwerke vor erheblichen Herausforderungen. Das DFG-Schwerpunktprogramm 2388 „Hundert plus - Verl{\"a}ngerung der Lebensdauer komplexer Baustrukturen durch intelligente Digitalisierung" (SPP100+) strebt an, durch digitale Innovationen und pr{\"a}diktive Instandhaltungsstrategien die Nutzungsdauer bestehender Br{\"u}ckenbauwerke zu verl{\"a}ngern. Der vorliegende Beitrag fokussiert sich auf das SPP100+ zugeh{\"o}rige Cluster „Monitoring und Simulation", das sieben Teilprojekte umfasst. Die Projekte entwickeln fortschrittliche Methoden zur {\"U}berwachung und Zustandsbewertung von Br{\"u}cken mittels Digitaler Zwillinge, hochaufl{\"o}sender Sensortechnik und numerischer Simulationen. Innovative Ans{\"a}tze wie nichtlineare Modellanpassungen, stochastische Methoden und k{\"u}nstliche Intelligenz erm{\"o}glichen eine pr{\"a}zise und fr{\"u}hzeitige Identifizierung potenzieller Sch{\"a}den. Die Kombination aus kontinuierlichem Bauwerksmonitoring und effizienter Datenauswertung ist entscheidend f{\"u}r die langfristige Sicherheit und Langlebigkeit bestehender Br{\"u}cken und tr{\"a}gt dar{\"u}ber hinaus zur Ressourcenschonung bei.}, language = {de} } @article{OzelKulkarniHasanetal.2019, author = {Ozel, Mehmet Neset and Kulkarni, Abhishek and Hasan, Amr and Brummer, Josephine and Moldenhauer, Marian and Daumann, Ilsa-Maria and Wolfenberg, Heike and Dercksen, Vincent J. and Kiral, Ferdi Ridvan and Weiser, Martin and Prohaska, Steffen and von Kleist, Max and Hiesinger, Peter Robin}, title = {Serial synapse formation through filopodial competition for synaptic seeding factors}, volume = {50}, journal = {Developmental Cell}, number = {4}, doi = {10.1016/j.devcel.2019.06.014}, pages = {447 -- 461}, year = {2019}, abstract = {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.}, language = {en} } @article{GoetschelWeiser2019, author = {G{\"o}tschel, Sebastian and Weiser, Martin}, title = {Compression Challenges in Large Scale Partial Differential Equation Solvers}, volume = {12}, journal = {Algorithms}, number = {9}, doi = {10.3390/a12090197}, pages = {197}, year = {2019}, abstract = {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.}, language = {en} } @article{PowellWeiser2000, author = {Powell, Gary and Weiser, Martin}, title = {Views, A new form of container adaptors}, volume = {18}, journal = {C/C++ Users Journal}, number = {4}, pages = {40 -- 51}, year = {2000}, abstract = {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.}, language = {en} } @article{WeiserGhosh2018, author = {Weiser, Martin and Ghosh, Sunayana}, title = {Theoretically optimal inexact SDC methods}, journal = {Communications in Applied Mathematics and Computational Science}, number = {13-1}, doi = {10.2140/camcos.2018.13.53}, pages = {53 -- 86}, year = {2018}, abstract = {In several inital value problems with particularly expensive right hand side evaluation or implicit step computation, there is a trade-off between accuracy and computational effort. We consider inexact spectral deferred correction (SDC) methods for solving such 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 error models bounding the total error in terms of the 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 local tolerance selection is worked out by minimizing the total work subject to achieving the requested tolerance. The properties of optimal local tolerances and the predicted efficiency gain compared to simpler heuristics, and a reasonable practical performance, are illustrated on simple numerical examples.}, language = {en} } @article{GriesseWeiser2008, author = {Griesse, Roland and Weiser, Martin}, title = {On the Interplay Between Interior Point Approximation and Parametric Sensitivities in Optimal Control}, journal = {Journal of Mathematical Analysis and Applications}, pages = {771 -- 793}, year = {2008}, language = {en} } @article{GellermannWeihrauchChoetal.2006, author = {Gellermann, Johanna and Weihrauch, Mirko and Cho, C. and Wlodarczyk, Waldemar and F{\"a}hling, Horst and Felix, Roland and Budach, Volker and Weiser, Martin and Nadobny, Johanna and Wust, Peter}, title = {Comparison of MR-thermography and planning calculations in phantoms}, volume = {33}, journal = {Medical Physics}, pages = {3912 -- 3920}, year = {2006}, language = {en} } @article{GaenzlerVolkweinWeiser2006, author = {G{\"a}nzler, Tobias and Volkwein, S. and Weiser, Martin}, title = {SQP methods for parameter identification problems arising in hyperthermia}, volume = {21}, journal = {Optim. Methods Softw.}, number = {6}, pages = {869 -- 887}, year = {2006}, language = {en} } @article{SchielaWeiser2008, author = {Schiela, Anton and Weiser, Martin}, title = {Superlinear convergence of the Control Reduced Interior Point Method for PDE Constrained Optimization}, volume = {39}, journal = {Computational Optimization and Applications}, number = {3}, pages = {369 -- 393}, year = {2008}, language = {en} } @article{Weiser2009, author = {Weiser, Martin}, title = {Pointwise Nonlinear Scaling for Reaction-Diffusion Equations}, volume = {59}, journal = {Appl. Num. Math.}, number = {8}, pages = {1858 -- 1869}, year = {2009}, language = {en} } @article{WeiserDeuflhardErdmann2007, author = {Weiser, Martin and Deuflhard, Peter and Erdmann, Bodo}, title = {Affine conjugate adaptive Newton methods for nonlinear elastomechanics}, volume = {22}, journal = {Opt. Meth. Softw.}, number = {3}, pages = {413 -- 431}, year = {2007}, language = {en} } @article{WeihrauchWustWeiseretal.2007, author = {Weihrauch, Mirko and Wust, Peter and Weiser, Martin and Nadobny, Johanna and Eisenhardt, Steffen and Budach, Volker and Gellermann, Johanna}, title = {Adaptation of antenna profiles for control of MR guided hyperthermia (HT) in a hybrid MR-HT system}, volume = {34}, journal = {Medical Physics}, number = {12}, pages = {4717 -- 4725}, year = {2007}, language = {en} } @article{Weiser2005, author = {Weiser, Martin}, title = {Interior point methods in function space}, volume = {44}, journal = {SIAM J. Control Optimization}, number = {5}, pages = {1766 -- 1786}, year = {2005}, language = {en} } @article{VolkweinWeiser2002, author = {Volkwein, S. and Weiser, Martin}, title = {Affine Invariant Convergence Analysis for Inexact Augmented Lagrangian SQP Methods}, volume = {41}, journal = {SIAM J. Control Optim.}, number = {3}, pages = {875 -- 899}, year = {2002}, language = {en} } @article{WeiserGaenzlerSchiela2008, author = {Weiser, Martin and G{\"a}nzler, Tobias and Schiela, Anton}, title = {A control reduced primal interior point method for a class of control constrained optimal control problems}, volume = {41}, journal = {Comput. Optim. Appl.}, number = {1}, pages = {127 -- 145}, year = {2008}, language = {en} } @article{WeiserSchiela2004, author = {Weiser, Martin and Schiela, Anton}, title = {Function space interior point methods for PDE constrained optimization}, volume = {4}, journal = {PAMM}, number = {1}, pages = {43 -- 46}, year = {2004}, language = {en} } @article{WeiserSchielaDeuflhard2005, author = {Weiser, Martin and Schiela, Anton and Deuflhard, Peter}, title = {Asymptotic Mesh Independence of Newton's Method Revisited}, volume = {42}, journal = {SIAM J. Num. Anal.}, number = {5}, pages = {1830 -- 1845}, year = {2005}, language = {en} } @article{Weiser2009, author = {Weiser, Martin}, title = {Optimization and Identification in Regional Hyperthermia}, volume = {30}, journal = {Int. J. Appl. Electromagn. and Mech.}, pages = {265 -- 275}, year = {2009}, language = {en} } @article{PruefertTroeltzschWeiser2008, author = {Pr{\"u}fert, Uwe and Tr{\"o}ltzsch, Fredi and Weiser, Martin}, title = {The convergence of an interior point method for an elliptic control problem with mixed control-state constraints}, volume = {39}, journal = {Comput. Optim. Appl.}, number = {2}, pages = {183 -- 218}, year = {2008}, language = {en} } @article{HorenkoWeiserSchmidtetal.2004, author = {Horenko, Illia and Weiser, Martin and Schmidt, Burkhard and Sch{\"u}tte, Christof}, title = {Fully Adaptive Propagation of the Quantum-Classical Liouville Equation}, volume = {120}, journal = {J. Chem. Phys.}, number = {19}, doi = {10.1063/1.1691015}, pages = {8913 -- 8923}, year = {2004}, language = {en} } @article{GoetschelNagaiahKunischetal.2014, author = {G{\"o}tschel, Sebastian and Nagaiah, Chamakuri and Kunisch, Karl and Weiser, Martin}, title = {Lossy Compression in Optimal Control of Cardiac Defibrillation}, volume = {60}, journal = {J. Sci. Comput.}, number = {1}, doi = {10.1007/s10915-013-9785-x}, pages = {35 -- 59}, year = {2014}, abstract = {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.}, language = {en} } @article{GoetschelWeiserMaierhoferetal.2013, author = {G{\"o}tschel, Sebastian and Weiser, Martin and Maierhofer, Christiane and Richter, Regina and R{\"o}llig, Mathias}, title = {Fast Defect Shape Reconstruction Based on the Travel Time in Pulse Thermography}, volume = {6}, journal = {Nondestructive Testing of Materials and Structures}, pages = {83 -- 89}, year = {2013}, language = {en} } @article{GoetschelWeiser2015, author = {G{\"o}tschel, Sebastian and Weiser, Martin}, title = {Lossy Compression for PDE-constrained Optimization: Adaptive Error Control}, volume = {62}, journal = {Comput. Optim. Appl.}, number = {1}, publisher = {Springer}, pages = {131 -- 155}, year = {2015}, abstract = {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.}, language = {en} } @article{SchenklMuggenthalerHubigetal.2017, author = {Schenkl, Sebastian and Muggenthaler, Holger and Hubig, Michael and Erdmann, Bodo and Weiser, Martin and Zachow, Stefan and Heinrich, Andreas and G{\"u}ttler, Felix Victor and Teichgr{\"a}ber, Ulf and Mall, Gita}, title = {Automatic CT-based finite element model generation for temperature-based death time estimation: feasibility study and sensitivity analysis}, volume = {131}, journal = {International Journal of Legal Medicine}, number = {3}, doi = {doi:10.1007/s00414-016-1523-0}, pages = {699 -- 712}, year = {2017}, abstract = {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.}, language = {en} } @article{WeiserFreytagErdmannetal.2018, author = {Weiser, Martin and Freytag, Yvonne and Erdmann, Bodo and Hubig, Michael and Mall, Gita}, title = {Optimal Design of Experiments for Estimating the Time of Death in Forensic Medicine}, volume = {34}, journal = {Inverse Problems}, number = {12}, doi = {10.1088/1361-6420/aae7a5}, pages = {125005}, year = {2018}, abstract = {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.}, language = {en} } @article{GoetschelSchielaWeiser2021, author = {G{\"o}tschel, Sebastian and Schiela, Anton and Weiser, Martin}, title = {Kaskade 7 - a Flexible Finite Element Toolbox}, volume = {81}, journal = {Computers and Mathematics with Applications}, doi = {10.1016/j.camwa.2020.02.011}, pages = {444 -- 458}, year = {2021}, abstract = {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.}, language = {en} } @article{AlhaddadFoerstnerGrothetal.2021, author = {Alhaddad, Samer and F{\"o}rstner, Jens and Groth, Stefan and Gr{\"u}newald, Daniel and Grynko, Yevgen and Hannig, Frank and Kenter, Tobias and Pfreundt, Franz-Josef and Plessl, Christian and Schotte, Merlind and Steinke, Thomas and Teich, J{\"u}rgen and Weiser, Martin and Wende, Florian}, title = {HighPerMeshes - A Domain-Specific Language for Numerical Algorithms on Unstructured Grids}, journal = {Euro-Par 2020: Parallel Processing Workshops.}, publisher = {Springer}, doi = {10.1007/978-3-030-71593-9_15}, pages = {185 -- 196}, year = {2021}, abstract = {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.}, language = {en} } @article{MoldenhauerWeiserZachow2017, author = {Moldenhauer, Marian and Weiser, Martin and Zachow, Stefan}, title = {Adaptive Algorithms for Optimal Hip Implant Positioning}, volume = {17}, journal = {PAMM}, number = {1}, doi = {10.1002/pamm.201710071}, pages = {203 -- 204}, year = {2017}, abstract = {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.}, language = {en} } @article{TierneyMiraReinholdetal.2018, author = {Tierney, Nicholas J. and Mira, Antonietta and Reinhold, J. Jost and Weiser, Martin and Burkart, Roman and Benvenuti, Claudio and Auricchio, Angelo}, title = {Novel relocation methods for automatic external defibrillator improve out-of-hospital cardiac arrest coverage under limited resources}, journal = {Resuscitation}, number = {125}, doi = {10.1016/j.resuscitation.2018.01.055}, pages = {83 -- 89}, year = {2018}, abstract = {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.}, language = {en} } @article{WeiserErdmannSchenkletal.2018, author = {Weiser, Martin and Erdmann, Bodo and Schenkl, Sebastian and Muggenthaler, Holger and Hubig, Michael and Mall, Gita and Zachow, Stefan}, title = {Uncertainty in Temperature-Based Determination of Time of Death}, volume = {54}, journal = {Heat and Mass Transfer}, number = {9}, publisher = {Springer}, doi = {10.1007/s00231-018-2324-4}, pages = {2815 -- 2826}, year = {2018}, abstract = {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.}, language = {en} } @article{SchneckWeiserWende2021, author = {Schneck, Jakob and Weiser, Martin and Wende, Florian}, title = {Impact of mixed precision and storage layout on additive Schwarz smoothers}, volume = {28}, journal = {Numerical Linear Algebra with Applications}, number = {4}, doi = {10.1002/nla.2366}, year = {2021}, abstract = {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.}, language = {en} } @article{SchenkWaechterWeiser2008, author = {Schenk, O. and W{\"a}chter, Andreas and Weiser, Martin}, title = {Inertia Revealing Preconditioning For Large-Scale Nonconvex Constrained Optimization}, volume = {31}, journal = {SIAM J. Sci. Comp.}, number = {2}, pages = {939 -- 960}, year = {2008}, language = {en} } @article{WeiserDeuflhard2007, author = {Weiser, Martin and Deuflhard, Peter}, title = {Inexact central path following algorithms for optimal control problems}, volume = {46}, journal = {SIAM J. Control Opt.}, number = {3}, pages = {792 -- 815}, year = {2007}, language = {en} } @article{DeuflhardWeiserZachow2006, author = {Deuflhard, Peter and Weiser, Martin and Zachow, Stefan}, title = {Mathematics in Facial Surgery}, volume = {53}, journal = {AMS Notices}, number = {9}, pages = {1012 -- 1016}, year = {2006}, language = {en} } @article{WeiserZachowDeuflhard2010, author = {Weiser, Martin and Zachow, Stefan and Deuflhard, Peter}, title = {Craniofacial Surgery Planning Based on Virtual Patient Models}, volume = {52}, journal = {it - Information Technology}, number = {5}, publisher = {Oldenbourg Verlagsgruppe}, doi = {10.1524/itit.2010.0600}, pages = {258 -- 263}, year = {2010}, language = {en} } @article{FischerGoetschelWeiser2018, author = {Fischer, Lisa and G{\"o}tschel, Sebastian and Weiser, Martin}, title = {Lossy data compression reduces communication time in hybrid time-parallel integrators}, volume = {19}, journal = {Comput. Vis. Sci.}, number = {1}, doi = {10.1007/s00791-018-0293-2}, pages = {19 -- 30}, year = {2018}, abstract = {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.}, language = {en} } @article{MoualeuNgangueWeiserEhrigetal.2015, author = {Moualeu-Ngangue, Dany Pascal and Weiser, Martin and Ehrig, Rainald and Deuflhard, Peter}, title = {Optimal control for a tuberculosis model with undetected cases in Cameroon}, volume = {20}, journal = {Communications in Nonlinear Science and Numerical Simulation}, number = {3}, doi = {10.1016/j.cnsns.2014.06.037}, pages = {986 -- 1003}, year = {2015}, abstract = {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.}, language = {en} } @article{Weiser2013, author = {Weiser, Martin}, title = {On goal-oriented adaptivity for elliptic optimal control problems}, volume = {28}, journal = {Opt. Meth. Softw.}, number = {13}, pages = {969 -- 992}, year = {2013}, abstract = {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.}, language = {en} } @article{DeuflhardSchielaWeiser2012, author = {Deuflhard, Peter and Schiela, Anton and Weiser, Martin}, title = {Mathematical Cancer Therapy Planning in Deep Regional Hyperthermia}, volume = {21}, journal = {Acta Numerica}, pages = {307 -- 378}, year = {2012}, abstract = {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.}, language = {en} } @article{Weiser2015, author = {Weiser, Martin}, title = {Faster SDC convergence on non-equidistant grids by DIRK sweeps}, volume = {55}, journal = {BIT Numerical Mathematics}, number = {4}, doi = {10.1007/s10543-014-0540-y}, pages = {1219 -- 1241}, year = {2015}, abstract = {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.}, language = {en} } @article{WeiserGoetschel2012, author = {Weiser, Martin and G{\"o}tschel, Sebastian}, title = {State Trajectory Compression for Optimal Control with Parabolic PDEs}, volume = {34}, journal = {SIAM J. Sci. Comput.}, number = {1}, doi = {10.1137/11082172X}, pages = {A161 -- A184}, year = {2012}, abstract = {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.}, language = {en} } @article{GoetschelWeiser2010, author = {G{\"o}tschel, Sebastian and Weiser, Martin}, title = {State Trajectory Compression in Optimal Control}, volume = {10}, journal = {PAMM}, number = {1}, doi = {10.1002/pamm.201010282}, pages = {579 -- 580}, year = {2010}, abstract = {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.}, language = {en} } @article{WilhelmsSeemannWeiseretal.2010, author = {Wilhelms, Mathias and Seemann, Gunnar and Weiser, Martin and D{\"o}ssel, Olaf}, title = {Benchmarking Solvers of the Monodomain Equation in Cardiac Electrophysiological Modeling}, volume = {55}, journal = {Biomed. Engineer.}, doi = {10.1515/BMT.2010.712}, pages = {99 -- 102}, year = {2010}, language = {en} } @article{LubkollSchielaWeiser2014, author = {Lubkoll, Lars and Schiela, Anton and Weiser, Martin}, title = {An optimal control problem in polyconvex hyperelasticity}, volume = {52}, journal = {SIAM J. Control Opt.}, number = {3}, doi = {10.1137/120876629}, pages = {1403 -- 1422}, year = {2014}, abstract = {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.}, language = {en} } @article{GuentherLameckerWeiser2013, author = {G{\"u}nther, Andreas and Lamecker, Hans and Weiser, Martin}, title = {Flexible Shape Matching with Finite Element Based LDDMM}, volume = {105}, journal = {International Journal of Computer Vision}, number = {2}, doi = {10.1007/s11263-012-0599-3}, pages = {128 -- 143}, year = {2013}, abstract = {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.}, language = {en} } @article{WeiserRoelligArndtetal.2010, author = {Weiser, Martin and R{\"o}llig, Mathias and Arndt, Ralf and Erdmann, Bodo}, title = {Development and test of a numerical model for pulse thermography in civil engineering}, volume = {46}, journal = {Heat and Mass Transfer}, number = {11-12}, pages = {1419 -- 1428}, year = {2010}, abstract = {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.}, language = {en} }