Refine
Year of publication
Document Type
- ZIB-Report (41)
- Article (40)
- In Collection (9)
- In Proceedings (5)
- Book (3)
- Book chapter (2)
- Report (1)
Is part of the Bibliography
- no (101)
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)
- finite element method (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)
- CT segmentation (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 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 analysis (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)
- temperature based death time estimation (1)
- thermography (1)
- travelling waves (1)
- ultrasonics (1)
- views (1)
Institute
- Computational Medicine (101) (remove)
Geometric predicates are at the core of many algorithms, such as the construction of Delaunay triangulations, mesh processing and spatial relation tests.
These algorithms have applications in scientific computing, geographic information systems and computer-aided design.
With floating-point arithmetic, these geometric predicates can incur round-off errors that may lead to incorrect results and inconsistencies, causing computations to fail.
This issue has been addressed using a combination of exact arithmetic for robustness and floating-point filters to mitigate the computational cost of exact computations.
The implementation of exact computations and floating-point filters can be a difficult task, and code generation tools have been proposed to address this.
We present a new C++ meta-programming framework for the generation of fast, robust predicates for arbitrary geometric predicates based on polynomial expressions.
We combine and extend different approaches to filtering, branch reduction, and overflow avoidance that have previously been proposed.
We show examples of how this approach produces correct results for data sets that could lead to incorrect predicate results with naive implementations.
Our benchmark results demonstrate that our implementation surpasses state-of-the-art implementations.
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.
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.
The paper deals with three different Newton algorithms that have recently been worked out in the general frame of affine invariance. Of particular interest is their performance in the numerical solution of discretized boundary value problems (BVPs) for nonlinear partial differential equations (PDEs). Exact Newton methods, where the arising linear systems are solved by direct elimination, and inexact Newton methods, where an inner iteration is used instead, are synoptically presented, both in affine invariant convergence theory and in numerical experiments. The three types of algorithms are: (a) affine covariant (formerly just called affine invariant) Newton algorithms, oriented toward the iterative errors, (b) affine contravariant Newton algorithms, based on iterative residual norms, and (c) affine conjugate Newton algorithms for convex optimization problems and discrete nonlinear elliptic PDEs.
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.
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.
Numerische Mathematik 3
(2011)