TY - JOUR
T1 - Homotopy method for finding the steady states of oscillators
AU - Brachtendorf, Hans Georg
AU - Melville, Robert
AU - Feldmann, Peter
AU - Lampe, Siegmar
AU - Laur, Rainer
PY - 2014/6
Y1 - 2014/6
N2 - Shooting, finite difference, or harmonic balance techniques in conjunction with a damped Newton method are widely employed for the numerical calculation of limit cycles of (free-running, autonomous) oscillators. In some cases, however, nonconvergence occurs when the initial estimate of the solution is not close enough to the exact one. Generally, the higher the quality factor of the oscillator the tighter are the constraints for the initial estimate. A 2-D homotopy method is presented in this paper that overcomes this problem. The resulting linear set of equations is underdetermined, leading to a nullspace of rank two. This underdetermined system is solved in a least squares sense for which a rigorous mathematical basis can be derived. An efficient algorithm for solving the least squares problem is derived where sparse matrix techniques can be used. As continuation methods are only employed for obtaining a sufficient initial guess of the limit cycle, a coarse grid discretization is sufficient to make the method runtime efficient.
AB - Shooting, finite difference, or harmonic balance techniques in conjunction with a damped Newton method are widely employed for the numerical calculation of limit cycles of (free-running, autonomous) oscillators. In some cases, however, nonconvergence occurs when the initial estimate of the solution is not close enough to the exact one. Generally, the higher the quality factor of the oscillator the tighter are the constraints for the initial estimate. A 2-D homotopy method is presented in this paper that overcomes this problem. The resulting linear set of equations is underdetermined, leading to a nullspace of rank two. This underdetermined system is solved in a least squares sense for which a rigorous mathematical basis can be derived. An efficient algorithm for solving the least squares problem is derived where sparse matrix techniques can be used. As continuation methods are only employed for obtaining a sufficient initial guess of the limit cycle, a coarse grid discretization is sufficient to make the method runtime efficient.
KW - Continuation
KW - homotopy
KW - oscillator simulation
KW - path following method
KW - quartz crystal oscillators
KW - steady state
UR - http://www.scopus.com/inward/record.url?scp=84901312062&partnerID=8YFLogxK
U2 - 10.1109/TCAD.2014.2302637
DO - 10.1109/TCAD.2014.2302637
M3 - Article
AN - SCOPUS:84901312062
SN - 0278-0070
VL - 33
SP - 867
EP - 878
JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
IS - 6
M1 - 6816118
ER -