<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462003000300006</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[One Approach to the Time-Optimal Strategy Formulation for Analog Circuit Design]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Zemliak]]></surname>
<given-names><![CDATA[Alexander]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rios]]></surname>
<given-names><![CDATA[Eduardo]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Zemliak]]></surname>
<given-names><![CDATA[Kirill]]></given-names>
</name>
<xref ref-type="aff" rid="A03"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universidad Autónoma de Puebla Departamento de Física y Matemáticas ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>México</country>
</aff>
<aff id="A02">
<institution><![CDATA[,Universidad Autónoma de Puebla Departamento de Electrónica ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>México</country>
</aff>
<aff id="A03">
<institution><![CDATA[,Universidad Autónoma de Puebla Departamento de Computación ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>México</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2003</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2003</year>
</pub-date>
<volume>7</volume>
<numero>1</numero>
<fpage>51</fpage>
<lpage>65</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462003000300006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462003000300006&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462003000300006&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[The formulation of the process of analog system design has been done on the basis of the control theory application. This approach produces many different design strategies inside the same optimization procedure and allows determining the problem of the optimal design strategy existence from the computer time point of view. Different kinds of system design strategies have been evaluated from the operations number. This analysis shows that the traditional approach is not time-optimal at least for the electronic circuit design. General methodology for any analog system design was formulated by means of the optimum control theory. The main equations for this design methodology include the special control functions that are introduced to generalize the design process. The problem of the time-optimal design algorithm construction is defined as the minimal-time problem of the control theory. Numerical results of some nonlinear passive and active electronic circuit design demonstrate the efficiency of the proposed methodology.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Time-optimal design strategy]]></kwd>
<kwd lng="en"><![CDATA[control theory application]]></kwd>
<kwd lng="en"><![CDATA[minimum-time problem]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[ <p align="justify"><font face="verdana" size="4">Art&iacute;culo</font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="4"><b>One Approach to the Time&#150;Optimal Strategy Formulation for </b><b>Analog Circuit Design</b></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="2"><b>Alexander Zemliak<sup>1</sup>, Eduardo Rios<sup>2</sup>, Kirill Zemliak<sup>3</sup></b></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><i><sup>1</sup> Departamento de F&iacute;sica y Matem&aacute;ticas, Universidad Aut&oacute;noma de Puebla, M&eacute;xico. E&#150;mail: <a href="mailto:azemliak@fcfm.buap.mx">azemliak@fcfm.buap.mx</a></i></font></p>     <p align="justify"><font face="verdana" size="2"><i><sup>2 </sup>Departamento de Electr&oacute;nica, Universidad Aut&oacute;noma de Puebla, M&eacute;xico. E&#150;mail: <a href="mailto:erios@ece.buap.mx">erios@ece.buap.mx</a></i></font></p>     <p align="justify"><font face="verdana" size="2"><i><sup>3 </sup>Departamento de Computaci&oacute;n, Universidad Aut&oacute;noma de Puebla, M&eacute;xico. E&#150;mail: <a href="mailto:kzemliak@yahoo.com">kzemliak@yahoo.com</a></i></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2"><b>Abstract</b></font></p>     <p align="justify"><font face="verdana" size="2">The formulation of the process of analog system design has been done on the basis of the control theory application. This approach produces many different design strategies inside the same optimization procedure and allows determining the problem of the optimal design strategy existence from the computer time point of view. Different kinds of system design strategies have been evaluated from the operations number. This analysis shows that the traditional approach is not time&#150;optimal at least for the electronic circuit design. General methodology for any analog system design was formulated by means of the optimum control theory. The main equations for this design methodology include the special control functions that are introduced to generalize the design process. The problem of the time&#150;optimal design algorithm construction is defined as the minimal&#150;time problem of the control theory. Numerical results of some nonlinear passive and active electronic circuit design demonstrate the efficiency of the proposed methodology.</font></p>     <p align="justify"><font face="verdana" size="2"><b>Keywords: </b>Time&#150;optimal design strategy, control theory application, minimum&#150;time problem.</font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><a href="/pdf/cys/v7n1/v7n1a6.pdf" target="_blank">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>Acknowledgments</b></font></p>     <p align="justify"><font face="verdana" size="2">This work was supported partially by Universidad Aut&oacute;noma de Puebla under the project No. VIEP III5G02.</font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>References</b></font></p>     ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">1. <b>Brayton    R.K.,   G.D.   Hachtel,   </b>and   <b>A.L.   Sangiovanni&#150;</b><b>Vincentelli, </b>"A   survey   of optimization  techniques  for integrated&#150;circuit design", <i>Proc. IEEE, </i>vol. 69, pp. 1334&#150; 1362, 1981.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035467&pid=S1405-5546200300030000600001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">2. <b>Bunch    J.R.,    </b>and    <b>D.J.    Rose,   </b>Eds.,   <i>Sparse   Matrix </i><i>Computations, </i>Acad. Press, N.Y., 1976.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035468&pid=S1405-5546200300030000600002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">3. <b>Costello J., </b>"Delivering Quality Delivers Profits", Plenary speech in <i>2001 IEEE 2<sup>nd</sup> Int. Symp. on Quality Electronic </i><i>Design, </i>San Jose, CA, March 2001, p. 23.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035469&pid=S1405-5546200300030000600003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">4. <b>Duff I.S., </b>and <b>J.K. Reid, </b>"Some Design Features of a Sparse Matrix Code", <i>ACM Trans. on Mathematical Software, </i>vol. 5, no. 1, pp. 18&#150;35, 1979.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035470&pid=S1405-5546200300030000600004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">5. <b>Fedorenko, R.P., </b><i>Approximate Solution of Optimal Control </i><i>Problems, </i>Nauka, Moscow, 1978.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035471&pid=S1405-5546200300030000600005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">6. <b>Fletcher, R., </b>and <b>C.M. Reeves, </b>"Function Minimization by Conjugate Gradients", <i>Comput. J., </i>Vol. 7, 1964, pp. 149&#150;154.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035472&pid=S1405-5546200300030000600006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">7. <b>Fletcher, R., </b>and <b>M.J.D. Powell, </b>"A Rapidly Convergent Descent Method for Minimization", <i>Comput. J., </i>Vol 6, 1963, pp. 163&#150;168.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035473&pid=S1405-5546200300030000600007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">8. <b>Fletcher   R.,  </b><i>Practical Methods   of Optimization, </i>John Wiley and Sons, N.Y., vol. 1, 1980, vol. 2, 1981.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035474&pid=S1405-5546200300030000600008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">9. <b>George A.</b>,   "On   Block   Elimination   for   Sparse   Linear Systems", <i>SIAM J. Numer. Anal. </i>vol. 11, no.3, 1984,       pp. 585&#150;603.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035475&pid=S1405-5546200300030000600009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">10. <b>Gill   P.E.,   W.   Murray,   </b>and   <b>M.H.   Wright,  </b><i>Practical </i><i>optimization, </i>Academic Press, London, 1981.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035476&pid=S1405-5546200300030000600010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">11. <b>Hooke, R</b>., and  <b>T.A. Jeeves</b>, "Direct Search Solution of Numerical and Statistical Problems", <i>JACM, </i>Vol. 8, 1961, pp. 212&#150;229.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035477&pid=S1405-5546200300030000600011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">12. <b>Krylov,    I.A.,    </b>and    <b>F.L.     Chernousko,    </b>"Consecutive Approximation Algorithm for Optimal Control Problems", <i>J. </i><i>of Numer. Math. and Math. Pfysics, </i>Vol 12, No. 1, 1972, pp. 14&#150;34.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035478&pid=S1405-5546200300030000600012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">13. <b>Massara R.E., </b><i>Optimization Methods in Electronic Circuit </i><i>Design, </i>Longman Scientific &amp; Technical, Harlow, 1991.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035479&pid=S1405-5546200300030000600013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">14. <b>Neustadt, L.W.</b>,   "Synthesis   of   Time&#150;Optimal   Control Systems", <i>J. of Math. Analysis and Applications, </i>Vol. 1, 1960, pp. 484&#150;492.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035480&pid=S1405-5546200300030000600014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">15. <b>Osterby  O., </b>and   <b>Z.  Zlatev,  </b><i>Direct Methods for Sparse </i><i>Matrices, </i>Springer&#150;Verlag, N.Y., 1983.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035481&pid=S1405-5546200300030000600015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">16. <b>Pontryagin, L.S., V.G. Boltyanskii, R.V. Gamkrelidze, </b>and <b>E.F. Mishchenko, </b><i>The Mathematical  Theory  of Optimal </i><i>Processes. </i>Interscience Publishers, Inc., New York, 1962.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035482&pid=S1405-5546200300030000600016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">17. <b>Rabat N., A.E. Ruehli, G.W. Mahoney, </b>and <b>J.J. Coleman, </b>"A Survey of Macromodeling", <i>IEEE Int. Symp. Circuits </i><i>Systems, </i>April 1985, pp. 139&#150;143.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035483&pid=S1405-5546200300030000600017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">18. <b>Rosen J.B.</b>, "Iterative Solution of Nonlinear Optimal Control Problems", <i>J. SIAM, Control Series A, </i>1966,       pp. 223&#150;244.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035484&pid=S1405-5546200300030000600018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">19. <b>Ruehli A., A.   Sangiovanni&#150;Vincentelli, </b>and   <b>G. Rabbat, </b>"Time Analysis of Large&#150;Scale Circuits Containing One&#150;Way Macromodels", <i>IEEE Trans. Circuits Syst., </i>vol. CAS&#150; 29, no. 3, 1982, pp. 185&#150;191.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035485&pid=S1405-5546200300030000600019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">20. <b>Ruehli  A.E.,   </b>and   <b>G.   Ditlow,   </b>"Circuit  Analysis,  Logic Simulation and Design Verification for VLSI", <i>Proc. IEEE, </i>vol. 71, no. 1, 1983, pp. 36&#150;68.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035486&pid=S1405-5546200300030000600020&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">21. <b>Ruehli A.E., </b>Ed., <i>Circuit Analysis, Simulation and Design, </i>vol. 3, part 2, Elsevier Science Publishers, Amsterdam, 1987.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035487&pid=S1405-5546200300030000600021&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">22. <b>Sangiovanni &#150;Vincentelli A., L.K. Chen, </b>and<b> L.O. Chua, </b>"An Efficient Cluster Algorithm for Tearing Large&#150;Scale Networks ", IEEE Trans. Circuits Syst., vol. CAS&#150;24, no. 12, 1977, pp. 709&#150;717. </font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035488&pid=S1405-5546200300030000600022&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">23. <b>Sepulchre    R.,    M.    Jankovic,    </b>and<b> P.V.    Kokotovic, </b><i>Constructive  Nonlinear   Control,   Springer&#150;Verlag,   N.Y., </i>1997.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035489&pid=S1405-5546200300030000600023&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">24. <b>Slotine   J.E.,   </b>and  <b>W.   Li, </b><i>Applied Nonlinear  Control, </i>Englewood Cliffs, Prentice&#150;Hall, NJ, 1991.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035490&pid=S1405-5546200300030000600024&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">25. <b>Tabak D., </b>and   <b>B.C. Kuo, </b>"Applications of Mathematical Programming in the Design of Optimal Control Systems", <i>Int. Journal of Control, </i>Vol. 10, No. 5, 1969, pp. 548&#150;552.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035491&pid=S1405-5546200300030000600025&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">26. <b>Wu F.F.</b>, "Solution of Large&#150;Scale Networks by Tearing", <i>IEEE Trans. Circuits Syst., </i>vol. CAS&#150;23, no. 12, 1976,     pp. 706&#150;713.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035492&pid=S1405-5546200300030000600026&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">27. <b>Zemliak A., </b>"System    Design    Strategy    by    Optimum Control  Theory  Formulation", in <i>14th European Conf. on </i><i>Circuit Theory and Design, </i>Stresa, Italy, Aug. 1999, Vol. 2, 1371&#150;1374.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035493&pid=S1405-5546200300030000600027&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">28. <b>Zemliak A., </b>"One Approach to Analog System Design Problem Formulation", in <i>2001 IEEE 2<sup>nd</sup> Int. Symp. on </i><i>Quality Electronic Design, </i>San Jose, CA, March 2001, pp. 273&#150;278.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2035494&pid=S1405-5546200300030000600028&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --> ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Brayton]]></surname>
<given-names><![CDATA[R.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Hachtel]]></surname>
<given-names><![CDATA[G.D.]]></given-names>
</name>
<name>
<surname><![CDATA[Sangiovanni-Vincentelli]]></surname>
<given-names><![CDATA[A.L.]]></given-names>
</name>
</person-group>
<source><![CDATA[A survey of optimization techniques for integrated-circuit design]]></source>
<year>1981</year>
<volume>69</volume>
<conf-name><![CDATA[ Proc. IEEE]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1334- 1362</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bunch]]></surname>
<given-names><![CDATA[J.R.]]></given-names>
</name>
<name>
<surname><![CDATA[Rose]]></surname>
<given-names><![CDATA[D.J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Sparse Matrix Computations]]></source>
<year>1976</year>
<publisher-loc><![CDATA[N.Y. ]]></publisher-loc>
<publisher-name><![CDATA[Acad. Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Costello]]></surname>
<given-names><![CDATA[J]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Delivering Quality Delivers Profits: Plenary speech]]></article-title>
<source><![CDATA[]]></source>
<year></year>
<conf-name><![CDATA[ 2001 IEEE 2nd Int. Symp. on Quality Electronic Design]]></conf-name>
<conf-date>2001</conf-date>
<conf-loc>San Jose CA</conf-loc>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Duff]]></surname>
<given-names><![CDATA[I.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Reid]]></surname>
<given-names><![CDATA[J.K.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Some Design Features of a Sparse Matrix Code]]></article-title>
<source><![CDATA[ACM Trans. on Mathematical Software]]></source>
<year>1979</year>
<volume>5</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>18-35</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fedorenko]]></surname>
<given-names><![CDATA[R.P.]]></given-names>
</name>
</person-group>
<source><![CDATA[Approximate Solution of Optimal Control Problems]]></source>
<year>1978</year>
<publisher-loc><![CDATA[Moscow ]]></publisher-loc>
<publisher-name><![CDATA[Nauka]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fletcher]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Reeves]]></surname>
<given-names><![CDATA[C.M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Function Minimization by Conjugate Gradients]]></article-title>
<source><![CDATA[Comput. J.]]></source>
<year>1964</year>
<volume>7</volume>
<page-range>149-154</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fletcher]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Powell]]></surname>
<given-names><![CDATA[M.J.D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A Rapidly Convergent Descent Method for Minimization]]></article-title>
<source><![CDATA[Comput. J.]]></source>
<year>1963</year>
<volume>6</volume>
<page-range>163-168</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fletcher]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
</person-group>
<source><![CDATA[Practical Methods of Optimization]]></source>
<year>1980</year>
<volume>1</volume>
<publisher-loc><![CDATA[N.Y. ]]></publisher-loc>
<publisher-name><![CDATA[John Wiley and Sons]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[George]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[On Block Elimination for Sparse Linear Systems]]></article-title>
<source><![CDATA[SIAM J. Numer. Anal.]]></source>
<year>1984</year>
<volume>11</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>585-603</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gill]]></surname>
<given-names><![CDATA[P.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Murray]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
<name>
<surname><![CDATA[Wright]]></surname>
<given-names><![CDATA[M.H.]]></given-names>
</name>
</person-group>
<source><![CDATA[Practical optimization]]></source>
<year>1981</year>
<publisher-loc><![CDATA[London ]]></publisher-loc>
<publisher-name><![CDATA[Academic Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hooke]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Jeeves]]></surname>
<given-names><![CDATA[T.A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Direct Search Solution of Numerical and Statistical Problems]]></article-title>
<source><![CDATA[JACM]]></source>
<year>1961</year>
<volume>8</volume>
<page-range>212-229</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Krylov]]></surname>
<given-names><![CDATA[I.A.]]></given-names>
</name>
<name>
<surname><![CDATA[Chernousko]]></surname>
<given-names><![CDATA[F.L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Consecutive Approximation Algorithm for Optimal Control Problems]]></article-title>
<source><![CDATA[J. of Numer. Math. and Math. Pfysics]]></source>
<year>1972</year>
<volume>12</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>14-34</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Massara]]></surname>
<given-names><![CDATA[R.E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Optimization Methods in Electronic Circuit Design]]></source>
<year>1991</year>
<publisher-loc><![CDATA[Harlow ]]></publisher-loc>
<publisher-name><![CDATA[Longman Scientific & Technical]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Neustadt]]></surname>
<given-names><![CDATA[L.W.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Synthesis of Time-Optimal Control Systems]]></article-title>
<source><![CDATA[J. of Math. Analysis and Applications]]></source>
<year>1960</year>
<volume>1</volume>
<page-range>484-492</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Osterby]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
<name>
<surname><![CDATA[Zlatev]]></surname>
<given-names><![CDATA[Z]]></given-names>
</name>
</person-group>
<source><![CDATA[Direct Methods for Sparse Matrices]]></source>
<year>1983</year>
<publisher-loc><![CDATA[N.Y. ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pontryagin]]></surname>
<given-names><![CDATA[L.S.]]></given-names>
</name>
<name>
<surname><![CDATA[Boltyanskii]]></surname>
<given-names><![CDATA[V.G.]]></given-names>
</name>
<name>
<surname><![CDATA[Gamkrelidze]]></surname>
<given-names><![CDATA[R.V.]]></given-names>
</name>
<name>
<surname><![CDATA[Mishchenko]]></surname>
<given-names><![CDATA[E.F.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Mathematical Theory of Optimal Processes]]></source>
<year>1962</year>
<publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Interscience Publishers, Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rabat]]></surname>
<given-names><![CDATA[N]]></given-names>
</name>
<name>
<surname><![CDATA[Ruehli]]></surname>
<given-names><![CDATA[A.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Mahoney]]></surname>
<given-names><![CDATA[G.W.]]></given-names>
</name>
<name>
<surname><![CDATA[Coleman]]></surname>
<given-names><![CDATA[J.J.]]></given-names>
</name>
</person-group>
<source><![CDATA[A Survey of Macromodeling]]></source>
<year></year>
<conf-name><![CDATA[ IEEE Int. Symp. Circuits Systems]]></conf-name>
<conf-date>1985</conf-date>
<conf-loc> </conf-loc>
<page-range>139-143</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rosen]]></surname>
<given-names><![CDATA[J.B.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Iterative Solution of Nonlinear Optimal Control Problems]]></article-title>
<source><![CDATA[J. SIAM]]></source>
<year>1966</year>
<page-range>223-244</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ruehli]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Sangiovanni-Vincentelli]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Rabbat]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Time Analysis of Large-Scale Circuits Containing One-Way Macromodels]]></article-title>
<source><![CDATA[IEEE Trans. Circuits Syst.]]></source>
<year>1982</year>
<volume>CAS- 29</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>185-191</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ruehli]]></surname>
<given-names><![CDATA[A.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Ditlow]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Circuit Analysis, Logic Simulation and Design Verification for VLSI]]></article-title>
<source><![CDATA[Proc. IEEE]]></source>
<year>1983</year>
<volume>71</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>36-68</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ruehli]]></surname>
<given-names><![CDATA[A.E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Circuit Analysis, Simulation and Design]]></source>
<year>1987</year>
<volume>3</volume>
<publisher-loc><![CDATA[Amsterdam ]]></publisher-loc>
<publisher-name><![CDATA[Elsevier Science Publishers]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sangiovanni -Vincentelli]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[L.K.]]></given-names>
</name>
<name>
<surname><![CDATA[Chua]]></surname>
<given-names><![CDATA[L.O.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[An Efficient Cluster Algorithm for Tearing Large-Scale Networks]]></article-title>
<source><![CDATA[IEEE Trans. Circuits Syst.]]></source>
<year>1977</year>
<volume>CAS-24</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>709-717</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sepulchre]]></surname>
<given-names><![CDATA[R]]></given-names>
</name>
<name>
<surname><![CDATA[Jankovic]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
<name>
<surname><![CDATA[Kokotovic]]></surname>
<given-names><![CDATA[P.V.]]></given-names>
</name>
</person-group>
<source><![CDATA[Constructive Nonlinear Control]]></source>
<year>1997</year>
<publisher-loc><![CDATA[N.Y. ]]></publisher-loc>
<publisher-name><![CDATA[Springer-Verlag]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Slotine]]></surname>
<given-names><![CDATA[J.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<source><![CDATA[Applied Nonlinear Control]]></source>
<year>1991</year>
<publisher-loc><![CDATA[^eNJ NJ]]></publisher-loc>
<publisher-name><![CDATA[Englewood Cliffs, Prentice-Hall]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tabak]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
<name>
<surname><![CDATA[Kuo]]></surname>
<given-names><![CDATA[B.C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Applications of Mathematical Programming in the Design of Optimal Control Systems]]></article-title>
<source><![CDATA[Int. Journal of Control]]></source>
<year>1969</year>
<volume>10</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>548-552</page-range></nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[F.F.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Solution of Large-Scale Networks by Tearing]]></article-title>
<source><![CDATA[IEEE Trans. Circuits Syst.]]></source>
<year>1976</year>
<volume>CAS-23</volume>
<numero>12</numero>
<issue>12</issue>
<page-range>706-713</page-range></nlm-citation>
</ref>
<ref id="B27">
<label>27</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zemliak]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[System Design Strategy by Optimum Control Theory Formulation]]></article-title>
<source><![CDATA[]]></source>
<year></year>
<volume>2</volume>
<conf-name><![CDATA[ 14th European Conf. on Circuit Theory and Design]]></conf-name>
<conf-date>1999</conf-date>
<conf-loc>Stresa </conf-loc>
<page-range>1371-1374</page-range></nlm-citation>
</ref>
<ref id="B28">
<label>28</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zemliak]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[One Approach to Analog System Design Problem Formulation]]></article-title>
<source><![CDATA[]]></source>
<year></year>
<conf-name><![CDATA[ 2001 IEEE 2nd Int. Symp. on Quality Electronic Design]]></conf-name>
<conf-date>2001</conf-date>
<conf-loc>San Jose CA</conf-loc>
<page-range>273-278</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
