TY - GEN A1 - Sander, Oliver A1 - Krause, Rolf T1 - Automatic Construction of Boundary Parametrizations for Geometric Multigrid Solvers N2 - We present an algorithm that constructs parametrizations of boundary and interface surfaces automatically. Starting with high-resolution triangulated surfaces describing the computational domains, we iteratively simplify the surfaces yielding a coarse approximation of the boundaries with the same topological type. While simplifying we construct a function that is defined on the coarse surface and whose image is the original surface. This function allows access to the correct shape and surface normals of the original surface as well as to any kind of data defined on it. Such information can be used by geometric multigrid solvers doing adaptive mesh refinement. Our algorithm runs stable on all types of input surfaces, including those that describe domains consisting of several materials. We have used our method with success in different fields and we discuss examples from structural mechanics and biomechanics. T3 - ZIB-Report - 03-02 KW - boundary parametrization KW - surface simplification KW - multigrid KW - geometry Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7240 ER - TY - GEN A1 - Schädle, Achim A1 - Zschiedrich, Lin A1 - Burger, Sven A1 - Klose, Roland A1 - Schmidt, Frank T1 - Domain Decomposition Method for Maxwell's Equations: Scattering off Periodic Structures N2 - We present a domain decomposition approach for the computation of the electromagnetic field within periodic structures. We use a Schwarz method with transparent boundary conditions at the interfaces of the domains. Transparent boundary conditions are approximated by the perfectly matched layer method (PML). To cope with Wood anomalies appearing in periodic structures an adaptive strategy to determine optimal PML parameters is developed. We focus on the application to typical EUV lithography line masks. Light propagation within the multi-layer stack of the EUV mask is treated analytically. This results in a drastic reduction of the computational costs and allows for the simulation of next generation lithography masks on a standard personal computer. T3 - ZIB-Report - 06-04 KW - domain decomposition KW - conical diffraction KW - electro-magnetic scattering KW - Maxwell's equations KW - Lithography KW - finite elements Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8984 ER - TY - GEN A1 - Schädle, Achim A1 - Zschiedrich, Lin T1 - Additive Schwarz method for scattering problems using the PML method at interfaces N2 - Scattering problems in integrated optics can be modeled in simple cases by the Helmholtz equation. The computational domain is truncated by a non-reflecting boundary condition. We investigate Schwarz algorithms with a sort of DtN operator, realized by the PML-method, at the interfaces of the sub-domains as an iterative solver. T3 - ZIB-Report - 05-27 KW - perfectly matched layer KW - Helmholtz equation KW - scattering KW - domain decomposition Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8613 ER - TY - GEN A1 - Braess, Dietrich A1 - Deuflhard, Peter A1 - Lipnikov, Konstantin T1 - A Subspace Cascadic Multigrid Method for Mortar Elements N2 - A cascadic multigrid (CMG) method for elliptic problems with strong material jumps is proposed and analyzed. Non--matching grids at interfaces between subdomains are allowed and treated by mortar elements. The arising saddle point problems are solved by a subspace confined conjugate gradient method as smoother for the CMG. Details of algorithmic realization including adaptivity are elaborated. Numerical results illustrate the efficiency of this CMG algorithm. T3 - ZIB-Report - SC-99-07 KW - Finite Elements KW - Rayleigh-Ritz and Galerkin Methods KW - Multigrid Methods KW - Domain Decomposition Y1 - 1999 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-3954 ER - TY - GEN A1 - Deuflhard, Peter T1 - Differential Equations in Technology and Medicine. Computational Concepts, Adaptive Algorithms, and Virtual Labs N2 - This series of lectures has been given to a class of mathematics postdocs at a European summer school on Computational Mathematics Driven by Industrial Applications in Martina Franca, Italy (organized by CIME). It deals with a variety of challenging real life problems selected from clinical cancer therapy, communication technology, polymer production, and pharmaceutical drug design. All of these problems from rather diverse application areas share two common features: (a) they have been modelled by various differential equations -- elliptic, parabolic, or Schrödinger--type partial differential equations, countable ordinary diffential equations, or Hamiltonian systems, (b) their numerical solution has turned out to be real challenge to computational mathematics. T3 - ZIB-Report - SC-99-34 KW - differential equations: KW - ordinary KW - partial KW - countable KW - hamiltonian KW - finite element methods: KW - adaptive KW - multilevel KW - grid generation KW - medical t Y1 - 1999 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-4223 ER - TY - GEN A1 - Beck, Rudolf T1 - Algebraic Multigrid by Component Splitting for Edge Elements on Simplicial Triangulations N2 - Our focus is on Maxwell's equations in the low frequency range; two specific applications we aim at are time-stepping schemes for eddy current computations and the stationary double-curl equation for time-harmonic fields. We assume that the computational domain is discretized by triangles or tetrahedrons; for the finite element approximation we choose N\'{e}d\'{e}lec's $H(curl)$-conforming edge elements of the lowest order. For the solution of the arising linear equation systems we devise an algebraic multigrid preconditioner based on a spatial component splitting of the field. Mesh coarsening takes place in an auxiliary subspace, which is constructed with the aid of a nodal vector basis. Within this subspace coarse grids are created by exploiting the matrix graphs. Additionally, we have to cope with the kernel of the $curl$-operator, which comprises a considerable part of the spectral modes on the grid. Fortunately, the kernel modes are accessible via a discrete Helmholtz decomposition of the fields; they are smoothed by additional algebraic multigrid cycles. Numerical experiments are included in order to assess the efficacy of the proposed algorithms. T3 - ZIB-Report - SC-99-40 KW - Algebraic multigrid KW - mesh coarsening KW - edge elements KW - N\'{e}d\'{e}lec spaces KW - Maxwell's equations Y1 - 1999 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-4290 ER - TY - GEN A1 - Bornemann, Folkmar A. A1 - Yserentant, Harry T1 - A Basic Norm Equivalence for the Theory of Multilevel Methods. N2 - Subspace decompositions of finite element spaces based on $L2$-like orthogonal projections play an important role for the construction and analysis of multigrid like iterative methods. Recently several authors proved the equivalence of the associated discrete norms with the $H^1$-norm. The present report gives an elementary, self-contained derivation of this result which is based on the use of $ K$-functionals known from the theory of interpolation spaces. {\bf Keywords:} multilevel methods, nonuniform meshes, optimal convergence rates. {\bf AMS(MOS) Subject classifications:} 65N55, 65N30, 65N50. T3 - ZIB-Report - SC-92-01 KW - multilevel methods KW - nonuniform meshes KW - optimal convergence rates Y1 - 1992 U6 - https://doi.org/10.1007/BF01388699 N1 - No preprint available ER - TY - GEN A1 - Kornhuber, Ralf T1 - Monotone Iterations for Elliptic Variational Inequalities N2 - A wide range of free boundary problems occurring in engineering andindustry can be rewritten as a minimization problem for astrictly convex, piecewise smooth but non--differentiable energy functional.The fast solution of related discretized problemsis a very delicate question, because usual Newton techniquescannot be applied. We propose a new approach based on convex minimization and constrained Newton type linearization. While convex minimization provides global convergence of the overall iteration, the subsequent constrained Newton type linearization is intended to accelerate the convergence speed. We present a general convergence theory and discuss several applications. T3 - ZIB-Report - SC-98-10 KW - finite elements KW - multigrid methods KW - variational inequalities Y1 - 1998 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-3539 ER - TY - GEN A1 - Beck, Rudolf T1 - Graph-Based Algebraic Multigrid for Lagrange-Type Finite Elements on Simplicial Meshes N2 - We present an algebraic multigrid preconditioner which uses only the graphs of system matrices. Some elementary coarsening rules are stated, from which an advancing front algorithm for the selection of coarse grid nodes is derived. This technique can be applied to linear Lagrange-type finite element discretizations; for higher-order elements an extension of the multigrid algorithm is provided. Both two- and three-dimensional second order elliptic problems can be handled. Numerical experiments show that the resulting convergence acceleration is comparable to classical geometric multigrid. T3 - ZIB-Report - SC-99-22 KW - Algebraic multigrid KW - mesh coarsening KW - preconditioning Y1 - 1999 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-4100 ER - TY - GEN A1 - Schmidt, Frank A1 - Friese, Tilmann A1 - Zschiedrich, Lin A1 - Deuflhard, Peter T1 - Adaptive Multigrid Methods for the Vectorial Maxwell Eigenvalue Problem for Optical Waveguide Design N2 - This paper has been motivated by the need for a fast robust adaptive multigrid method to solve the vectorial Maxwell eigenvalue problem arising from the design of optical chips. Our nonlinear multigrid methods are based on a previous method for the scalar Helmholtz equation, which must be modified to cope with the null space of the Maxwell operator due to the divergence condition. We present two different approaches. First, we present a multigrid algorithm based on an edge element discretization of time-harmonic Maxwell's equations, including the divergence condition. Second, an explicit elimination of longitudinal magnetic components leads to a nodal discretization known to avoid discrete \emph{spurious modes} also and a vectorial eigenvalue problem, for which we present a multigrid solver. Numerical examples show that the edge element discretization clearly outperforms the nodal element approach. T3 - ZIB-Report - 00-54 KW - Maxwell's equations KW - eigenvalue problem KW - edge elements KW - multigrid methods KW - waveguide KW - optical chip design Y1 - 2000 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6228 ER -