@misc{OPUS4-983, title = {Jahresbericht 1990}, issn = {0934-5892}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-9831}, number = {1990}, year = {1991}, language = {de} } @misc{Gottschewski1991, author = {Gottschewski, J{\"u}rgen}, title = {Supercomputing During the German Reunification.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4803}, number = {TR-91-05}, year = {1991}, abstract = {The success of the German Reunification requires a unique migration from the traditional Eastern Block system to a modern free society. The successful migration must include a shift from a low state of the art in technology to the high level of science and technology present in the Western Community. The role of supercomputing in this transition will include leading the process of organizational change in research and development. The paper contains a short overview on the current state of this evolution, on the currently used political and administrative tools to keep this evolution on track, and on the influence on the Konrad-Zuse-Zentrum, which is, as a Berlin institution, in the geographical and cultural center of this transformation.}, language = {en} } @misc{KornhuberRoitzsch1991, author = {Kornhuber, Ralf and Roitzsch, Rainer}, title = {Self Adaptive Computation of the Breakdown Voltage of Planar pn-Junctions with Multistep Field Plates.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-525}, number = {SC-91-02}, year = {1991}, abstract = {The breakdown voltage highly depends on the electric field in the depletion area whose computation is the most time consuming part of the simulation. We present a self adaptive Finite Element Method which reduces dramatically the required computation time compared to usual Finite Difference Methods. A numerical example illustrates the efficiency and reliability of the algorithm.}, language = {en} } @misc{Lang1991, author = {Lang, Jens}, title = {An Adaptive Finite Element Method for Convection-Diffusion Problems by Interpolation Techniques.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4795}, number = {TR-91-04}, year = {1991}, abstract = {For adaptive solution of convection- difussion problems with the streamline-diffusion finite element method, an error estimator based on interpolation techniques is developed. It can be shown that for correctness of this error estimator a restriction of the maximum angle is to be sufficient. Compared to usual methods, the adaptive process leads to more accurate solutions at much less computational cost. Numerical tests are enclosed. {\bf Keywords: } Adaptive finite elements, convection- diffusion equation, internal and boundary layers, streamline-diffusion. {\bf Subject Classifications:} AMS(MOS): 65N15, 65N30}, language = {en} } @misc{Noelle1991, author = {Noelle, Sebastian W. C.}, title = {On the Limits of Operator Splitting: Numerical Experiments for the Complex Burgers Equation.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4789}, number = {TR-91-03}, year = {1991}, abstract = {A high resolution Godunov-type method is developed and applied to a two-dimensional version of the Burgers equation. On one-dimensional testproblems the scheme is second order accurate for smooth flow and resolves discontinuities sharply. On two-dimensional problems, however, large numerical oscillations are introduced when discontinuities traveling obliquely to the grid directions are present. These oscillations are caused by a Strang- type operator splitting, and cannot be eliminated using flux limiters or small timesteps. {\bf Keywords:} High resolution methods, Godunovs method, operator splitting, complex Burgers equation. {\bf AMS:} 35: A40, L45, L60, L65, L, 67. 65: M05, M10.}, language = {en} } @misc{LueggerDalitz1991, author = {L{\"u}gger, Joachim and Dalitz, Wolfgang}, title = {Verteilung mathematischer Software mittels elektronischer Netze: Die elektronische Softwarebibliothek eLib.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4774}, number = {TR-91-02}, year = {1991}, abstract = {Mit zunehmender Dezentralisierung im Bereich des Wissenschaftlichen Rechnens steigt auch der Bedarf an Softwarequellen qualitativ hochwertiger mathematischer Algorithmen. F{\"u}r den Software- und Informationsaustausch wird die Einrichtung {\"o}ffentlicher, elektronischer Softwarebibliotheken vorgeschlagen. Am Beispiel der eLib des ZIB werden die notwendigen technischen Konzepte, die u.a. auch in den heutigen Gegebenheiten der technischen Kommunikation begr{\"u}ndet sind, diskutiert. Die eLib ist fenster- und men{\"u}orientiert aufgebaut und folglich im Dialog sehr einfach zu benutzen. Sie kann aber auch mit ihrer Kommandosprache allein auf dem Wege {\"u}ber elektronische Post abgefragt werden. {\"U}ber die eLib sind, nach dem Verbund mit den Netzbibliotheken NetLib und Reduce-NetLib jetzt etwa 6000 mathematische Programme und allgemeine Dokumente verf{\"u}gbar. Das Dienstleistungsangebot der eLib setzt Beitr{\"a}ge aus einer aktiven Benutzergemeinschaft voraus. Es besteht die Hoffnung, daß durch den {\"o}ffentlichen Softwareaustausch sich Entwickler und Anwender wechselseitig in ihrer Arbeit befruchten.}, language = {de} } @misc{BornemannErdmannRoitzsch1991, author = {Bornemann, Folkmar A. and Erdmann, Bodo and Roitzsch, Rainer}, title = {KASKADE - Numerical Experiments.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4762}, number = {TR-91-01}, year = {1991}, abstract = {The C-implementation of KASKADE, an adaptive solver for linear elliptic differential equations in 2D, is object of a set of numerical experiments to analyze the use of resources (time and memory) with respect to numerical accuracy. We study the dependency of the reliability, robustness, and efficiency of the program from the parameters controlling the algorithm.}, language = {en} } @misc{Bornemann1991, author = {Bornemann, Folkmar A.}, title = {An Adaptive Multilevel Approach to Parabolic Equations III.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-519}, number = {SC-91-01}, year = {1991}, abstract = {Part III of the paper is devoted to the construction of an adaptive FEM solver in two spatial dimensions, which is able to handle the singularly perturbed elliptic problems arising from discretization in time. The problems of error estimation and multilevel iterative solution of the linear systems - both uniformly well behaved with respect to the time step - can be solved simultaneously within the framework of preconditioning. A multilevel nodal basis preconditioner able to handle highly nonuniform meshes is derived. As a numerical example an application of the method to the bioheat-transfer equation is included. {\bf AMS CLASSIFICATION:} 65F10, 65F35, 65M50, 65M60, 65N30.}, language = {en} } @misc{Walter1990, author = {Walter, Artur}, title = {Sparse Secant Methods for the Iterative Solution of Large Nonsymmetric Linear Systems.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-483}, number = {SC-90-20}, year = {1990}, abstract = {A variety of secant methods has been revisited in view of the construction of iterative solvers for large nonsymmetric linear systems \$ Ax = b \$ stemming from the discretization of convection diffusion equations. In the first section, we tried to approximate \$ A ^{-1} \$ directly. Since the sparsity structure of A- is not known, additional storage vectors are needed during the iteration. In the next section, an incomplete factorization \$ LU \$ of \$ A \$ is the starting point and we tried to improve this easy invertible approximation of \$ A \$. The update is constructed in such a way that the sparsity structure of \$ L \$ and \$ U \$ is maintained. Two different sparsity preserving updates are investigated from theoretical and practical point of view. Numerical experiments on discretized PDEs of convection diffusion type in 2- D with internal layers and on "arbitrary" matrices with symmetric sparsity structure are given. {\bf Key words:} nonsymmetric linear system, sparse secant method, Broyden's method, incomplete factorization.}, 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{Giloi1990, author = {Giloi, Wolfgang K.}, title = {Konrad Zuses Plankalk{\"u}l als Vorl{\"a}ufer moderner Programmier-modelle. (Vortrag)}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4759}, number = {TR-90-13}, year = {1990}, language = {de} } @misc{NowakWeimann1990, 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}, year = {1990}, 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} } @misc{CaprasseDemaretGatermannetal.1990, author = {Caprasse, H. and Demaret, J. and Gatermann, Karin and Melenk, Herbert}, title = {Power-Law Type Solutions of Fourth-Order Gravity}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-466}, number = {SC-90-18}, year = {1990}, abstract = {We study the power-law type solutions of the fourth order field equations derived from a generic quadratic Lagrangian density in the case of multidimensional Bianchi I cosmological models. All the solutions of the system of algebraic equations have been found, using computer algebra, from a search of the Groebner bases associated to it. While, in space dimension \$ d = 3 \$ , the Einsteinian Kasner metric is still the most general power-law type solution, for \$ d > 3 \$ , no solution, other than the Minkowski space-time, is common to the three systems of equations associated with the three contributions to the Lagrangian density. In the case of a pure Riemann-squared contribution (suggested by a recent calculation of the effective action for the heterotic string), the possibility exists to realize a splitting of the \$ d \$-dimensional space into a ( \$ d - 3 \$)-dimensional internal space and a physical 3- dimensional space, the latter expanding in time as a power bigger than 2 (about 4.5 when \$ d = 9 \$).}, language = {en} } @misc{Wang1990, author = {Wang, Daoliu}, title = {Symplectic Difference Schemes for Perturbed Hamiltonian Systems.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-456}, number = {SC-90-17}, year = {1990}, abstract = {In this paper we consider symplectic difference schemes for perturbed Hamiltonian systems of integrable ones, which can cover many important problems. Symplectic difference schemes for general Hamiltonian systems can also be used to these problems. But the perturbation property has not been paid proper attention to, which is important in the method proposed here. Numerical simulation shows that, for this method the time step size can be taken quite large and the qualitative property , such as preserving invariant tori, is also better than usual symplectic difference schemes.}, language = {en} } @misc{HegeStueben1990, author = {Hege, Hans-Christian and St{\"u}ben, Hinnerk}, title = {Vectorization and Parallelization of Irregular Problems via Graph coloring.}, doi = {/10.1145/109025.109042}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-443}, number = {SC-90-16}, year = {1990}, abstract = {Efficient implementations of irregular problems on vector and parallel architectures are generally hard to realize. An important class of problems are Gauß-Seidel iteration schemes applied to irregular data sets. The unstructured data dependences arising there prevent restructuring compilers from generating efficient code for vector or parallel machines. It is shown, how to structure the data dependences by decomposing the underlying data set using graph coloring techniques and by specifying a particular execution order already on the algorithm level. Methods to master the irregularities originating from different types of tasks are proposed. An application is given and some open issues and future developments are discussed.}, language = {en} } @misc{RoitzschKornhuber1990, author = {Roitzsch, Rainer and Kornhuber, Ralf}, title = {BOXES - a Program to Generate Triangulations from a Rectangular Domain Description.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4738}, number = {TR-90-09}, year = {1990}, abstract = {BOXES computes a triangulation from a 2D domain description which consists of an arbitrary set of rectangles. Each rectangle may have attributes to control the triangulating process, define subdomain classes, or specify boundary conditions. The output of the program can be used as a coarse grid for KASKADE or one of its variants. Additional features are extensive checking of the user input, graphical display, and simple editing.}, language = {en} } @misc{AckermannWulkow1990, author = {Ackermann, J{\"o}rg and Wulkow, Michael}, title = {MACRON - A Program Package for Macromalecular Reaction Kinetics.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-423}, number = {SC-90-14}, year = {1990}, abstract = {This paper presents the new program package MACRON for the simulation of macromolecular kinetics including standard chemical reactions. Such problems lead to countable (possibly) infinite systems of ordinary differential equations (CODE's), which are numerically treated by the so-called discrete Galerkin method here. By a chemical compiler the required analytical preprocessing is performed, such that the complete reaction system, standard kinetics as well as macromolecular reactions, can be entered in the chemical formalism. Typical macromolecular reaction steps are chain addition, termination, chain transfer and degradation (cracking). In order to ensure efficiency and reliability, high sophisticated numerical routines are built within the package. MACRON can be used without a detailed knowledge of the used numerical methods. As an illustration the application of MACRON to some realistic problems is presented.}, language = {en} } @misc{WulkowAckermann1990, author = {Wulkow, Michael and Ackermann, J{\"o}rg}, title = {Numerical Treatment of Polyreactions - Recent Developments.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-439}, number = {SC-90-15}, year = {1990}, abstract = {The mathematical modeling of macromolecular reactions leads to countable (possibly infinite) systems of ordinary differential equations (CODE's). This paper reviews two recent developments of the so-called discrete Galerkin method, which has been developed for the numerical treatment of countable systems, which arise e.g. in polymer chemistry. The first approach can be considered as a method of lines with moving basis functions and has been implemented recently in the program package MACRON. The second type of the Galerkin method is characterized by a so-called outer time discretization of the complete problem and an appropriate and efficient solution of the arising subproblems. This method is realized in the research code CODEX.}, language = {en} } @misc{Wulkow1990, author = {Wulkow, Michael}, title = {Numerical Treatment of Countable Systems of Ordinary Differential Equations.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-4728}, number = {TR-90-08}, year = {1990}, abstract = {Countable systems of ordinary differential equations appear frequently in chemistry, physics, biology and medicine. They can be considered as ordinary differential equations in sequence spaces. In this work, a full adaptive algorithm for the computational treatment of such systems is developed. The method combines time discretization with extrapolation in Hilbert spaces with a discrete Galerkin approach as discretization of the stationary subproblems. The Galerkin method is based on orthogonal functions of a discrete variable , which are generated by certain weight functions. A theory of countable systems in the associated weighted sequence spaces is developed as well as a theory of the Galerkin method. The Galerkin equations can be assembled either by use of analytical properties of the orthogonal functions or numerically by a multilevel summation algorithm. The resulting algorithm CODEX is applied to many examples of technological interest, in particular from polymer chemistry.}, language = {en} } @misc{Bornemann1990, author = {Bornemann, Folkmar A.}, title = {An Adaptive Multilevel Approach to Parabolic Equations II.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-410}, number = {SC-90-13}, year = {1990}, abstract = {In continuation of part I this paper develops a variable-order time discretization in Hilbert space based on a multiplicative error correction. Matching of time and space errors as explained in part I allows to construct an adaptive multilevel discretization of the parabolic problem. In contrast to the extrapolation method in time, which has been used in part I, the new time discretization allows to separate space and time errors and further to solve fewer elliptic subproblems with less effort, which is essential in view of the application to space dimension greater than one. Numerical examples for space dimension one are included which clearly indicate the improvement.}, language = {en} } @misc{Walter1990, author = {Walter, Artur}, title = {Improvement of Incomplete Factorizations by a Sparse Secant Method.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-401}, number = {SC-90-12}, year = {1990}, abstract = {In the present paper, the improvement of an incomplete factorization of a non-symmetric matrix A is discussed. Starting from the ideas of sparsity preserving quasi-Newton methods, an algorithm is developed which improves the approximation of A by the incomplete factorization maintaining the sparsity structure of the matrices. No renumbering of the unknowns or the admittance of additional fill-in is necessary. The linear convergence of the algorithm is proved under the assumption, that \$ L \$ and \$ U \$* have the same sparsity structure and an incomplete factorization with some reasonable approximation property exits. In combination with this algorithm, the method of incomplete factorization and its several modifications are applicable to a wider class of problems with improved convergence qualities. This is shown by a numerical example. {\bf Key Words:} non-symmetric linear system, sparse secant method, incomplete factorization. AMS(MOS) {\bf Subject Classifications:} 65F10, 65N20, 65N30.}, language = {en} } @misc{KornhuberRoitzsch1990, author = {Kornhuber, Ralf and Roitzsch, Rainer}, title = {Self Adaptive FEM Simulation of Reverse Biased pn-Junctions.}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-389}, number = {SC-90-10}, year = {1990}, abstract = {The potential distribution of reverse biased pn-junctions can be described by a double obstacle problem for the Laplacian. This problem is solved by a self adaptive Finite Element Method involving automatic termination criteria for the iterative solver, local error estimation and local mesh refinement. Special attention is paid to the efficient resolution of the geometries typically arising in semiconductor device simulation. The algorithm is applied to a reverse biased pn- junction with multi-step field plate and stop- electrode to illustrate its efficiency and reliability.}, language = {en} }