Adaptive strategies for fast frequency sweeps
-
Yves Konke [1] ; Ortwin Farle [1] ; Andreas Köhler [2] ; Alwin Schultschik [1] ; Romanus Dyczij-Edlinger [1]
-
[1] Saarland University
Saarland University
Regionalverband Saarbrücken, Alemania
-
[2] Fraunhofer Institute for Integrated Circuits
Fraunhofer Institute for Integrated Circuits
Kreisfreie Stadt Erlangen, Alemania
-
- Localización: Compel: International journal for computation and mathematics in electrical and electronic engineering, ISSN 0332-1649, Vol. 30, Nº 6 (Special Issue: Advances in Computational Electromagnetics), 2011, págs. 1855-1869
- Idioma: inglés
- Enlaces
-
Resumen
Purpose – The purpose of this paper is to compare competing adaptive strategies for fast frequency sweeps for driven and waveguide‐mode problems and give recommendations for practical implementations.
Design/methodology/approach – The paper first summarizes the theory of adaptive strategies for multi‐point (MP) sweeps and then evaluates the efficiency of such methods by means of numerical examples.
Findings – The authors' numerical tests give clear evidence for exponential convergence. In the driven case, highly resonant structures lead to pronounced pre‐asymptotic regions, followed by almost immediate convergence. Bisection and greedy point‐placement methods behave similarly. Incremental indicators are trivial to implement and perform similarly well as residual‐based methods.
Research limitations/implications – While the underlying reduction methods can be extended to any kind of affine parameter‐dependence, the numerical tests of this paper are for polynomial parameter‐dependence only.
Practical implications – The present paper describes self‐adaptive point‐placement methods and termination criteria to make MP frequency sweeps more efficient and fully automatic.
Originality/value – The paper provides a self‐adaptive strategy that is efficient and easy to implement. Moreover, it demonstrates that exponential convergence rates can be reached in practice.
