@misc{NaegelDeuflhardWittum, author = {N{\"a}gel, Arne and Deuflhard, Peter and Wittum, Gabriel}, title = {Efficient Stiff Integration of Density Driven Flow Problems}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-70891}, abstract = {The paper investigates the efficient use of a linearly implicit stiff integrator for the numerical solution of density driven flow problems. Upon choosing a one-step method of extrapolation type (code LIMEX), the use of full Jacobians and reduced approximations are discussed. Numerical experiments include nonlinear density flow problems such as diffusion from a salt dome (2D), a (modified) Elder problem (3D), the saltpool benchmark (3D) and a real life salt dome problem (2D). The arising linear equations are solved using either a multigrid preconditioner from the software package UG4 or the sparse matrix solver SuperLU.}, language = {en} } @misc{FischerGoetschelWeiser, author = {Fischer, Lisa and G{\"o}tschel, Sebastian and Weiser, Martin}, title = {Lossy data compression reduces communication time in hybrid time-parallel integrators}, issn = {1438-0064}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-63961}, abstract = {Parallel in time methods for solving initial value problems are a means to increase the parallelism of numerical simulations. Hybrid parareal schemes interleaving the parallel in time iteration with an iterative solution of the individual time steps are among the most efficient methods for general nonlinear problems. Despite the hiding of communication time behind computation, communication has in certain situations a significant impact on the total runtime. Here we present strict, yet no sharp, error bounds for hybrid parareal methods with inexact communication due to lossy data compression, and derive theoretical estimates of the impact of compression on parallel efficiency of the algorithms. These and some computational experiments suggest that compression is a viable method to make hybrid parareal schemes robust with respect to low bandwidth setups.}, language = {en} } @misc{RuprechtSchaedleSchmidtetal., author = {Ruprecht, Daniel and Sch{\"a}dle, Achim and Schmidt, Frank and Zschiedrich, Lin}, title = {Transparent boundary conditons for time-dependent problems}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-9558}, number = {07-12}, abstract = {A new approach to derive transparent boundary conditions (TBCs) for wave, Schr{\"o}dinger, heat and drift-diffusion equations is presented. It relies on the pole condition and distinguishes between physical reasonable and unreasonable solutions by the location of the singularities of the spatial Laplace transform of the exterior solution. To obtain a numerical algorithm, a M{\"o}bius transform is applied to map the Laplace transform onto the unit disc. In the transformed coordinate the solution is expanded into a power series. Finally, equations for the coefficients of the power series are derived. These are coupled to the equation in the interior, and yield transparent boundary conditions. Numerical results are presented in the last section, showing that the error introduced by the new approximate TBCs decays exponentially in the number of coefficients.}, language = {en} } @misc{LopezFernandezLubichPalenciaetal., author = {Lopez-Fernandez, Maria and Lubich, Christian and Palencia, Cesar and Sch{\"a}dle, Achim}, title = {Fast Runge-Kutta approximation of inhomogeneous parabolic equations}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-8443}, number = {05-10}, abstract = {The result after \$N\$ steps of an implicit Runge-Kutta time discretization of an inhomogeneous linear parabolic differential equation is computed, up to accuracy \$\varepsilon\$, by solving only \$\$O\Big(\log N\, \log \frac1\varepsilon \Big) \$\$ linear systems of equations. We derive, analyse, and numerically illustrate this fast algorithm.}, 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{HohageSchmidt, author = {Hohage, Thorsten and Schmidt, Frank}, title = {On the Numerical Solution of Nonlinear Schr{\"o}dinger type equations in fiber optics}, url = {http://nbn-resolving.de/urn:nbn:de:0297-zib-6715}, number = {02-04}, abstract = {The aim of this paper is to develop fast methods for the solution of nonlinear Schr{\"o}dinger type equations in fiber optics. Using the method of lines we have to solve a stiff system of ordinary differential equations where the eigenvalues of the Jacobian are close to the imaginary axis. This is usually done by a Split Step method. Here we consider the extrapolation of Split Step methods with adaptive order and step size control. For more complicated nonlinearities, in particular stimulated Raman scattering, Split Step methods are less efficient since symmetry is either destroyed or requires much additional effort. In this case we use implicit Runge Kutta formulas of Gauß type. The key point for the efficient implementation of these methods is that the system of nonlinear algebraic equations can be solved without setting up the Jacobian. The proposed methods are compared to other methods, in particular exponential integrators, the method of Marcuse, and the method of Blow and Wood.}, language = {en} }