TY - GEN A1 - Deuflhard, Peter A1 - Nowak, Ulrich A1 - Pöhle, Uwe A1 - Schmidt, B. Ch. A1 - Weyer, J. T1 - Die Ausbreitung von HIV/AIDS in Ballungsgebieten. N2 - 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. T3 - ZIB-Report - TR-91-09 Y1 - 1991 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-4844 ER - TY - GEN A1 - Ehrig, Rainald A1 - Nowak, Ulrich A1 - Deuflhard, Peter T1 - Highly scalable parallel linearly-implicit extrapolation algorithms N2 - 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. T3 - ZIB-Report - TR-96-11 Y1 - 1996 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-5405 ER - TY - CHAP A1 - Bader, G. A1 - Nowak, Ulrich A1 - Deuflhard, Peter ED - Aiken, R. T1 - An Advanced Simulation Package for Large Chemical Reaction Systems T2 - Stiff Computation. Proc. Intern. Conf. Park City, Utah/USA Y1 - 1985 PB - Oxford University Press ER - TY - CHAP A1 - Deuflhard, Peter A1 - Bader, G. A1 - Nowak, Ulrich T1 - LARKIN - a Software Package for the Numerical Simulation of LARge Systems Arising in Chemical Reaction KINetics T2 - Modelling of Chemical Reaction Systems Y1 - 1981 VL - 18 SP - 38 EP - 55 PB - Springer Verlag ER - TY - CHAP A1 - Deuflhard, Peter A1 - Lang, Jens A1 - Nowak, Ulrich ED - Neunzert, H. T1 - Recent Progress in Dynamical Process Simulation T2 - Progress in Industrial Mathematics, Proc. 8th Conference of the European Consortium for Mathematics in Industry (ECMI 94) Y1 - 1996 SP - 122 EP - 137 PB - Wiley & Teubner ER - TY - CHAP A1 - Deuflhard, Peter A1 - Nowak, Ulrich ED - Deuflhard, Peter ED - Engquist, B. T1 - Extrapolation integrators for quasilinear implicit ODEs. T2 - Large scale scientific computing, Proc. Meet., Oberwolfach/FRG 1985, Y1 - 1987 VL - 7 SP - 37 EP - 50 PB - Boston-Basel-Stuttgart: Birkhäuser ER - TY - JOUR A1 - Deuflhard, Peter A1 - Nowak, Ulrich A1 - Wulkow, Michael T1 - Recent Developments in Chemical Computing JF - Computers in Chemical Engineering Y1 - 1990 VL - 14 SP - 1249 EP - 1258 ER - TY - GEN A1 - Deuflhard, Peter A1 - Nowak, Ulrich A1 - Lutz-Westphal, Brigitte T1 - Bessel'scher Irrgarten N2 - Dieser Artikel berichtet über eine erfolgreiche Schüleraktivität, die seit Jahren am Zuse-Institut Berlin (ZIB) bei Besuchen von Schülergruppen erprobt und verfeinert worden ist. Das hier zusammengestellte Material ist gedacht als Basis für eine Unterrichtseinheit in Leistungskursen Mathematik an Gymnasien. Inhaltlich wird von einem zwar für Schüler (wie auch Lehrer) neuen, aber leicht fasslichen Gegenstand ausgegangen: der Drei-Term-Rekursion für Besselfunktionen. Die Struktur wird erklärt und in ein kleines Programm umgesetzt. Dazu teilen sich die Schüler selbstorganisierend in Gruppen ein, die mit unterschiedlichen Taschenrechnern "um die Wette" rechnen. Die Schüler und Schü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änomene werden mathematisch elementar erklärt, wobei lediglich auf das Konzept der linearen Unabhängigkeit zurückgegriffen wird. Das dabei gewonnene vertiefte Verständnis fließt ein in die Konstruktion eines klassischen Algorithmus sowie eines wesentlich verbesserten Horner-artigen Algorithmus. T3 - ZIB-Report - 07-09 KW - Rundungsfehler KW - Drei-Term-Rekursionen KW - Bessel-Rekursion Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-9525 ER -