A computationally faster algorithm to test the stability of characteristic polynomials

Author： Kavitha Panneerselvam   Ramakalyan Ayyagari  

Publisher： Inderscience Publishers

ISSN： 1755-9340

Source： International Journal of Systems, Control and Communications, Vol.5, Iss.2, 2013-08, pp. : 166-176

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

An algorithm for computationally expensive engineering optimization problems

By Yoel Tenne  

International Journal of General Systems, Vol. 42, Iss. 5, 2013-07 ,pp. : 458-488

Taylor & Francis Ltd

Access to resources Recommend Favorite

A faster polynomial algorithm for 2-cyclic robotic scheduling

By Chu Chengbin  

Journal of Scheduling, Vol. 9, Iss. 5, 2006-10 ,pp. : 453-468

Springer Publishing Company

Access to resources Recommend Favorite

Approximate evaluations of characteristic polynomials of Boolean functions

By Lee D.   Wozniakowski H.  

Theoretical Computer Science, Vol. 262, Iss. 1, 2001-07 ,pp. : 37-68

Elsevier

Access to resources Recommend Favorite

Memetic algorithm using multi-surrogates for computationally expensive optimization problems

By Zhou Zongzhao   Ong Yew   Lim Meng   Lee Bu  

Soft Computing, Vol. 11, Iss. 10, 2007-08 ,pp. : 957-971

Springer Publishing Company

Access to resources Recommend Favorite

An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials

By Fortune S.  

Journal of Symbolic Computation, Vol. 33, Iss. 5, 2002-05 ,pp. : 627-646

Academic Press

Access to resources Recommend Favorite