Refine
Year of publication
Document Type
- Article (67)
- ZIB-Report (52)
- In Proceedings (22)
- In Collection (9)
- Book (4)
- Book chapter (3)
- Software (2)
- Report (1)
Is part of the Bibliography
- no (160)
Keywords
- optimal control (18)
- interior point methods in function space (5)
- interior point methods (4)
- trajectory storage (4)
- discretization error (3)
- finite elements (3)
- flight planning (3)
- free flight (3)
- lossy compression (3)
- shortest path (3)
- Newton-CG (2)
- complementarity functions (2)
- compression (2)
- discrete optimization (2)
- discrete-continuous algorithm (2)
- finite element method (2)
- generic programming (2)
- hyperthermia treatment planning (2)
- inexact Newton methods (2)
- nondestructive testing (2)
- parameter identification (2)
- partial differential equations (2)
- 2-photon microscopy (1)
- Adaptive Finite Elements (1)
- Affine invariant Newton methods (1)
- Burgers' equation (1)
- C++ (1)
- CT segmentation (1)
- Currents (1)
- Diffeomorphic Registration (1)
- Diskretisierungsfehler (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)
- adaptivity (1)
- adjoint gradient computation (1)
- affine conjugate Newton methods (1)
- affine covariant (1)
- affine invariance (1)
- affine invariant norms (1)
- barrier methods (1)
- brain wiring (1)
- cardioelectric excitation (1)
- civil engineering (1)
- classical Liouville equation (1)
- collocation method (1)
- composite step methods (1)
- computational lithography (1)
- computational metrology (1)
- convergence (1)
- cranio-maxillofacial surgery (1)
- cubic regularization (1)
- data compression (1)
- data enhancement (1)
- defibrillation (1)
- determination of time of death (1)
- elektrische Herzanregung (1)
- error estimation (1)
- filopodia (1)
- finite element model (1)
- finite- element methods (1)
- floating point compression (1)
- forensic medicine (1)
- geometry identification (1)
- global Newton methods (1)
- global optimization (1)
- growth cone dynamics (1)
- heat transfer equation (1)
- higher order finite elements (1)
- hybrid parareal (1)
- hyperthermia (1)
- hyperthermia therapy planning (1)
- identification (1)
- implant design (1)
- inertia (1)
- infinite dimensional (1)
- interior-point method (1)
- inverse problems (1)
- inverse solution (1)
- linear optimal control (1)
- mass lumping (1)
- mathematical modelling (1)
- mesh compression (1)
- mesh independence (1)
- mixed control-state constraints (1)
- mixed precision (1)
- model (1)
- molecular dynamics (1)
- monodomain model (1)
- multilev (1)
- multilevel FEM (1)
- multilevel incomplete factorization (1)
- multiplier methods (1)
- nanolithography (1)
- nanooptics (1)
- nonconvex constrained optimization (1)
- nonconvex minimization (1)
- nonlinear elastomechnics (1)
- nonlinear elliptic (1)
- nonlinear partial differential equa (1)
- nonlinear partial differential equations (1)
- nonlinear programming (1)
- nonlinear scaling (1)
- optical metrology (1)
- optimization with PDEs (1)
- overlapping Schwarz smoother (1)
- parallel-in-time integration (1)
- parametric sensitivity (1)
- partial differential equation (1)
- particle methods (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)
- splitting (1)
- state constraints (1)
- superlinear convergence (1)
- temperature based death time estimation (1)
- thermography (1)
- travelling waves (1)
- ultrasonics (1)
- views (1)
Institute
- Numerical Mathematics (134)
- Computational Medicine (103)
- Modeling and Simulation of Complex Processes (40)
- Visual and Data-centric Computing (13)
- Visual Data Analysis (12)
- Mathematics for Life and Materials Science (8)
- Network Optimization (8)
- Therapy Planning (8)
- ZIB Allgemein (7)
- Distributed Algorithms and Supercomputing (3)
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.
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.
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.
Da kohlenstofffaserverstärkte Kunststoffe (CFK) in anspruchsvollen sicherheitsrelevanten Einsatzgebieten wie im Automobilbau und in der Luftfahrt eingesetzt werden, besteht ein zunehmender Bedarf an zerstörungsfreien Prüfmethoden. Ziel ist die Gewährleistung der Sicherheit und Zuverlässigkeit der eingesetzten Bauteile. Aktive Thermografieverfahren ermöglichen die effiziente Prüfung großer Flächen mit hoher Auflösung in wenigen Arbeitsschritten. Ein wichtiges Teilgebiet der Prüfungen ist die Ortung und Charakterisierung von Delaminationen, die sowohl bereits in der Fertigung als auch während der Nutzung eines Bauteils auftreten können, und dessen strukturelle Integrität schwächen. ;In diesem Beitrag werden CFK-Strukturen mit künstlichen und natürlichen Delaminationen mit Hilfe unterschiedlich zeitlich modulierter Strahlungsquellen experimentell untersucht. Verwendet werden dabei Anregungen mit Blitzlampen und mit frequenzmodulierten Halogenlampen. Mittels Filterfunktionen im Zeit- und Frequenzbereich wird das Kontrast-zu-Rausch-Verhältnis (CNR) der detektierten Fehlstellen optimiert. Verglichen werden anschließend die Nachweisempfindlichkeit, das CNR und die Ortsauflösung der zu charakterisierenden Delaminationen für die unterschiedlichen Anregungs- und Auswertungstechniken. Ergänzt werden die Experimente durch numerische Simulationen des dreidimensionalen Wärmetransportes.
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.
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.
Temperature-based time of death estimation (TTDE) using simulation methods such as the finite element (FE) method promises higher accuracy and broader applicability in nonstandard cooling scenarios than established phenomenological methods. Their accuracy depends crucially on the simulation model to capture the actual situation. The model fidelity in turn hinges on the representation of the corpse’s anatomy in form of computational meshes as well as on the thermodynamic parameters.
While inaccuracies in anatomy representation due to coarse mesh resolution are known to have a minor impact on the estimated time of death, the sensitivity with respect to larger differences in the anatomy has so far not been studied. We assess this sensitivity by comparing four independently generated and vastly different anatomical models in terms of the estimated time of death in an identical cooling scenario. In order to isolate the impact of shape variation, the models are scaled to a reference size, and the possible impact of measurement location variation is excluded explicitly, which gives a lower bound on the impact of anatomy on the estimated time of death.
Solving PDEs on unstructured grids is a cornerstone of engineering and scientific computing. Heterogeneous parallel platforms, including CPUs, GPUs, and FPGAs, enable energy-efficient and computationally demanding simulations.
In this article, we introduce the HPM C++-embedded DSL that bridges the abstraction gap between the mathematical formulation of mesh-based algorithms for PDE problems on the one hand and an increasing number of heterogeneous platforms with their different programming models on the other hand.
Thus, the HPM 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 HPM DSL, and demonstrate its usage with three examples. The mapping of the abstract algorithmic description onto parallel hardware, including distributed memory compute clusters, is presented.
A code generator and a matching back end allow the acceleration of HPM code with GPUs. Finally, the achievable performance and scalability are demonstrated for different example problems.