@misc{MaasNowak, author = {Maas, Ulrich and Nowak, Ulrich}, title = {An adaptive method of lines for the simulation of complex laminar combustion processes}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-2665}, number = {SC-96-56}, abstract = {For the simulation of one-dimensional flame configurations reliabl e numerical tools are needed which have to be both highly efficient (large num ber of parametric calculations) and at the same time accurate (in order t o avoid numerical errors). This can only be accomplished using fully adapt ive discretization techniques both in space and time together with a c ontrol of the discretization error. We present a method which accomplishes this task. It is based on a n adative MOL (method of lines) treatment. Space discretization is done by means of finite difference approxi mations on non-uniform grids. Time is discretized by the linearly-implicit Euler method. In order to control the discretization errors an extrapolation pro cedure is used in space and time. Results are presented for simple laser-induced ignition processes. The method, however, can be applied to other combustion processes, too.}, language = {en} } @misc{EhrigNowak, author = {Ehrig, Rainald and Nowak, Ulrich}, title = {Algorithmen- und Softwareoptimierung f{\"u}r die Satellitenbahn- und Schwerefeldmodellierung}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5694}, number = {00-01}, abstract = {Dieser Report enth{\"a}lt die Ergebnisse der Untersuchungen, die gem{\"a}ss dem Forschungs-- und Entwicklungsvertrag Gravity zwischen dem GeoForschungsZentrum Potsdam und dem Konrad--Zuse--Zentrum Berlin vorgenommen wurden. Die damit vereinbarte wissenschaftliche Kooperation hat die folgenden Ziele: \item{die am GFZ vorhandenen Algorithmen und Softwaremodule auf ihre Effizienz hisichtlich Nutzung der Rechnerresourcen zu untersuchen und L{\"o}sungen f{\"u}r einen schnelleren Datendurchsatz zu entwickeln und zu implementieren,} \item{Methoden zur Regularisierung und L{\"o}sung schlecht konditionierter Normalgleichungssysteme (f{\"u}r Schwerefeldkoeffizienten) kritisch zu untersuchen und eine mathematisch objektive Strategie der Regularisierung zu entwickeln, und} \item{insbesondere im Hinblick auf die Anforderungen bei GRACE, verschiedene Bahnintegrationsverfahren hinsichtlich ihrer numerischen Genauigkeit und Einsatzm{\"o}glichkeiten zu untersuchen.}}, language = {de} } @misc{SchlegelMarquardtEhrigetal., author = {Schlegel, Martin and Marquardt, Wolfgang and Ehrig, Rainald and Nowak, Ulrich}, title = {Sensitivity analysis of linearly-implicit differential-algebraic systems by one-step extrapolation}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7052}, number = {02-38}, abstract = {In this work we present an approach for the sensitivity analysis of linearly-implicit differential-algebraic equation systems. Solutions for both, states and sensitivities are obtained by applying an extrapolated linearly implicit Euler discretization scheme. This approach is compared to the widely used sensitivity extensions of multi-step BDF methods by means of case studies. Especially, we point out the benefit of this method in the context of dynamic optimization using the sequential approach.}, language = {en} } @misc{DeuflhardNowakWeiser, 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}, 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{NowakGrahSchreier, author = {Nowak, Ulrich and Grah, Aleksander and Schreier, Manfred}, title = {Parameter Estimation and Accuracy Matching Strategies for 2-D Reactor Models}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-7749}, number = {03-52}, abstract = {The mathematical modeling of a special modular catalytic reactor kit leads to a system of partial differential equation in two space dimensions. As customary, this model contains unconfident physical parameters, which may be adapted to fit experimental data. To solve this nonlinear least squares problem we apply a damped Gauss-Newton method. A method of lines approach is used to evaluate the associated model equations. By an a priori spatial discretization a large DAE system is derived and integrated with an adaptive, linearly-implicit extrapolation method. For sensitivity evaluation we apply an internal numerical differentiation technique, which reuses linear algebra information from the model integration. In order not to interfere the control of the Gauss-Newton iteration these computations are done usually very accurately and, therefore, very costly. To overcome this difficulty, we discuss several accuracy adaptation strategies, e.g., a master-slave mode. Finally, we present some numerical experiments.}, language = {en} } @misc{DeuflhardNowakLutzWestphal, author = {Deuflhard, Peter and Nowak, Ulrich and Lutz-Westphal, Brigitte}, title = {Bessel'scher Irrgarten}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-9525}, number = {07-09}, abstract = {Dieser Artikel berichtet {\"u}ber eine erfolgreiche Sch{\"u}leraktivit{\"a}t, die seit Jahren am Zuse-Institut Berlin (ZIB) bei Besuchen von Sch{\"u}lergruppen erprobt und verfeinert worden ist. Das hier zusammengestellte Material ist gedacht als Basis f{\"u}r eine Unterrichtseinheit in Leistungskursen Mathematik an Gymnasien. Inhaltlich wird von einem zwar f{\"u}r Sch{\"u}ler (wie auch Lehrer) neuen, aber leicht fasslichen Gegenstand ausgegangen: der Drei-Term-Rekursion f{\"u}r Besselfunktionen. Die Struktur wird erkl{\"a}rt und in ein kleines Programm umgesetzt. Dazu teilen sich die Sch{\"u}ler selbstorganisierend in Gruppen ein, die mit unterschiedlichen Taschenrechnern "um die Wette" rechnen. Die Sch{\"u}ler und Sch{\"u}lerinnen erfahren unmittelbar die katastrophale Wirkung von an sich kleinen'' Rundungsfehlern, sie landen -- ebenso wie der Supercomputer des ZIB -- im Bessel'schen Irrgarten''. Die auftretenden Ph{\"a}nomene werden mathematisch elementar erkl{\"a}rt, wobei lediglich auf das Konzept der linearen Unabh{\"a}ngigkeit zur{\"u}ckgegriffen wird. Das dabei gewonnene vertiefte Verst{\"a}ndnis fließt ein in die Konstruktion eines klassischen Algorithmus sowie eines wesentlich verbesserten Horner-artigen Algorithmus.}, language = {de} } @misc{NowakPoehleRoitzschetal., author = {Nowak, Ulrich and P{\"o}hle, Uwe and Roitzsch, Rainer and Werk, Roland}, title = {ZGUI-Handbuch}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5397}, number = {TR-96-10}, abstract = {In diesem Handbuch werden die Bausteine zum Aufbau einer graphischen Benutzeroberfl{\"a}che mit {\tt ZGUI} beschrieben. Auf der einen Seite stehen die Tcl/Tk--Prozeduren, die die graphischen Elemente definieren. Die Beschreibung der Anwendung der Prozeduren und der Interaktionen der Elemente bildet den ersten Teil des Handbuches. Auf der anderen Seite stehen die Anforderungen an Anwendungen, die mit einer {\tt ZGUI}--Benutzeroberlf{\"a}che gesteuert werden sollen. Hier findet man im Handbuch die Beschreibung der Anwendungsprogrammierschnittstelle (application programming interface, API).}, language = {de} } @misc{EhrigNowakDeuflhard, 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}, 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} } @phdthesis{Nowak, author = {Nowak, Ulrich}, title = {Adaptive Linienmethoden f{\"u}r nichtlineare parabolische Systeme in einer Raumdimension.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-5059}, number = {TR-93-14}, abstract = {A new method for the numerical solution of highly nonlinear, coupled systems of parabolic differential equations in one space dimension is presented. The approach is based on a classical method of lines treatment. Time discretization is done by means of the semi--implicit Euler discretization. Space discretization is done with finite differences on non--uniform grids. Both basic discretizations are coupled with extrapolation techniques. With respect to time the extrapolation is of variable order whereas just one extrapolation step is done in space. Based on local error estimates for both, the time and the space discretization error, the accuracy of the numerical approximation is controlled and the discretization stepsizes are adapted automatically and simultaneously. Besides the local adaptation of the space grids after each integration step (static regridding), the grid may even move within each integration step (dynamic regridding). Thus, the whole algorithm has a high degree of adaptivity. Due to this fact, challenging problems from applications can be solved in an efficient and robust way.}, language = {en} } @misc{NowakWeimann, author = {Nowak, Ulrich and Weimann, Lutz}, title = {GIANT - A Software Package for the Numerical Solution of Very Large Systems of Highly Nonlinear Equations.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4746}, number = {TR-90-11}, abstract = {This report presents the final realization and implementation of a global inexact Newton method proposed by Deuflhard. In order to create a complete piece of software, a recently developed iterative solver (program GBIT) due to Deuflhard, Freund, Walter is adapted and serves as the standard iterative linear solver. Alternative linear iterative solvers may be adapted as well, e.g. the widely distributed code GMRES. The new software package GIANT (Global Inexact Affine Invariant Newton Techniques) allows an efficient and robust numerical solution of very large scale highly nonlinear systems. Due to the user friendly interface and its modular design, the software package is open for an easy adaptation to specific problems. Numerical experiments for some selected problems illustrate performance and usage of the package.}, language = {en} }