ZIB-Report
Refine
Year of publication
Document Type
- ZIB-Report (62)
Has Fulltext
- yes (62)
Is part of the Bibliography
- no (62)
Keywords
- optimal control (19)
- interior point methods in function space (6)
- trajectory storage (4)
- finite elements (3)
- lossy compression (3)
- state constraints (3)
- Newton-CG (2)
- adaptive finite elements (2)
- complementarity functions (2)
- compression (2)
- discretization error (2)
- error estimation (2)
- finite element method (2)
- flight planning (2)
- free flight (2)
- generic programming (2)
- human mandible (2)
- hyperthermia treatment planning (2)
- interior point methods (2)
- nondestructive testing (2)
- parameter identification (2)
- partial differential equations (2)
- reaction-diffusion equations (2)
- shortest path (2)
- (visco-)elasticity (1)
- Adaptive Finite Elements (1)
- Affine invariant Newton methods (1)
- Burgers' equation (1)
- C++ (1)
- Currents (1)
- Diffeomorphic Registration (1)
- Dynamical contact problems (1)
- Elliptic optimal control problem (1)
- Gaussian Process (1)
- Green's functions (1)
- Hamilton systems (1)
- Hamiltonian dynamics (1)
- Hyperthermie-Therapieplanung (1)
- ILDM (1)
- Identifizierung (1)
- Innere-Punkte-Methoden (1)
- KARDOS (1)
- Large Deformation (1)
- Lavrentiev regularization (1)
- MPI (1)
- MR thermometry (1)
- MR-Thermometrie (1)
- Markov chain (1)
- Matching (1)
- Maxwell equations (1)
- Newmark method (1)
- Newton method (1)
- Newton's method (1)
- Nonlinear dynamical systems (1)
- ODE boundary value problems (1)
- Optimal control (1)
- Optimal design of computer experiments (1)
- PDE (1)
- PDE-constrained optimization (1)
- PFASST (1)
- Perro (1)
- QSSA (1)
- STL (1)
- Signorini condition (1)
- Sparse kernels (1)
- Spectral deferred correction, initial value problems, error propagation, adaptive control of tolerances (1)
- Tuberculosis (1)
- active thermography (1)
- adaptive Newton (1)
- adaptive grid refinement (1)
- adaptive mesh refinement (1)
- adaptive methods (1)
- adaptive time integration (1)
- adaptive trust region methods (1)
- adjoint gradient computation (1)
- affine conjugate Newton methods (1)
- affine covariant (1)
- affine invariance (1)
- affine invariant norms (1)
- almost invariant sets (1)
- anisotropy (1)
- barrier methods (1)
- bio-heat equation (1)
- bony organ simulation (1)
- cardiac Bidomain and Monodomain models (1)
- civil engineering (1)
- collocation method (1)
- composite step methods (1)
- conformational dynamics (1)
- conformations (1)
- convergence (1)
- cranio-maxillofacial surgery (1)
- cubic regularization (1)
- d (1)
- data compression (1)
- data enhancement (1)
- defibrillation (1)
- determination of time of death (1)
- dimension reduction (1)
- discrete optimization (1)
- discrete-continuous algorithm (1)
- drug design (1)
- elasticity (1)
- error estimates (1)
- finite element analysis (1)
- finite element model (1)
- floating point compression (1)
- forensic medicine (1)
- geometry identification (1)
- global Newton methods (1)
- global optimization (1)
- heat transfer equation (1)
- homogenization (1)
- hybrid parareal (1)
- hyperthermia (1)
- hyperthermia therapy planning (1)
- identification (1)
- implant design (1)
- inertia (1)
- inexact Newton Lagrange (1)
- inexact Newton methods (1)
- interior point method (1)
- interior-point method (1)
- inverse problems (1)
- inverse solution (1)
- isotropic linear elasticity (1)
- local grid refinement (1)
- mandible (1)
- masticatory muscles (1)
- mathematical modelling (1)
- mesh compression (1)
- mesh independence (1)
- metastability (1)
- mixed control-state constraints (1)
- model reduction (1)
- molecular dynamics (1)
- monodomain model (1)
- multilev (1)
- multilevel incomplete factorization (1)
- multiplier methods (1)
- nonconvex constrained optimization (1)
- nonconvex minimization (1)
- nonlinear elastomechnics (1)
- nonlinear partial differential equa (1)
- nonlinear partial differential equations (1)
- nonlinear programming (1)
- nonlinear scaling (1)
- optimality conditions (1)
- optimization with PDEs (1)
- parallel-in-time integration (1)
- parallel-in-time methods (1)
- partial differential equation (1)
- pointwise state constraints (1)
- polyconvex elasticity (1)
- polyreaction kinetics (1)
- pulse thermography (1)
- quantitative reconstruction (1)
- ray tracing (1)
- reaction kinetics (1)
- semilinear parabolic PDEs (1)
- sensitivity analysis (1)
- sensitivity i.r.t. geometric resolution (1)
- sensitivity i.r.t. thermal parameters (1)
- soft tissue simulation (1)
- spectral deferred correction (1)
- stability (1)
- superlinear convergence (1)
- thermography (1)
- transition operator (1)
- travelling waves (1)
- ultrasonics (1)
- views (1)
- visualization of tissue quality (1)
Institute
- Computational Medicine (62) (remove)
23-19
Convergence Properties of Newton's Method for Globally Optimal Free Flight Trajectory Optimization
(2023)
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.
20-33
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.
19-48
Kaskade 7 is a finite element toolbox for the solution of stationary or transient systems of partial differential equations, aimed at supporting application-oriented research in numerical analysis and scientific computing. The library is written in C++ and is based on the Dune interface. The code is independent of spatial dimension and works with different grid managers. An important feature is the mix-and-match approach to discretizing systems of PDEs with different ansatz and test spaces for all variables.
We describe the mathematical concepts behind the library as well as its structure, illustrating its use at several examples on the way.
19-32
Solvers for partial differential equations (PDE) are one of the cornerstones of computational science. For large problems, they involve huge amounts of data that needs to be stored and transmitted on all levels of the memory hierarchy. Often, bandwidth is the limiting factor due to relatively small arithmetic intensity, and increasingly so due to the growing disparity between computing power and bandwidth. Consequently, data compression techniques have been investigated and tailored towards the specific requirements of PDE solvers during the last decades. This paper surveys data compression challenges and corresponding solution approaches for PDE problems, covering all levels of the memory hierarchy from mass storage up to main memory. Exemplarily, we illustrate concepts at particular methods, and give references to alternatives.
19-04
To solve optimization problems with parabolic PDE constraints, often methods working on the reduced objective functional are used. They are computationally expensive due to the necessity of solving both the state equation and a backward-in-time adjoint equation to evaluate the reduced gradient in each iteration of the optimization method. In this study, we investigate the use of the parallel-in-time method PFASST in the setting of PDE constrained optimization. In order to develop an efficient fully time-parallel algorithm we discuss different options for applying PFASST to adjoint gradient computation, including the possibility of doing PFASST iterations on both the state and adjoint equations simultaneously. We also explore the additional gains in efficiency from reusing information from previous optimization iterations when solving each equation. Numerical results for both a linear and a non-linear reaction-diffusion optimal control problem demonstrate the parallel speedup and efficiency of different approaches.
18-08
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.
17-53
Spectral deferred correction (SDC) Methoden, vorgestellt von Dutt, Greengard und
Rokhlin in [1], sind iterative Verfahren zur numerischen Lösung von Anfangswertproblemen für gewöhnliche Differentialgleichungen. Wenn diese Methoden konvergieren, dann wird unter Verwendung von Zeitschrittverfahren niedriger Ordnung eine Kollokationslösung berechnet. Die Lösung von steifen Anfangswertproblemen ist eine relevante Problemstellung in der numerischen Mathematik. SDC-Methoden, speziell für steife Probleme, werden von Martin Weiser in [2] konstruiert. Die Theorie und die Experimente beziehen sich dabei auf Probleme, die aus räumlich semidiskretisierten Reaktions-Diffusions-Gleichungen entstehen.
In dieser Arbeit werden die Ansätze aus [2] auf Konvektions-Diffusions-Gleichungen
angewendet und das resultierende Konvergenzverhalten von SDC-Methoden untersucht.
Basierend auf einem einfachen Konvektions-Diffusions-Operator, dessen spektrale Eigenschaften umfassend studiert werden, wird ein Schema zur Verbesserung dieses Verhaltens entwickelt. Numerische Experimente zeigen, dass eine Verbesserung der in [1] eingeführten SDC-Methoden möglich ist. Die Untersuchungen ergeben weiterhin, dass das auch für komplexere Konvektions-Diffusions-Probleme gilt.
[1] Alok Dutt, Leslie Greengard, und Vladimir Rokhlin. “Spectral deferred correction
methods for ordinary differential equations.” In: BIT 40.2 (2000), pp. 241–266.
[2] Martin Weiser. “Faster SDC convergence on non-equidistant grids by DIRK
sweeps.” In: BIT 55.4 (2015), pp. 1219–1241.
17-51
In gradient-based methods for parabolic optimal control problems, it is necessary to solve both the state equation and a backward-in-time adjoint equation in each iteration of the optimization method. In order to facilitate fully parallel gradient-type and nonlinear conjugate gradient methods for the solution of such optimal control problems, we discuss the application of the parallel-in-time method PFASST to adjoint gradient computation. In addition to enabling time parallelism, PFASST provides high flexibility for handling nonlinear equations, as well as potential extra computational savings from reusing previous solutions in the optimization loop. The approach is demonstrated here for a model reaction-diffusion optimal control problem.
17-25
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.
17-18
Temperature-based estimation of time of death (ToD) can be per-
formed either with the help of simple phenomenological models of corpse
cooling or with detailed mechanistic (thermodynamic) heat transfer mod-
els. The latter are much more complex, but allow a higher accuracy of
ToD estimation as in principle all relevant cooling mechanisms can be
taken into account.
The potentially higher accuracy depends on the accuracy of tissue and
environmental parameters as well as on the geometric resolution. We in-
vestigate the impact of parameter variations and geometry representation
on the estimated ToD based on a highly detailed 3D corpse model, that
has been segmented and geometrically reconstructed from a computed to-
mography (CT) data set, differentiating various organs and tissue types.
From that we identify the most crucial parameters to measure or estimate,
and obtain a local uncertainty quantifcation for the ToD.
17-14
This thesis is devoted to the interdisciplinary work between mathematicians and forensic
experts: the modeling of the human body cooling process after death laying the
foundation for the estimation of the time of death. An inverse problem needs to be
solved. In this thesis the inverse problem computes the time of death given the measured
body temperature and the Forward Model that simulates the body cooling
process. The Forward Model is based on the heat equation established by Fourier.
This differential equation is numerically solved by the discretization over space by the
Finite Element Method and the discretization over time by the Implicit Euler Method.
The applications in this thesis demand a fast computation time. A model reduction is
achieved by the Proper Orthogonal Decomposition in combination with the Galerkin
Method. For reasons of simplification the computations and the measurements are
restricted to a cylindrical phantom that is made out of homogeneous polyethylene.
The estimate of the time of death is accompanied by an uncertainty. The inverse problem
is incorporated by Bayesian inference to interpret the quality of the estimate and
the effciency of the experiment. The uncertainty of the estimate of the time of death
is minimized by approaching the Optimal Design of the Experiment. An objective
function measures the certainty of the data and lays the foundation of the optimization
problem. Solving the optimization problem is successfully done by relaxing the
complex discrete NP-hard problem and applying a gradient-based method.
The results of this thesis clearly show that the design of an experiment has a great in-
uence on the outcome of the quality of the estimate. The comparison of the estimate
and its properties based on different designs and conditions reveals the effciency of
the Design of Experiment in the context of the estimation of the time of death.
16-52
In several inital value problems with particularly expensive right hand side computation, there is a trade-off between accuracy and computational effort in evaluating the right hand sides. We consider inexact spectral deferred correction (SDC) methods for solving such non-stiff initial value problems. SDC methods are interpreted as fixed point iterations and, due to their corrective iterative nature, allow to exploit the accuracy-work-tradeoff for a reduction of the total computational effort. On one hand we derive an error model bounding the total error in terms of the right hand side evaluation errors. On the other hand, we define work models describing the computational effort in terms of the evaluation accuracy. Combining both, a theoretically optimal tolerance selection is worked out by minimizing the total work subject to achieving the requested tolerance.
16-50
The primary goal of this paper is to study the coupling of monodomain and eikonal
models for the numerical simulation of cardiac electrophysiology.
Eikonal models are nonlinear elliptic equations describing the excitation time of the
cardiac tissue. They are often used as very fast approximations for monodomain
or bidomain models - parabolic reaction-diffusion systems describing the excitation
wavefront in terms of ionic currents. The excitation front is a thin region with high
gradients, whereas excitation times vary over larger domains. Hence, eikonal equations
can be solved on much coarser grids than monodomain equations. Moreover,
as eikonal models are not time-dependent, no time integration is needed.
Eikonal models are derived from monodomain models making additional assumptions
and using certain approximations. While generally the approximation is rather
good, several specific situations are not well captured by eikonal models. We consider
coupling the two models, i.e. using the monodomain model in regions where more
accurate results or the shape of the wavefront are needed, and the eikonal model in
the remaining parts of the domain, where the excitation time is sufficient. Restricting
the monodomain simulation to a small subdomain reduces the computational
effort considerably.
Numerical methods for the simulation of the individual models are presented, with
the finite element method as the main ingredient. Coupling conditions as well as
algorithms for implementing the coupling are explained. The approximation quality
and efficiency of the coupled model is illustrated on simple geometries using an
Aliev-Panfilov membrane model.
16-33
Statistical methods to design computer experiments usually rely on a Gaussian process (GP) surrogate model, and typically aim at selecting design points (combinations of algorithmic and model parameters) that minimize the average prediction variance, or maximize the prediction accuracy for the hyperparameters of the GP surrogate.
In many applications, experiments have a tunable precision, in the sense that one software parameter controls the tradeoff between accuracy and computing time (e.g., mesh size in FEM simulations or number of Monte-Carlo samples).
We formulate the problem of allocating a budget of computing time over a finite set of candidate points for the goals mentioned above. This is a continuous optimization problem, which is moreover convex whenever the tradeoff function accuracy vs. computing time is concave.
On the other hand, using non-concave weight functions can help to identify sparse designs. In addition, using sparse kernel approximations drastically reduce the cost per iteration of the multiplicative weights updates that can be used to solve this problem.
16-14
Ray Tracing Boundary Value Problems: Simulation and SAFT Reconstruction for Ultrasonic Testing
(2016)
The application of advanced imaging techniques for the ultrasonic inspection of inhomogeneous anisotropic materials like austenitic and dissimilar welds requires information about acoustic wave propagation through the material, in particular travel times between two points in the material. Forward ray tracing is a popular approach to determine traveling paths and arrival times but is ill suited for inverse problems since a large number of rays have to be computed in order to arrive at prescribed end points.
In this contribution we discuss boundary value problems for acoustic rays, where the ray path between two given points is determined by solving the eikonal equation. The implementation of such a two point boundary value ray tracer for sound field simulations through an austenitic weld is described and its efficiency as well as the obtained results are compared to those of a forward ray tracer. The results are validated by comparison with experimental results and commercially available UT simulation tools.
As an application, we discuss an implementation of the method for SAFT (Synthetic Aperture Focusing Technique) reconstruction. The ray tracer calculates the required travel time through the anisotropic columnar grain structure of the austenitic weld. There, the formulation of ray tracing as a boundary value problem allows a straightforward derivation of the ray path from a given transducer position to any pixel in the reconstruction area and reduces the computational cost considerably.
16-13
Carbon-fiber reinforced composites are becoming more and more important in the production of light-weight structures, e.g., in the automotive and aerospace industry. Thermography is often used for non-destructive testing of these products, especially to detect delaminations between different layers of the composite.
In this presentation, we aim at methods for defect reconstruction from thermographic measurements of such carbon-fiber reinforced composites. The reconstruction results shall not only allow to locate defects, but also give a quantitative characterization of the defect properties. We discuss the simulation of the measurement process using finite element methods, as well as the experimental validation on flat bottom holes.
Especially in pulse thermography, thin boundary layers with steep temperature gradients occurring at the heated surface need to be resolved. Here we use the combination of a 1D analytical solution combined with numerical solution of the remaining defect equation. We use the simulations to identify material parameters from the measurements.
Finally, fast heuristics for reconstructing defect geometries are applied to the acquired data, and compared for their accuracy and utility in detecting different defects like back surface defects or delaminations.
15-09
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.
14-22
Spectral Deferred Correction methods for adaptive electro-mechanical coupling in cardiac simulation
(2014)
We investigate spectral deferred correction (SDC) methods for time stepping
and their interplay with spatio-temporal adaptivity, applied to the solution
of the cardiac electro-mechanical coupling model. This model consists
of the Monodomain equations, a reaction-diffusion system modeling the cardiac
bioelectrical activity, coupled with a quasi-static mechanical model describing
the contraction and relaxation of the cardiac muscle. The numerical
approximation of the cardiac electro-mechanical coupling is a challenging
multiphysics problem, because it exhibits very different spatial and temporal
scales. Therefore, spatio-temporal adaptivity is a promising approach
to reduce the computational complexity. SDC methods are simple iterative
methods for solving collocation systems. We exploit their flexibility for combining
them in various ways with spatio-temporal adaptivity. The accuracy
and computational complexity of the resulting methods are studied on some
numerical examples.
13-73
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
13-37
Bei der numerischen Lösung von Optimalsteuerungsproblemen mit
elliptischen partiellen Differentialgleichungen als Nebenbedingung
treten unvermeidlich Diskretisierungs- und Iterationsfehler auf.
Man ist aus Aufwandsgründen daran interessiert die dabei entstehenden
Fehler nicht sehr klein wählen zu müssen. In der Folge werden die linearisierten Nebenbedingungen in einem Composite-Step-Verfahren nicht exakt erfüllt. In dieser Arbeit wird der Einfluss dieser Ungenauigkeit auf das Konvergenzverhalten von Newton-Lagrange-Verfahren untersucht.
Dabei sollen mehrere einschlägige lokale Konvergenzresultate diskutiert werden.
Anschließend wird ein konkretes Composite-Step-Verfahren formuliert, in dem die Genauigkeit der
inneren Iterationsverfahren adaptiv gesteuert werden kann.
Am Ende der Arbeit wird an zwei Musterproblemen die hohe Übereinstimmung der analytischen
Voraussagen und der tatsächlichen Performanz der dargestellten Methoden demonstriert.