Refine
Year of publication
Document Type
- ZIB-Report (41) (remove)
Language
- English (41)
Has Fulltext
- yes (41)
Is part of the Bibliography
- no (41)
Keywords
- optimal control (16)
- interior point methods in function space (5)
- trajectory storage (4)
- finite elements (3)
- lossy compression (3)
- Newton-CG (2)
- complementarity functions (2)
- compression (2)
- discretization error (2)
- flight planning (2)
- free flight (2)
- generic programming (2)
- hyperthermia treatment planning (2)
- interior point methods (2)
- nondestructive testing (2)
- parameter identification (2)
- partial differential equations (2)
- shortest path (2)
- Adaptive Finite Elements (1)
- Affine invariant Newton methods (1)
- Burgers' equation (1)
- C++ (1)
- Currents (1)
- Diffeomorphic Registration (1)
- Gaussian Process (1)
- Green's functions (1)
- Hyperthermie-Therapieplanung (1)
- Identifizierung (1)
- Innere-Punkte-Methoden (1)
- KARDOS (1)
- Large Deformation (1)
- Lavrentiev regularization (1)
- MPI (1)
- MR thermometry (1)
- MR-Thermometrie (1)
- Matching (1)
- Maxwell equations (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)
- STL (1)
- Sparse kernels (1)
- Spectral deferred correction, initial value problems, error propagation, adaptive control of tolerances (1)
- Tuberculosis (1)
- active thermography (1)
- adaptive mesh refinement (1)
- adaptive methods (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)
- barrier methods (1)
- civil engineering (1)
- collocation method (1)
- composite step methods (1)
- convergence (1)
- cranio-maxillofacial surgery (1)
- cubic regularization (1)
- data compression (1)
- data enhancement (1)
- defibrillation (1)
- determination of time of death (1)
- discrete optimization (1)
- discrete-continuous algorithm (1)
- error estimation (1)
- finite element method (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)
- hybrid parareal (1)
- hyperthermia therapy planning (1)
- identification (1)
- implant design (1)
- inertia (1)
- inexact Newton methods (1)
- interior-point method (1)
- inverse problems (1)
- inverse solution (1)
- mathematical modelling (1)
- mesh compression (1)
- mesh independence (1)
- mixed control-state constraints (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)
- optimization with PDEs (1)
- parallel-in-time integration (1)
- partial differential equation (1)
- polyconvex elasticity (1)
- pulse thermography (1)
- quantitative reconstruction (1)
- ray tracing (1)
- reaction-diffusion equations (1)
- semilinear parabolic PDEs (1)
- sensitivity i.r.t. geometric resolution (1)
- sensitivity i.r.t. thermal parameters (1)
- soft tissue simulation (1)
- spectral deferred correction (1)
- state constraints (1)
- superlinear convergence (1)
- thermography (1)
- travelling waves (1)
- ultrasonics (1)
- views (1)
Institute
- Computational Medicine (41) (remove)
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.
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.
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.
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.
A new approach to the numerical solution of optimal control problems including control and state constraints is presented. Like hybrid methods, the approach aims at combining the advantages of direct and indirect methods. Unlike hybrid methods, however, our method is directly based on interior-point concepts in function space --- realized via an adaptive multilevel scheme applied to the complementarity formulation and numerical continuation along the central path. Existence of the central path and its continuation towards the solution point is analyzed in some theoretical detail. An adaptive stepsize control with respect to the duality gap parameter is worked out in the framework of affine invariant inexact Newton methods. Finally, the performance of a first version of our new type of algorithm is documented by the successful treatment of the well-known intricate windshear problem.
A thorough convergence analysis of the Control Reduced Interior Point Method in function space is performed. This recently proposed method is a primal interior point pathfollowing scheme with the special feature, that the control variable is eliminated from the optimality system. Apart from global linear convergence we show, that this method converges locally almost quadratically, if the optimal solution satisfies a function space analogue to a non-degeneracy condition. In numerical experiments we observe, that a prototype implementation of our method behaves in compliance with our theoretical results.
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.
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.
This paper presents concepts and implementation of the finite element toolbox Kaskade 7, a flexible C++ code for solving elliptic and parabolic PDE systems. Issues such as problem formulation, assembly and adaptivity are discussed at the example of optimal control problems. Trajectory compression for parabolic optimization problems is considered as a case study.
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.