@misc{DeuflhardSeebassStallingetal.1997, author = {Deuflhard, Peter and Seebass, Martin and Stalling, Detlev and Beck, Rudolf and Hege, Hans-Christian}, title = {Hyperthermia Treatment Planning in Clinical Cancer Therapy: Modelling, Simulation and Visualization}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2958}, number = {SC-97-26}, year = {1997}, abstract = {\noindent The speaker and his co-workers in Scientific Computing and Visualization have established a close cooperation with medical doctors at the Rudolf--Virchow--Klinikum of the Humboldt University in Berlin on the topic of regional hyperthermia. In order to permit a patient--specific treatment planning, a special software system ({\sf\small HyperPlan}) has been developed. \noindent A mathematical model of the clinical system ({\it radio frequency applicator with 8 antennas, water bolus, individual patient body}) involves Maxwell's equations in inhomogeneous media and a so--called bio--heat transfer PDE describing the temperature distribution in the human body. The electromagnetic field and the thermal phenomena need to be computed at a speed suitable for the clinical environment. An individual geometric patient model is generated as a quite complicated tetrahedral ``coarse'' grid (several thousands of nodes). Both Maxwell's equations and the bio--heat transfer equation are solved on that 3D--grid by means of {\em adaptive} multilevel finite element methods, which automatically refine the grid where necessary in view of the required accuracy. Finally optimal antenna parameters for the applicator are determined . \noindent All steps of the planning process are supported by powerful visualization methods. Medical images, contours, grids, simulated electromagnetic fields and temperature distributions can be displayed in combination. A number of new algorithms and techniques had to be developed and implemented. Special emphasis has been put on advanced 3D interaction methods and user interface issues.}, language = {en} } @misc{BeckDeuflhardHegeetal.1996, author = {Beck, Rudolf and Deuflhard, Peter and Hege, Hans-Christian and Seebass, Martin and Stalling, Detlev}, title = {Numerical Algorithms and Visualization in Medical Treament Planning}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2643}, number = {SC-96-54}, year = {1996}, abstract = {After a short summary on therapy planning and the underlying technologies we discuss quantitative medicine by giving a short overview on medical image data, summarizing some applications of computer based treatment planning, and outlining requirements on medical planning systems. Then we continue with a description of our medical planning system {\sf HyperPlan}. It supports typical working steps in therapy planning, like data aquisition, segmentation, grid generation, numerical simulation and optimization, accompanying these with powerful visualization and interaction techniques.}, language = {en} } @misc{DeuflhardDellnitzJungeetal.1996, author = {Deuflhard, Peter and Dellnitz, Michael and Junge, Oliver and Sch{\"u}tte, Christof}, title = {Computation of Essential Molecular Dynamics by Subdivision Techniques I: Basic Concept}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2553}, number = {SC-96-45}, year = {1996}, abstract = {The paper presents the concept of a new type of algorithm for the numerical computation of what the authors call the {\em essential dynamics\/} of molecular systems. Mathematically speaking, such systems are described by Hamiltonian differential equations. In the bulk of applications, individual trajectories are of no specific interest. Rather, time averages of physical observables or relaxation times of conformational changes need to be actually computed. In the language of dynamical systems, such information is contained in the natural invariant measure (infinite relaxation time) or in almost invariant sets ("large" finite relaxation times). The paper suggests the direct computation of these objects via eigenmodes of the associated Frobenius-Perron operator by means of a multilevel subdivision algorithm. The advocated approach is different to both Monte-Carlo techniques on the one hand and long term trajectory simulation on the other hand: in our setup long term trajectories are replaced by short term sub-trajectories, Monte-Carlo techniques are just structurally connected via the underlying Frobenius-Perron theory. Numerical experiments with a first version of our suggested algorithm are included to illustrate certain distinguishing properties. A more advanced version of the algorithm will be presented in a second part of this paper.}, language = {en} } @misc{DeuflhardWeiser1996, author = {Deuflhard, Peter and Weiser, Martin}, title = {Global Inexact Multilevel FEM for Nonlinear Elliptic Problems}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2430}, number = {SC-96-33}, year = {1996}, abstract = {The paper deals with the multilevel solution of {\em elliptic} partial differential equations (PDEs) in a {\em finite element} setting: {\em uniform ellipticity} of the PDE then goes with {\em strict monotonicity} of the derivative of a nonlinear convex functional. A {\em Newton multigrid method} is advocated, wherein {\em linear residuals} are evaluated within the multigrid method for the computation of the Newton corrections. The globalization is performed by some {\em damping} of the ordinary Newton corrections. The convergence results and the algorithm may be regarded as an extension of those for local Newton methods presented recently by the authors. An {\em affine conjugate} global convergence theory is given, which covers both the {\em exact} Newton method (neglecting the occurrence of approximation errors) and {\em inexact} Newton--Galerkin methods addressing the crucial issue of accuracy matching between discretization and iteration errors. The obtained theoretical results are directly applied for the construction of adaptive algorithms. Finally, illustrative numerical experiments with a~{\sf NEWTON--KASKADE} code are documented.}, language = {en} } @misc{DeuflhardHeroth1995, author = {Deuflhard, Peter and Heroth, J{\"o}rg}, title = {Dynamic Dimension Reduction in ODE Models}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-1951}, number = {SC-95-29}, year = {1995}, abstract = {The paper analyzes a splitting technique into fast and slow dynamical components of ODE systems as suggested by {\sc Maas and Pope} recently. Their technique is based on a real block -- Schur decomposition of the Jacobian of the right hand side of the ODE. As a result of the analysis, a computationally cheap monitor for the possible necessary recovering of the splitting is derived by singular perturbation theory. Numerical experiments on moderate size, but challenging reaction kinetics problems document the efficiency of the new device within a linearly-implicit stiff integrator.}, language = {en} } @misc{DeuflhardLangNowak1995, author = {Deuflhard, Peter and Lang, Jens and Nowak, Ulrich}, title = {Adaptive Algorithms in Dynamical Process Simulation}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-1823}, number = {SC-95-16}, year = {1995}, abstract = {Dynamical simulation of industrially relevant processes strongly advises the use of algorithms, which are {\em adaptive} both in time and in space discretization. The paper presents two alternatives: (a) a fully adaptive method of lines approach, which is based on finite difference methods and essentially applicable to 1D problems; (b) a fully adaptive Rothe method, which is based on a fast multilevel finite element method and applicable to 1D up to 3D.}, language = {en} } @misc{FroehlichDeuflhard1994, author = {Fr{\"o}hlich, Jochen and Deuflhard, Peter}, title = {Moving Weight Galerkin Methods for Turbulent Reactive Flows}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-1646}, number = {SC-94-36}, year = {1994}, abstract = {Adopting a statistical approach for the computation of turbulent combustion flows an approximation for the probability density function (PDF) of the composition variables is often required to treat the highly non-linear reaction term in a satisfactory way. One class of methods currently being used are the moment methods which employ transport equations for low order statistical moments and use a parametrized shape of the PDF. A second class solves a transport equation for the joint PDF by a Monte Carlo method. In the present paper we develop an intermediate algorithm based on a Galerkin method for the PDF transport equation. The solution is developed in terms of an orthogonal or bi-orthogonal basis of a suitable Hilbert space. The unconventional use of the related weight function as a prefactor (moving weight approach) permits adaptivity and results in a generalization of the \$\beta-\$closure for bounded scalar quantities. We present the approximation procedure in detail and apply it to the evolution of the composition in a homogeneous well-stirred reactor. The extension to non-homogeneous flow simulations is straightforward.}, language = {en} } @misc{DeuflhardAckermann1993, author = {Deuflhard, Peter and Ackermann, J{\"o}rg}, title = {Adaptive Discrete Galerkin-Methods for Macromolecular Processes.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-1180}, number = {SC-93-22}, year = {1993}, abstract = {In this paper, a rather recent algorithmic approac to the numerical simulation of macromolecula processes is surveyed. It avoids the numerical stiff integration o thousands up to millions of ODE's by constructing a scale of discret Hilbert spaces, especially weighted sequence spaces, and establishing corresponding Galerkin method. Examples including polyreactions o industrial relevance and ecological waste management by biochemica recycling illustrate the importance and efficiency of the algorithm.}, language = {en} } @misc{Deuflhard1993, author = {Deuflhard, Peter}, title = {Cascadic Conjugate Gradient Methods for Elliptic Partial Differential Equations I. Algorithm and Numerical Results.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-1197}, number = {SC-93-23}, year = {1993}, abstract = {Cascadic conjugate gradient methods for the numerical solution of elliptic partial differential equations consists of Galerkin finite element methods as outer iteration and (possibly preconditioned) conjugate gradient methods as inner iteration. Both iterations are known to minimize the energy norm of the arising iterations errors. A simple but efficient strategy to control the discretization errors versus the PCG iteration errors in terms of energy error norms is derived and worked out in algorithmic detail. In a unified setting, the relative merits of different preconditioners versus the case of no preconditioning is compared. Surprisingly, it appears that the cascadic conjugate gradient method without any preconditioning is not only simplest but also fastest. The numerical results seem to indicate that the cascade principle in itself already realizes some kind of preconditioning. A theoretical explanation of these observations will be given in Part II of this paper.}, language = {en} } @misc{DeuflhardSchmidt1993, author = {Deuflhard, Peter and Schmidt, Frank}, title = {Discrete Transparent Boundary Conditions for the Numerical Solution of Fresnel's Equation.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-1205}, number = {SC-93-24}, year = {1993}, abstract = {The paper presents a construction scheme of deriving transparent , i. e. reflection-free, boundary conditions for the numerical solution of Fresnel's equation (being formally equivalent to Schr{\"o}dinger's equation). These boundary conditions appear to be of a nonlocal Cauchy type. As it turns out, each kind of linear implicit discretization induces its own discrete transparent boundary conditions.}, language = {en} } @misc{WulffHohmannDeuflhard1994, author = {Wulff, Claudia and Hohmann, Andreas and Deuflhard, Peter}, title = {Numerical Continuation of Periodic Orbits with Symmetry.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-1421}, number = {SC-94-12}, year = {1994}, abstract = {We consider periodic orbits of autonomous parameter dependent ODE's. Starting from a shooting algorithm for the numerical computation of periodic orbits via an adaptive Poincar\'e-section we develop a pathfollowing algorithm for periodic solutions based on a tangential continuation method with implicit reparametrization. For ODE's equivariant w.r.t. a finite group we show that spatial as well as spatio-temporal symmetries of periodic orbits can be exploited within the (multiple) shooting context. We describe how turning points, period doubling bifurcations and Hopf points along the branch of periodic solutions can be handled. Furthermore equivariant Hopf points and generic secondary bifurcations of periodic orbits with \$ Z_m\$-symmetry are treated. We tested the code with standard examples, e.g., the period doubling cascade in the Lorenz equations. To show the efficiency of the described methods we also used the program for an application from electronics, a ring oscillator with \$n \$ inverters. In this example the exploitation of symmetry reduces the amount of work for the continuation of periodic orbits from \${\cal O}(n^2)\$ to \${\cal O}(n)\$}, language = {en} } @misc{DeuflhardWulkow1994, author = {Deuflhard, Peter and Wulkow, Michael}, title = {Simulationsverfahren f{\"u}r die Polymerchemie}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-1502}, number = {SC-94-22}, year = {1994}, abstract = {Die enorme algorithmische Beschleunigung durch diskrete Galerkin-Methoden f{{\"u}}r abz{{\"a}}hlbare Differentialgleichungssysteme hat der Simulation von Polymerisationsprozessen neue, industriell relevante Problembereiche er{{\"o}}ffnet, die mit den bis dahin verf{{\"u}}gbaren Methoden nicht zug{{\"a}}nglich waren.}, language = {de} } @misc{DeuflhardNowakWeyer1994, author = {Deuflhard, Peter and Nowak, Ulrich and Weyer, J.}, title = {Prognoserechnung zur AIDS-Ausbreitung in der Bundesrepublik Deutschland}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-1511}, number = {SC-94-23}, year = {1994}, abstract = {Die Autoren sind sich dar{{\"u}}ber im klaren, daß zahlreiche Imponderabilien die Ergebnisse der vorgelegten Modellrechnungen beeinflussen k{{\"o}}nnen. Immerhin repr{\"a}sentiert jedoch das vorgelegte mathematische Modell die Summe unserer derzeitigen Kenntnisse zur Fragestellung AIDS--Epidemie; neu hinzukommende Erkenntnisse lassen sich rasch einarbeiten und in ihren Konsequenzen {\"u}berschauen. Die Entwicklung neuer effizienter numerischer Methoden spielte eine Schl{\"u}sselrolle bei der tats{\"a}chlichen Simulation dieses umfangreichen realit{\"a}tsnahen mathematischen Modells.}, language = {de} } @misc{Deuflhard1993, author = {Deuflhard, Peter}, title = {A Study of Lanczos-Type Iterations for Symmetric Indefinite Linear Systems}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-1029}, number = {SC-93-06}, year = {1993}, abstract = {The Lanczos iteration for symmetric indefinite linear systems seems to be well--known for quite a while. However, in order to modify it with the aim of improved performance, the present paper studies certain aspects in terms of an adjoint scalar three--term recurrence. Thus, at least a different view is opened. Moreover, an alternative \$3n\$--implementation in terms of the Euclidean orthogonal basis has been found that easily permits generalizations. The study is understood as a start--off for further numerical investigations and experiments.}, language = {en} } @misc{SchoepfDeuflhard1991, author = {Sch{\"o}pf, R. and Deuflhard, Peter}, title = {OCCAL: A mixed symbolic- numeric Optimal Control CALculator.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-638}, number = {SC-91-13}, year = {1991}, abstract = {The numerical solution of optimal control problems by indirect methods (such as multiple shooting or collocation) requires a considerable amount of analytic calculation to establish a numerically tractable system. These analytic calculations, though being rather tedious in realistic examples, are nowadays mostly still done by hand-and thus prone to calculation errors. The paper aims at automating this analytic processing to a reasonable extent by means of a modern symbolic manipulation language (here: REDUCE). In its present stage of development the package OCCAL (mnemotechnically for \underline{O}ptimal \underline{C}ontrol \underline{CAL}culator) permits an interactive use, covering tasks like automatic determination of control and, in case of a singular control, of its order. In simpler problems, the present version of OCCAL automatically produces the full subroutine input for a MULtiple shooting code (MULCON) with adaptive numerical CONtinuation. In more complicate problems where singular sub-arcs may occur or where the sequence of sub-arcs of the optimal trajectory is unclear OCCAL is a significant help in reducing analytic pre-processing. Numerical examples illustrate the performance of OCCAL/MULCON.}, language = {en} } @misc{DeuflhardLeinenYserentant1988, author = {Deuflhard, Peter and Leinen, P. and Yserentant, Harry}, title = {Concepts of an Adaptive Hierarchical Finite Element Code.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-131}, number = {SC-88-05}, year = {1988}, abstract = {The paper presents the mathematical concepts underlying the new adaptive finite element code KASKADE, which, in its present form, applies to linear scalar second-order 2-D elliptic problems on general domains. Starting point for the new development is the recent work on hierarchical finite element bases due to Yserentant (1986). It is shown that this approach permits a flexible balance between iterative solver, local error estimator, and local mesh refinement device - which are the main components of an adaptive PDE code. Without use of standard multigrid techniques, the same kind of computational complexity is achieved - independent of any uniformity restrictions on the applied meshes. In addition, the method is extremely simple and all computations are purely local - making the method particularly attractive in view of parallel computing. The algorithmic approach is illustrated by a well-known critical test problem. {\bf Keywords:} finite elements, hierarchical basis, adaptive mesh refinement, preconditioned conjugate gradient methods.}, language = {en} } @misc{DeuflhardWulkow1988, author = {Deuflhard, Peter and Wulkow, Michael}, title = {Computational Treatment of Polyreaction Kinetics by Orthogonal Polynomials of a Discrete Variable.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-140}, number = {SC-88-06}, year = {1988}, abstract = {The paper presents a new approach to the computational treatment of polyreaction kinetics. This approach is characterized by a Galerkin method based on orthogonal polynomials of a discrete variable, the polymer degree (or chain length). In comparison with the known competing approaches (statistical moment treatment, Galerkin methods for continuous polymer models), the suggested method is shown to avoid the disadvantages and preserve the adventages of either of them. The basic idea of the method is the construction of a discrete inner product associated with a reasonably chosen probability density function. For the so-called Schulz-Flory distribution one thus obtains the discrete Laguerre polynomials, whereas the Poisson distribution leads to the Charlier polynomials. Numerical experiments for selected polyreaction mechanisms illustrate the efficiency of the proposed method.}, language = {en} } @misc{DeuflhardPotra1991, author = {Deuflhard, Peter and Potra, Florian}, title = {A Refined Gauss-Newton- Mysovskii Theorem.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-541}, number = {SC-91-04}, year = {1991}, abstract = {The present paper contains a generalization of a refinement of the Newton- Mysovskii theorem, recently obtained by the authors, to the case of Gauss-Newton procedures for solving nonlinear least-squares problems with full Jacobians. Invariant sufficient conditions are given that ensure the convergence of the Gauss-Newton iterates towards a solution of the problem, as well as the uniqueness of that solution in an explicitely defined neighborhood. It is shown by a counter- example that the results do not carry over to the rank deficient case.}, language = {en} } @misc{WulkowDeuflhard1990, author = {Wulkow, Michael and Deuflhard, Peter}, title = {Towards an Efficient Computational Treatment of Heterogeneous Polymer Reactions.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-292}, number = {SC-90-01}, year = {1990}, abstract = {The discrete Galerkin method developed by the authors has turned out to be an efficient tool for the computational treatment of very large scale ODE systems arising in polyreaction kinetics. Up to now, this approach has been worked out in detail for homogeneous polymer reactions. The present paper deals with one line of possible extensions of the method to the case of so-called heterogeneous processes, which may appear e. g. in smog reactions. The associated mathematical models involve reaction coefficients depending on the chain length of the reacting polymer. The herein suggested extension is worked out in some detail on the basis of the earlier paper. In addition, a numerical example describing polymer degradation is included.}, language = {en} } @misc{Deuflhard1990, author = {Deuflhard, Peter}, title = {Global Inexact Newton Methods for Very Large Scale Nonlinear Problems.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-303}, number = {SC-90-02}, year = {1990}, abstract = {Newton methods for nonlinear problems are known to require the solution of a sequence of linear problems of the same type. For very large scale problems, as understood herein, the arising linear systems can only be solved by iterative methods. Then Newtons iteration appears as outer iteration. The question of interest will be to control the accuracy of the inner iteration such that the convergence speed of Newtons method is preserved. The purpose of the paper is to combine the concept of inexact Newton methods with the concept of the affine invariant exact Newton methods - which is important for problems with ill- conditioned Jacobian matrices (such as typical 2-D or 3-D discretized partial differential equations).}, language = {en} } @misc{DeuflhardFreundWalter1990, author = {Deuflhard, Peter and Freund, R. and Walter, Artur}, title = {Fast Secant Methods for the Iterative Solution of Large Nonsymmetric Linear Systems.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-330}, number = {SC-90-05}, year = {1990}, abstract = {A family of secant methods based on general rank-1 updates has been revisited in view of the construction of iterative solvers for large non- Hermitian linear systems. As it turns out, both Broydens "good" and "bad" update techniques play a special role - but should be associated with two different line search principles. For Broydens "bad" update technique, a minimum residual principle is natural - thus making it theorectically comparable with a series of well-known algorithms like GMRES. Broydens "good" update technique, however, is shown to be naturally linked with a minimum "next correction" principle - which asymptotically mimics a minimum error principle. The two minimization principles differ significantly for sufficiently large system dimension. Numerical experiments on discretized PDE's of convection diffusion type in 2-D with internal layers give a first impression of the possible power of the derived "good" Broyden variant. {\bf Key Words:} nonsymmetric linear system, secant method, rank-1 update, Broydens method, line search, GMRES. AMS(MOS) {\bf Subject Classifications:} 65F10, 65N20.}, language = {en} } @misc{DeuflhardNowakWulkow1990, author = {Deuflhard, Peter and Nowak, Ulrich and Wulkow, Michael}, title = {Recent Developments in Chemical Computing.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-359}, number = {SC-90-07}, year = {1990}, abstract = {The paper surveys three aspects of chemical computing, which seem to play a role in recent developments. First, extrapolation methods for the numerical treatment of differential- algebraic equations are introduced. The associated extrapolation code LIMEX has reached a certain level of sophistication, which makes it a real competitor to the elsewhere widely used multi-step code DASSL of Petzold. Second, adaptive methods of lines for partial differential equations such as those arising in combustion problems are treated. Both static and dynamic regridding techniques are discussed in some detail. Finally, some new ideas about the treatment of the kinetic equations arising from polymer reactions are presented. The new feature of the suggested approach is the application of a Galerkin procedure using sets of orthogonal polynomials over a discrete variable (which, of course, in the case of polymer reactions is the polymer degree). The new approach may open the door to a new reliable low dimensional treatment of complex polymer reactions.}, language = {en} } @misc{DeuflhardPotra1990, author = {Deuflhard, Peter and Potra, Florian}, title = {Asymptotic Mesh Independence of Newton-Galerkin Methods via a Refined Mysovskii Theorem.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-379}, number = {SC-90-09}, year = {1990}, abstract = {The paper presents a theoretical characterization of the often observed asymptotic mesh independence of Newton's method, which means that Newton's method applied to discretized operator equations behaves essentially the same for all sufficiently fine discretizations. The theory does not need any uniform Lipschitz assumptions that were necessary in comparable earlier treatments. The refined Newton-Mysovskii theorem, which will be of interest in a wider context, gives both existence and uniqueness of the solution and quadratic convergence for sufficiently good starting points. Attention is restricted to Galerkin approximations even though similar results should hold for finite difference methods - but corresponding proofs would certainly be more technical. As an illustrative example, adaptive 1-D collocation methods are discussed.}, language = {en} } @misc{DeuflhardNowak1986, author = {Deuflhard, Peter and Nowak, Ulrich}, title = {Efficient Numerical Simulation and Identification of Large Chemical Reaction Systems.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-14}, number = {SC-86-01}, year = {1986}, abstract = {New, highly efficient techniques for the numerical simulation and parameter identification of large chemical reaction systems are surveyed. The survey particularly addresses to chemists, which are understood to be potential users of the distributed software packages. These packages are written in the form of interactive dialogue systems - thus enabling chemists to concentrate on the chemistry of their problem. Large scale examples from chemical research environments are included.}, language = {en} } @misc{Deuflhard1987, author = {Deuflhard, Peter}, title = {Uniqueness Theorems for Stiff ODE Initial Value Problems.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-53}, number = {SC-87-03}, year = {1987}, abstract = {The paper presents a new uniqueness theory for ODE initial value problems, derived in view of numerical stiff integration. The theory supplies stepsize bounds for stiff integrators that can easily be estimated in extrapolation methods. The additional devices lead to a significant speed-up of computations - in particular in combustion PDE problems.}, language = {en} } @misc{Deuflhard1987, author = {Deuflhard, Peter}, title = {A Note on Extrapolation Methods for Second Order ODE Systems.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-79}, number = {SC-87-05}, year = {1987}, abstract = {A slight modification of the extended Stoermer discretization for non self-adjoint second order ODE systems is derived on the basis of a simple stability analysis. This discretization easily extends to implicit ODE systems, which are known to arise e.g. in mechanical engineering. In addition, a special variant of semi-implicit Euler discretization is proposed, which essentially treats the state variables explicitly, but their derivatives implicitly. Numerical tests over critical parameter values of the van der Pol oscillator illustrate the domain of efficiency of the suggested discretizations.}, language = {en} } @misc{SchuetteFischerHuisingaetal.1999, author = {Sch{\"u}tte, Christof and Fischer, Alexander and Huisinga, Wilhelm and Deuflhard, Peter}, title = {A Direct Approach to Conformational Dynamics based on Hybrid Monte Carlo}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3889}, number = {SC-98-45}, year = {1999}, abstract = {Recently, a novel concept for the computation of essential features of the dynamics of Hamiltonian systems (such as molecular dynamics) has been proposed. The realization of this concept had been based on subdivision techniques applied to the Frobenius--Perron operator for the dynamical system. The present paper suggests an alternative but related concept that merges the conceptual advantages of the dynamical systems approach with the appropriate statistical physics framework. This approach allows to define the phrase ``conformation'' in terms of the dynamical behavior of the molecular system and to characterize the dynamical stability of conformations. In a first step, the frequency of conformational changes is characterized in statistical terms leading to the definition of some Markov operator \$T\$ that describes the corresponding transition probabilities within the canonical ensemble. In a second step, a discretization of \$T\$ via specific hybrid Monte Carlo techniques is shown to lead to a stochastic matrix \$P\$. With these theoretical preparations, an identification algorithm for conformations is applicable. It is demonstrated that the discretization of \$T\$ can be restricted to few essential degrees of freedom so that the combinatorial explosion of discretization boxes is prevented and biomolecular systems can be attacked. Numerical results for the n-pentane molecule and the triribonucleotide adenylyl\emph{(3'-5')}cytidylyl\emph{(3'-5')}cytidin are given and interpreted.}, language = {en} } @misc{EhrigNowakDeuflhard1997, author = {Ehrig, Rainald and Nowak, Ulrich and Deuflhard, Peter}, title = {Massively Parallel Linearly-Implicit Extrapolation Algorithms as a Powerful Tool in Process Simulation.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3127}, number = {SC-97-43}, year = {1997}, abstract = {We study the parallelization of linearly--implicit extrapolation codes for the solution of large scale PDE systems and differential algebraic equations on distributed memory machines. The main advantage of these algorithms is that they enable adapativity both in time and space. Additive Krylov--Schwarz methods yield high parallel perfomance for such extrapolation methods. Our approach combines a slightly overlapping domain decomposition together with a polynomial block Neumann preconditioner and a reduced system technique. Furthermore we get important advantages through the explicit computation of the matrix--products of the preconditioner and the matrix of the linear system. The parallel algorithms exhibit scalability up to 64 processors already for medium--sized test problems. We show that the codes are really efficient in large application systems for chemical engineering problems.}, language = {en} } @misc{LipnikovDeuflhard1997, author = {Lipnikov, Konstantin and Deuflhard, Peter}, title = {Domain Decomposition with Subdomain CCG for Material Jump Elliptic Problems.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3057}, number = {SC-97-36}, year = {1997}, abstract = {A combination of the cascadic conjugate gradient (CCG) method for homogeneous problems with a non-overlapping domain decomposition (DD) method is studied. Mortar finite elements on interfaces are applied to permit non-matching grids in neighboring subdomains. For material jump problems, the method is designed as an alternative to the cascadic methods.}, language = {en} } @misc{EhrigDeuflhard1997, author = {Ehrig, Rainald and Deuflhard, Peter}, title = {GMERR - an Error Minimizing Variant of GMRES}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3323}, number = {SC-97-63}, year = {1997}, abstract = {The paper analyzes a recently proposed iterative error minimizing method for the solution of linear systems. Sufficient and necessary conditions for convergence are studied, which show that the method essentially requires normal matrices. An efficient implementation similar to GMRES has been worked out in detail. Numerical tests on general non--normal matrices, of course, indicate that this approach is not competitive with GMRES. Summarizing, if error minimizing is important, one should rather choose CGNE. A computational niche for GMERR might be problems, where normal but non--symmetric matrices occur, like dissipative quantum mechanics.}, language = {en} } @misc{BeckDeuflhardHiptmairetal.1997, author = {Beck, Rudolf and Deuflhard, Peter and Hiptmair, Ralf and Hoppe, Ronald H. W. and Wohlmuth, Barbara}, title = {Adaptive Multilevel Methods for Edge Element Discretizations of Maxwell's Equations}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3356}, number = {SC-97-66}, year = {1997}, abstract = {The focus of this paper is on the efficient solution of boundary value problems involving the double-- curl operator. Those arise in the computation of electromagnetic fields in various settings, for instance when solving the electric or magnetic wave equation with implicit timestepping, when tackling time--harmonic problems or in the context of eddy--current computations. Their discretization is based on on N\'ed\'elec's {\bf H(curl}; \$\Omega\$)--conforming edge elements on unstructured grids. In order to capture local effects and to guarantee a prescribed accuracy of the approximate solution adaptive refinement of the grid controlled by a posteriori error estimators is employed. The hierarchy of meshes created through adaptive refinement forms the foundation for the fast iterative solution of the resulting linear systems by a multigrid method. The guiding principle underlying the design of both the error estimators and the multigrid method is the separate treatment of the kernel of the curl--operator and its orthogonal complement. Only on the latter we have proper ellipticity of the problem. Yet, exploiting the existence of computationally available discrete potentials for edge element spaces, we can switch to an elliptic problem in potential space to deal with nullspace of curl. Thus both cases become amenable to strategies of error estimation and multigrid solution developed for second order elliptic problems. The efficacy of the approach is confirmed by numerical experiments which cover several model problems and an application to waveguide simulation.}, language = {en} } @misc{DeuflhardSeebass1998, author = {Deuflhard, Peter and Seebass, Martin}, title = {Adaptive Multilevel FEM as Decisive Tools in the Clinical Cancer Therapy Hyperthermia}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3739}, number = {SC-98-30}, year = {1998}, abstract = {The paper surveys recent progress in a joint mathematical-medical project on cancer therapy planning. Within so-called regional hyperthermia the computational task is to tune a set of coupled radiofrequency antennas such that a carefully measured tumor is locally heated, but any outside hot spots are avoided. A mathematical model of the whole clinical system -- air, applicator with antennas, water bolus, individual patient body -- involves Maxwell's equations in inhomogeneous media and a parabolic bioheat transfer equation, which represents a simplified model of heat transfer in the human body (ignoring strong blood vessel heat transport). Both PDEs need to be computed fast and to medical reliability (!) on a workstation within a clinical environment. This requirement triggered a series of new algorithmic developments to be reported here, among which is an adaptive multilevel FEM for Maxwell's equations, which dominates the numerical simulation time. In total, however, the main bulk of computation time (see Table 3 in Section 4 below) still goes into segmentation -- a necessary preprocessing step in the construction a 3D virtual patient from the input of a stack of 2D computed tomograms (left out here).}, language = {en} } @misc{DeuflhardWeiserSeebass1998, author = {Deuflhard, Peter and Weiser, Martin and Seebass, Martin}, title = {A New Nonlinear Elliptic Multilevel FEM Applied to Regional Hyperthermia}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-3785}, number = {SC-98-35}, year = {1998}, abstract = {In the clinical cancer therapy of regional hyperthermia nonlinear perfusion effects inside and outside the tumor seem to play a not negligible role. A stationary model of such effects leads to a nonlinear Helmholtz term within an elliptic boundary value problem. The present paper reports about the application of a recently designed adaptive multilevel FEM to this problem. For several 3D virtual patients, nonlinear versus linear model is studied. Moreover, the numerical efficiency of the new algorithm is compared with a former application of an adaptive FEM to the corresponding instationary model PDE.}, language = {en} } @misc{WeiserSchielaDeuflhard2003, author = {Weiser, Martin and Schiela, Anton and Deuflhard, Peter}, title = {Asymptotic Mesh Independence of Newton's Method Revisited}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7352}, number = {03-13}, year = {2003}, abstract = {The paper presents a new affine invariant theory on asymptotic mesh independence of Newton's method in nonlinear PDEs. Compared to earlier attempts, the new approach is both much simpler and more natural from the algorithmic point of view. The theory is exemplified at collocation methods for ODE boundary value problems and at finite element methods for elliptic PDE problems.}, language = {en} } @misc{Deuflhard2002, author = {Deuflhard, Peter}, title = {A Comparison of Related Concepts in Computational Chemistry and Mathematics}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7138}, number = {02-46}, year = {2002}, abstract = {This article studies the relation of the two scientific languages Chemistry and Mathematics via three selected comparisons: (a) QSSA versus dynamic ILDM in reaction kinetics, (b) lumping versus discrete Galerkin methods in polymer chemistry, and (c) geometrical conformations versus metastable conformations in drug design. The common clear message from these comparisons is that chemical intuition may pave the way for mathematical concepts just as chemical concepts may gain from mathematical precisioning. Along this line, significant improvements in chemical research and engineering have already been possible -- and can be further expected in the future from the dialogue between the two scientific languages.}, language = {en} } @misc{Deuflhard2002, author = {Deuflhard, Peter}, title = {Adaptive Pseudo-transient Continuation for Nonlinear Steady State Problems}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6814}, number = {02-14}, year = {2002}, abstract = {Pseudo--transient continuation methods are quite popular for the numerical solution of steady state problems, typically in PDEs. They are based on an embedding into a time dependent initial value problem. In the presence of dynamical invariants the Jacobian matrix of the nonlinear equation system is bound to be singular. The paper presents a convergence analysis which takes this property into account -- in contrast to known approaches. On the basis of the new analysis adaptive algorithms are suggested in detail. These include a variant with Jacobian approximations as well as inexact pseudo--transient continuation, both of which play an important role in discretized PDEs. Numerical experiments are left to future work.}, language = {en} } @misc{Deuflhard2002, author = {Deuflhard, Peter}, title = {From Molecular Dynamics to Conformational Dynamics in Drug Design}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6878}, number = {02-20}, year = {2002}, abstract = {Computational drug design studies molecular recognition in the {\em virtual lab}. The arising Hamiltonian dynamics is known to be chaotic and ill-conditioned already after picoseconds, whereas times are \$msec\$ up to \$min\$. Classical molecular dynamics with long term trajectory computation gives, at best, information about time and statistical ensemble averages. The present paper surveys a recent new modeling approach called {\em conformational dynamics}, which is due to the author and Ch. Sch{\"u}tte. This approach achieves information about the dy time scales by telescoping a short term deterministic model with a statistical model. Examples of small biomolecules are included.}, language = {en} } @misc{HochmuthDeuflhard2003, author = {Hochmuth, Reinhard and Deuflhard, Peter}, title = {Multiscale Analysis for the Bio-Heat Transfer Equation}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7302}, number = {03-08}, year = {2003}, abstract = {The bio-heat transfer equation is a macroscopic model for describing the heat transfer in microvascular tissue. In [{\sl Deuflhard, Hochmuth 2002}] the authors applied homogenization techniques to derive the bio-heat transfer equation as asymptotic result of boundary value problems which provide a microscopic description for microvascular tissue. Here those results are generalized to a geometrical setting where the regions of blood are allowed to be connected. Moreover, asymptotic corrector results are derived.}, language = {en} } @misc{DeuflhardHochmuth2002, author = {Deuflhard, Peter and Hochmuth, Reinhard}, title = {Multiscale Analysis of Thermoregulation in the Human Microvascular System}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6985}, number = {02-31}, year = {2002}, abstract = {The bio-heat transfer equation is a macroscopic model for describing the heat transfer in microvascular tissue. So far the deduction of the Helmholtz term in the bio-heat transfer equation is not co role. In view of a future numerical application of this new mathematical model to treatment planning in hyperthermia we derive asymptotic estimates for first and second order correctors.}, language = {en} } @misc{DeuflhardNowakWeiser2002, author = {Deuflhard, Peter and Nowak, Ulrich and Weiser, Martin}, title = {Affine Invariant Adaptive Newton Codes for Discretized PDEs}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7005}, number = {02-33}, year = {2002}, abstract = {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.}, language = {en} } @misc{DeuflhardWeber2003, author = {Deuflhard, Peter and Weber, Marcus}, title = {Robust Perron Cluster Analysis in Conformation Dynamics}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7415}, number = {03-19}, year = {2003}, abstract = {The key to molecular conformation dynamics is the direct identification of metastable conformations, which are almost invariant sets of molecular dynamical systems. Once some reversible Markov operator has been discretized, a generalized symmetric stochastic matrix arises. This matrix can be treated by Perron cluster analysis, a rather recent method involving a Perron cluster eigenproblem. The paper presents an improved Perron cluster analysis algorithm, which is more robust than earlier suggestions. Numerical examples are included.}, language = {en} } @misc{DeuflhardSchuette2003, author = {Deuflhard, Peter and Sch{\"u}tte, Christof}, title = {Molecular Conformation Dynamics and Computational Drug Design}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7427}, number = {03-20}, year = {2003}, abstract = {The paper surveys recent progress in the mathematical modelling and simulation of essential molecular dynamics. Particular emphasis is put on computational drug design wherein time scales of \$msec\$ up to \$min\$ play the dominant role. Classical long-term molecular dynamics computations, however, would run into ill-conditioned initial value problems already after time spans of only \$psec=10^{-12} sec\$. Therefore, in order to obtain results for times of pharmaceutical interest, a combined deterministic-stochastic model is needed. The concept advocated in this paper is the direct identification of metastable conformations together with their life times and their transition patterns. It can be interpreted as a {\em transfer operator} approach corresponding to some underlying hybrid Monte Carlo process, wherein short-term trajectories enter. Once this operator has been discretized, which is a hard problem of its own, a stochastic matrix arises. This matrix is then treated by {\em Perron cluster analysis}, a recently developed cluster analysis method involving the numerical solution of an eigenproblem for a Perron cluster of eigenvalues. In order to avoid the 'curse of dimension', the construction of appropriate boxes for the spatial discretization of the Markov operator requires careful consideration. As a biomolecular example we present a rather recent SARS protease inhibitor.}, language = {en} } @misc{GajewskiEdDeuflhardMarkowiched1991, author = {Gajewski(Ed.), Herbert and Deuflhard, Peter and Markowich(ed.), A.}, title = {Tagung NUMSIM '91 5.-08. Mai 1991. Collected Abstracts and Papers.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4838}, number = {TR-91-08}, year = {1991}, abstract = {NUMSIM 91 fand vom 6.-08. Mai 1991 im Wissenschaftlichen Kommunikations- \& Konferenz- Zentrum der Humboldt-Universit{\"a}t in Gosen bei Berlin statt. Im Mittelpunkt dieses Seminars standen Probleme der numerischen Simulation von Ladungstransport- und Technologieprozessen der Mikro- und Optoelektronik. Es f{\"u}hrte Spezialisten der physikalischen Modellierung, der numerischen Mathematik und mathematischen Analysis sowie Nutzer von Simulationsprogrammen aus dem deutschsprachigen Raum zusammen. Ziel war die Vermittlung und der Austausch von Erfahrungen, die Diskussion gemeinsamer Aufgabenstellungen und Projekte und - in Anbetracht der deutschen Vereinigung nicht zuletzt - das gegenseitige Kennen- und Verstehenlernen.}, language = {en} } @misc{DeuflhardNowakPoehleetal.1991, author = {Deuflhard, Peter and Nowak, Ulrich and P{\"o}hle, Uwe and Schmidt, B. Ch. and Weyer, J.}, title = {Die Ausbreitung von HIV/AIDS in Ballungsgebieten.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4844}, number = {TR-91-09}, year = {1991}, abstract = {The rapidly increasing number of AIDS cases requires a realistic estimation of the future development of the HIV/AIDS disease. For that purpose we develop a large system of coupled nonlinear differential equations describing simultaneously the dynamics of the development of the disease, the population size, the gender and age structure. A set of 1650 coupled equations are linked by balanced parameters. The balancing procedure is described by a set of (formally) 2,178,000 additional algebraic conditions. As the considered system is stiff, it requires new special extrapolation methods combined with techniquees of dynamical sparsing for the solution of sparsely filled systems. According to our simulations we expect 19,0,000 deaths caused by AIDS in the Federal Republic of Germany (former territories) in the year 2000. Such an epidemical spread would tie up about 4-7 percent of the actual health care workers.}, language = {de} } @misc{EhrigNowakDeuflhard1996, author = {Ehrig, Rainald and Nowak, Ulrich and Deuflhard, Peter}, title = {Highly scalable parallel linearly-implicit extrapolation algorithms}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5405}, number = {TR-96-11}, year = {1996}, abstract = {We present parallel formulations of the well established extrapolation algorithms EULSIM and LIMEX and its implementation on a distributed memory architecture. The discretization of partial differential equations by the method of lines yields large banded systems, which can be efficiently solved in parallel only by iterative methods. Polynomial preconditioning with a Neumann series expansion combined with an overlapping domain decomposition appears as a very efficient, robust and highly scalable preconditioner for different iterative solvers. A further advantage of this preconditioner is that all computation can be restricted to the overlap region as long as the subdomain problems are solved exactly. With this approach the iterative algorithms operate on very short vectors, the length of the vectors depends only on the number of gridpoints in the overlap region and the number of processors, but not on the size of the linear system. As the most reliable and fast iterative methods based on this preconditioning scheme appeared GMRES or FOM and BICGSTAB. To further reduce the number of iterations in GMRES or FOM we can reuse the Krylov-spaces constructed in preceeding extrapolation steps. The implementation of the method within the program LIMEX results in a highly parallel and scalable program for solving differential algebraic problems getting an almost linear speedup up to 64 processors even for medium size problems. Results are presented for a difficult application from chemical engineering simulating the formation of aerosols in industrial gas exhaust purification.}, language = {en} } @misc{DeuflhardBoellingBott1993, author = {Deuflhard, Peter and B{\"o}lling, Reinhard and Bott, Raoul H.}, title = {Materialien zur Euler-Vorlesung in Sanssouci.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5029}, number = {TR-93-10}, year = {1993}, abstract = {Aus dem Inhalt: Vorwort; Leonhard Euler - aus der Zeit seines Wirkens in Berlin; Introductory Remarks.}, language = {de} } @misc{DeuflhardHegeSedlmayred1994, author = {Deuflhard, Peter and Hege, Hans-Christian and Sedlmayr(ed.), E.}, title = {Scientific Computing in der Theoretischen Physik. Collected Abstracts.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5068}, number = {TR-94-01}, year = {1994}, abstract = {Die von der DMV-Fachgruppe Scientific Computing in Kooperation mit dem gleichnamigen GAMM-Fachausschuss organisierte Tagung \glqq Scientific Computing in der Theoretischen Physik\grqq~fand vom 16. - 18. M{\"a}rz 1994 am Fachbereich Mathematik und Informatik der Freien Universit{\"a}t Berlin statt. Ziel des Workshops war, die Kontakte zwischen den Fachleuten der Gebiete {\em Computational Physics} und {\em Scientific Computing} zu intensivieren. Schwerpunkte des Workshops waren numerische Simulation von Transportmodellen der Astrophysik und Halbleiterphysik, Multilevel-Methoden f{\"u}r partielle Differentialgleichungen sowie Monte-Carlo-Methoden und molekulardynamische Verfahren f{\"u}r Probleme der Statistischen Physik und Quantenfeldtheorie. Der Workshop fand ein {\"a}usserst positives Echo und f{\"u}hrte {\"u}ber 70 Teilnehmer der verschiedenen Teilgebiete der Theoretischen Physik und ca. 50 Teilnehmer aus dem Bereich der Numerischen Mathematik zusammen. \originalTeX}, language = {en} } @misc{DeuflhardHegeSeebass2000, author = {Deuflhard, Peter and Hege, Hans-Christian and Seebass, Martin}, title = {Progress Towards a Combined MRI/Hyperthermia System}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5755}, number = {00-07}, year = {2000}, abstract = {Regional hyperthermia, a clinical cancer therapy, is the main topic of the Sonderforschungsbereich Hyperthermia: Scientific Methods and Clinical Applications'' at Berlin. In recent years, technological improvements towards a better concentration of heat to the desired target region have been achieved. These include a rather sophisticated integrated software environment for therapy planning and a new hyperthermia applicator. In a next step, a detailed closed loop monitoring of the actual treatment is to be developed. For this purpose the hyperthermia applicator is combined with an MRI system, which will allow to check the positioning of the patients and to measure individual blood perfusion as well as the 3D temperature distribution. The measurements will then be employed for an on-line control of the whole treatment. In this intended setting, new fast feedback control algorithms will come into play.}, language = {en} } @misc{DeuflhardReich1997, author = {Deuflhard, Peter and Reich, Sebastian}, title = {2nd International Symposium Algorithms for Macromolecular Modelling}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5455}, number = {TR-97-03}, year = {1997}, abstract = {The report contains the program and the collected abstracts of the 2nd International Symposium ``Algorithms for Macromolecular Modelling''.}, language = {en} } @misc{DeuflhardLouisSchlegeletal.1997, author = {Deuflhard, Peter and Louis, Alfred and Schlegel, W. and Seebass, Martin}, title = {Workshop "Scientific Computing in der Medizin" SCMED '97}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5474}, number = {TR-97-05}, year = {1997}, abstract = {Die Arbeitstagung \glqq Scientific Computing in der Medizin\grqq , kurz SCMED \grq 97, findet vom 22. - 23. September 1997 im neu errichteten Geb{\"a}ude des Konrad-Zuse-Zentrums auf dem Dahlemer naturwissenschaftlichen Campus der Freien Universt{\"a}t Berlin statt.}, language = {en} } @misc{DeuflhardGottschewski1995, author = {Deuflhard, Peter and Gottschewski, J{\"u}rgen}, title = {Das Konrad-Zuse-Zentrum f{\"u}r Informationstechnik Berlin. Struktur, wissenschaftliches Konzept und Einbettung in die Region}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5274}, number = {TR-95-12}, year = {1995}, abstract = {Die Arbeit beschreibt Konzept, Struktur und Ausstattung des ZIB. {\"U}bergeordnetes Ziel des ZIB ist die Beschleunigung des {\it Know-how Transfers} aus der mathematischen Grundlagenforschung {\"u}ber die Entwicklung von Algorithmen und Software bis hin zur tats{\"a}chlichen Nutzung in der Industrie. In der Tat ist Computational Mathematics inzwischen zu einer der wichtigsten {\it Schl{\"u}sseltechnologien} geworden, die nicht zuletzt im Zusammenhang mit der Standort-Diskussion eine wichtige Rolle spielt und vermehrt spielen wird. Dazu m{\"u}ssen Methodenentwicklung und Rechenzentrum auf h{\"o}chstem Niveau sowie interdisziplin{\"a}re Forschung m{\"o}glichst vereint in einer Institution mit enger Anbindung an ein universit{\"a}res Umfeld realisiert sein. Das Konrad-Zuse-Zentrum hat die wesentlichen Voraussetzungen als SC Zentrum bereits geschaffen; ein Ausbau zum HPSC Zentrum w{\"a}re eine nat{\"u}rliche Entwicklung - falls die Politik diese Chance rechtzeitig begreift!}, language = {de} }