Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Efficient convolution based impedance boundary conditions

Efficient convolution based impedance boundary conditions Purpose – The purpose of this paper is to propose an approach based on Convolution quadrature (CQ) for the modeling and the numerical treatment of impedance boundary condition. Design/methodology/approach – The model is derived from a general setting. Its discretization is discussed in details by providing pseudo‐codes and by performing their complexity analysis. The model is validated through several numerical experiments. Findings – CQ provides an efficient and accurate treatment of impedance boundary conditions. Originality/value – The paper suggests a new effective treatment of impedance boundary conditions. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering Emerald Publishing

Efficient convolution based impedance boundary conditions

Download PDF
14 pages

Loading next page...
 
/lp/emerald-publishing/efficient-convolution-based-impedance-boundary-conditions-d5s04kZ0fA
Publisher
Emerald Publishing
Copyright
Copyright © 2014 Emerald Group Publishing Limited. All rights reserved.
ISSN
0332-1649
DOI
10.1108/COMPEL-06-2013-0196
Publisher site
See Article on Publisher Site

Abstract

Purpose – The purpose of this paper is to propose an approach based on Convolution quadrature (CQ) for the modeling and the numerical treatment of impedance boundary condition. Design/methodology/approach – The model is derived from a general setting. Its discretization is discussed in details by providing pseudo‐codes and by performing their complexity analysis. The model is validated through several numerical experiments. Findings – CQ provides an efficient and accurate treatment of impedance boundary conditions. Originality/value – The paper suggests a new effective treatment of impedance boundary conditions.

Journal

COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering – Emerald Publishing

Published: Jul 1, 2014

Keywords: Eddy current; Convolution quadrature; Fast and oblivious algorithm; Impedance boundary conditions

References

  • Eddy Current Approximation of Maxwell Equations, Vol. 4 of Modelling, Simulation & Applications
    Alonso‐Rodriguez, A.; Valli, A.
  • Runge‐Kutta convolution quadrature for operators arising in wave propagation
    Banjai, L.; Lubich, C.; Melenk, J.M.
  • Efficient low order approximation for surface impedance boundary conditions in finite‐difference time‐domain method
    De Santis, V.; Cruciani, S.; Feliziani, M.; Okoniewski, M.
  • Solving Ordinary Differential Equations. II, Vol. 14 of Springer Series in Computational Mathematics
    Hairer, E.; Wanner, G.
  • Finite elements in computational electromagnetism
    Hiptmair, R.
  • Fast convolution quadrature based impedance boundary conditions
    Hiptmair, R.; López‐Fernández, M.; Paganini, A.
  • Numerical Methods for Elliptic and Parabolic Partial Differential Equations, Vol. 44 of Texts in Applied Mathematics
    Knabner, P.; Angermann, L.
  • A spectral order method for inverting sectorial Laplace transforms
    López‐Fernández, M.; Palencia, C.; Schädle, A.
  • Fast Runge‐Kutta approximation of inhomogeneous parabolic equations
    López‐Fernández, M.; Lubich, C.; Palencia, C.; Schädle, A.
  • Convolution quadrature and discretized operational calculus. I
    Lubich, C.
  • Convolution quadrature and discretized operational calculus. II
    Lubich, C.
  • Runge‐Kutta methods for parabolic equations and convolution quadrature
    Lubich, C.; Ostermann, A.
  • An efficient implementation of surface impedance boundary conditions for the finite‐difference time‐domain method
    Oh, K.S.; Schutt‐Aine, J.
  • Fast and oblivious convolution quadrature
    Schädle, A.; López‐Fernández, M.; Lubich, C.
  • Impedance boundary conditions for imperfectly conducting surfaces
    Senior, T.