65N30 Finite elements, Rayleigh-Ritz and Galerkin methods, finite methods
Refine
Year of publication
Document Type
- ZIB-Report (20)
- Habilitation (1)
Language
- English (21)
Is part of the Bibliography
- no (21)
Keywords
- finite elements (4)
- Maxwell's equations (3)
- preconditioned conjugate gradient methods (3)
- Helmholtz equation (2)
- adaptive mesh refinement (2)
- discontinuous solution (2)
- edge elements (2)
- embedded interface (2)
- finite volume methods (2)
- hierarchical basis (2)
- perfectly matched layer (2)
- Algebraic multigrid (1)
- Domain Decomposition (1)
- Elliptic equations (1)
- Fini (1)
- Finite Elements (1)
- Finite Volumen (1)
- Multigrid Methods (1)
- N\'{e}d\'{e}lec spaces (1)
- Pelvic heating (1)
- Poisson equation (1)
- Pole condition (1)
- Rayleigh-Ritz and Galerkin Methods (1)
- Schroedinger equation (1)
- Transparent boundary conditions (1)
- Unbounded domains (1)
- Wide angle one-way equation (1)
- adaptive (1)
- adaptive finite elements (1)
- adaptive grid orientation (1)
- adaptive grid refinement (1)
- ariable and discontinuous coefficients (1)
- convection diffusion equation (1)
- countable (1)
- differential equations: (1)
- directed refinement (1)
- discontinuous finite element (1)
- diskontinuierliche Lösung (1)
- eigenvalue problem (1)
- eingebettete Ränder (1)
- elliptische Gleichungen (1)
- finite element method (1)
- finite element methods: (1)
- grid generation (1)
- hamiltonian (1)
- hyperthermia (1)
- incomplete factorization (1)
- internal and boundary layers (1)
- medical t (1)
- mesh coarsening (1)
- multigrid (1)
- multigrid methods (1)
- multilevel (1)
- multilevel methods (1)
- neutron transport equation (1)
- non-symmetric linear systems (1)
- nonlinear heat transfer (1)
- nonuniform meshes (1)
- optical chip design (1)
- optimal convergence rates (1)
- ordinary (1)
- partial (1)
- phased array optimization (1)
- pole condition (1)
- sparse secant method (1)
- symmetric Gauss-Seidel (1)
- transparent boundary conditions (1)
- variable and discontinuous coefficients (1)
- variable und diskontinuierliche Koeffizienten (1)
- waveguide (1)
Institute
- ZIB Allgemein (21) (remove)
We present a second order sharp interface finite volume method for the solution of the three-dimensional poisson equation with variable coefficients on Cartesian grids. In particular, we focus on interface problems with discontinuities in the coefficient, the source term, the solution, and the fluxes across the interface. The method uses standard piecewiese trilinear finite elements for normal cells and a double piecewise trilinear ansatz for the solution on cells intersected by the interface resulting always in a compact 27-point stencil. Singularities associated with vanishing partial volumes of intersected grid cells are removed by a two-term asymptotic approach. In contrast to the 2D method presented by two of the authors in [M.~Oevermann, R.~Klein: A Cartesian grid finite volume method for elliptic equations with variable coefficients and embedded interfaces, J.~Comp.~Phys.~219 (2006)] we use a minimization technique to determine the unknown coefficients of the double trilinear ansatz. This simplifies the treatment of the different cut-cell types and avoids additional special operations for degenerated interface topologies. The resulting set of linear equations has been solved with a BiCGSTAB solver preconditioned with an algebraic multigrid. In various testcases -- including large coefficient ratios and non-smooth interfaces -- the method achieves second order of accuracy in the L_inf and L_2 norm.
We present a finite volume method for the solution of the two-dimensional Poisson equation $ \nabla\cdot( \beta( {\mbox{\boldmath $x$}}) \nabla u({\mbox{\boldmath $x$}})) = f(\mbox{\boldmath $x$}) $ with variable, discontinuous coefficients and solution discontinuities on irregular domains. The method uses bilinear ansatz functions on Cartesian grids for the solution $u({\mbox{\boldmath $x$})$ resulting in a compact nine-point stencil. The resulting linear problem has been solved with a standard multigrid solver. Singularities associated with vanishing partial volumes of intersected grid cells or the dual bilinear ansatz itself are removed by a two-step asymptotic approach. The method achieves second order of accuracy in the $L^\infty$ and $L^2$ norm.
In this paper we propose a new finite element realization of the Perfectly Matched Layer method (PML-method). Our approach allows to deal with arbitrary shaped polygonal domains and with certain types of inhomogeneous exterior domains. Among the covered inhomogeneities are open waveguide structures playing an essential role in integrated optics. We give a detailed insight to implementation aspects. Numerical examples show exponential convergence behavior to the exact solution with the thickness of the PML sponge layer.
The solution of scattering problems described by the Helmholtz equation on unbounded domains is of importance for a wide variety of applications, for example in electromagnetics and acoustics. An implementation of a solver for scattering problems based on the programming language Matlab is introduced. The solver relies on the finite-element-method and on the perfectly-matched-layer-method, which allows for the simulation of scattering problems on complex geometries surrounded by inhomogeneous exterior domains. This report gives a number of detailed examples and can be understood as a user manual to the freely accessible code of the solver HelmPole.
The work presents a new approach to the numerical solution of time-harmonic and time-dependent scattering problems. We replace Sommerfeld's radiation condition valid for the Helmholtz equation by a more general concept called pole condition. The pole condition is based on the Laplace transform of the exterior solution and allows a characterization of outgoing waves. Both new insight into the analysis of scattering problems as well as new numerical algorithms are obtained.
Adaptive Multigrid Methods for the Vectorial Maxwell Eigenvalue Problem for Optical Waveguide Design
(2000)
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.
Electromagnetic phased arrays for regional hyperthermia -- optimal frequency and antenna arrangement
(2000)
In this paper we investigate the effects of the three-dimensional arrangement of antennas and frequency on temperature distributions that can be achieved in regional hyperthermia using an electromagnetic phased array. We compare the results of power-based and temperature-based optimization. Thus we are able to explain the discrepancies between previous studies favouring more antenna rings on the one hand and more antennas per ring on the other hand. We analyze the sensitivity of the results with respect to changes in amplitudes and phases as well as patient position. This analysis can be used for different purposes. First, it provides additional criteria for selecting the optimal frequency. Second, it can be used for specifying the required phase and amplitude accuracy for a real phased array system. Furthermore, it may serve as a basis for technological developments in order to reduce both types of sensitivities described above.
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.
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.
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.