@misc{KuehnKorzenPaetsch, author = {K{\"u}hn, Wolfgang and Korzen, Manfred and Paetsch, Olaf}, title = {Fast Data Assimilation in Fire Tests of Steel Members}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3766}, number = {SC-98-33}, abstract = {This report presents a fast data assimilation method to produce an interpolating time and space temperature distribution for steel members subject to fire testing. The method assimilates collected temperature data into the numerical integration of the heat equation. This physically based method also allows the computation of lateral and axial heat flux into and inside the member.}, language = {en} } @misc{GoetschelWeiserMaierhoferetal., author = {G{\"o}tschel, Sebastian and Weiser, Martin and Maierhofer, Christiane and Richter, Regina}, title = {Data Enhancement for Active Thermography}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-15243}, abstract = {Pulse thermography is a non-destructive testing method based on infrared imaging of transient thermal patterns. Heating the surface of the structure under test for a short period of time generates a non-stationary temperature distribution and thus a thermal contrast between the defect and the sound material. Due to measurement noise, preprocessing of the experimental data is necessary, before reconstruction algorithms can be applied. We propose a decomposition of the measured temperature into Green's function solutions to eliminate noise.}, language = {en} } @misc{FrankFuegenschuhHertyetal., author = {Frank, Martin and F{\"u}genschuh, Armin and Herty, Michael and Schewe, Lars}, title = {The Coolest Path Problem}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-11571}, number = {09-37}, abstract = {We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial optimization. The other is the heat conduction problem from the field of partial differential equations. Together, they make up a control problem, where some geometrical object traverses a digraph in an optimal way, with constraints on intermediate or the final state. We discuss some properties of the problem and present numerical solution techniques. We demonstrate that the problem can be formulated as a linear mixed-integer program. Numerical solutions can thus be achieved within one hour for instances with up to 70 nodes in the graph.}, language = {en} }