TY - JOUR
A1 - Deuflhard, Peter
A1 - Schiela, Anton
A1 - Weiser, Martin
T1 - Mathematical Cancer Therapy Planning in Deep Regional Hyperthermia
JF - Acta Numerica
N2 - 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.
Y1 - 2012
VL - 21
SP - 307
EP - 378
ER -
TY - JOUR
A1 - Weiser, Martin
A1 - GĂ¶tschel, Sebastian
T1 - State Trajectory Compression for Optimal Control with Parabolic PDEs
JF - SIAM J. Sci. Comput.
N2 - 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.
Y1 - 2012
U6 - http://dx.doi.org/10.1137/11082172X
VL - 34
IS - 1
SP - A161
EP - A184
ER -