Abstract
In electrical circuit analysis, it is often necessary to find the set of all direct current (d.c.) operating points (either voltages or currents) of nonlinear circuits. In general, these nonlinear equations are often represented as polynomial systems. In this paper, we address the problem of finding the solutions of nonlinear electrical circuits, which are modeled as systems of n polynomial equations contained in an n-dimensional box. Branch and Bound algorithms based on interval methods can give guaranteed enclosures for the solution. However, because of repeated evaluations of the function values, these methods tend to become slower. Branch and Bound algorithm based on Bernstein coefficients can be used to solve the systems of polynomial equations. This avoids the repeated evaluation of function values, but maintains more or less the same number of iterations as that of interval branch and bound methods. We propose an algorithm for obtaining the solution of polynomial systems, which includes a pruning step using Bernstein Krawczyk operator and a Bernstein Coefficient Contraction algorithm to obtain Bernstein coefficients of the new domain. We solved three circuit analysis problems using our proposed algorithm. We compared the performance of our proposed algorithm with INTLAB based solver and found that our proposed algorithm is more efficient and fast.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
J. Verschelde. The PHC Pack, Database of Polynomial Systems, Technical Report, Mathematics Department, University of Illinois, Chicago, USA, 2001.
L. Kolev. An interval method for global nonlinear analysis. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 45, no. 5, pp. 675–683, 2000.
C. Jager, D. Ratz. A combined method for enclosing all solutions of non-linear systems of polynomial equations. Reliable Computing, vol. 1, no. 1, pp. 41–64, 1995.
E. R. Hansen, G. W. Walster. Global Optimization Using Interval Analysis, 2nd ed., New York, USA: Marcel Dekker Inc, 2004.
R. E. Moore. Methods and Applications of Interval Analysis, Philadelphia, USA: SIAM, 1979.
R. Hammer, M. Hocks, U. Kulisch, D. Ratz. Numerical Toolbox for Verified Computing I, Berlin, Germany: Springer-Verlag, 1991.
P. S. V. Nataraj, S. Sondur. Construction of bode envelope using REP based range finding algorithms. International Journal of Automation and Computing, vol. 8, no. 1, pp. 112–121, 2011.
P. S. V. Nataraj, M. Arounassalame. Solving polynomial systems using combined Bernstein Krawczyk subdivision algorithm. In Proceedings of International Conference on Computer Aided Engineering, IIT Madras, Chennai, India, pp. 682–689, 2007.
P. S. V. Nataraj, M. Arounassalame. Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm. Journal of Global Optimization, vol. 49, no. 2, pp. 185–212, 2011.
L. Jaulin, M. Kieffer, O. Didrit, E. Walter. Applied Interval Analysis, 1st ed., London, USA: Springer-Verlag, 2001.
S. M. Rump. INTLAB-Interval Laboratory, Developments in Reliable Computing, Dordrecht, Netherlands: Kluwer Academic Publishers, pp. 77–104, 1999.
R. B. Kearfott. Rigorous Global Search: Continuous Problems, Dordrecht, Netherlands: Kluwer Academic Publishers, 1996.
G. I. Hargreaves. Interval analysis in MATLAB, Numerical analysis report no. 416, Department of Mathematics, The University of Manchester, 2002.
J. Garloff. The Bernstein algorithm, interval computations, vol. 2, pp. 154–168, 1993.
P. S. V. Nataraj, M. Arounassalame. A new subdivision algorithm for the Bernstein polynomial approach to global optimization. International Journal of Automation and Computing, vol. 4, no. 4, pp. 342–352, 2007.
M. Zettler, J. Garloff. Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion. IEEE Transactions on Automatic Control, vol. 43, no. 3, pp. 425–431, 1998.
S. Ray, P. S. V. Nataraj. An efficient algorithm for range computation of polynomials using the Bernstein form. Journal of Global Optimization, vol. 45, no. 3, pp. 403–426, 2009.
J. Garloff. Convergent bounds for the range of multivariate polynomials. Lecture Notes in Computer Science, vol. 212, pp. 37–56, 1985.
J. Berchtold, I. Voiculescu, A. Bowyer. Multivariate Bernstein Form Polynomials, Technical Report 31/98, School of Mechanical Engineering, University of Bath, UK, 1998.
D. Ratz, T. Csendes. On the selection of subdivision directions in interval branch-and-bound methods for global optimization. Journal of Global Optimization, vol. 7, no. 2, pp. 183–207, 1995.
L. Koleve. Interval Methods for Circuit Analysis, Singapore: World scientific, 1993.
The Mathworks Inc., MATLAB version 7, Natick, MA, 2005.
Author information
Authors and Affiliations
Corresponding author
Additional information
M. Arounassalame received the B. Tech. degree from Pondicherry University, India in 1993 and M.Tech. degree from University of Calicut, India in 1998. He received the Ph.D. degree in systems and control engineering from IIT Bombay, India in 2009. Presently, he is working as an assistant professor at the Department of Electrical and Electronics Engineering, Pondicherry Engineering College, India.
His research interests include applications of global optimization algorithms to robust stability analysis and control, Bernstein polynomials, and nonlinear circuit analysis.
Rights and permissions
About this article
Cite this article
Arounassalame, M. Analysis of nonlinear electrical circuits using bernstein polynomials. Int. J. Autom. Comput. 9, 81–86 (2012). https://doi.org/10.1007/s11633-012-0619-3
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11633-012-0619-3