A robust homotopy continuation method for seeking all real roots of unconstrained systems of nonlinear algebraic and transcendental equations / Saeed Khaleghi Rahimian in Industrial & engineering chemistry research, Vol. 50 N° 15 (Août 2011)  

Public ISBD [article]  inIndustrial & engineering chemistry research > Vol. 50 N° 15 (Août 2011) . - pp. 8892–8900 Titre : A robust homotopy continuation method for seeking all real roots of unconstrained systems of nonlinear algebraic and transcendental equations Type de document : texte imprimé Auteurs : Saeed Khaleghi Rahimian, Auteur ; Farhang Jalali, Auteur ; J. D. Seader, Auteur Année de publication : 2011 Article en page(s) : pp. 8892–8900 Note générale : Chimie industrielle Langues : Anglais (eng) Mots-clés : Continuation method Homotopy Résumé : A new homotopy developed for finding all real roots to a single nonlinear equation is extended to a system of nonlinear algebraic and transcendental equations written as f{x} = 0 to find all real roots, including those on isolas. To reach roots that may lie on isolas, the functions are squared. This causes all roots to be bifurcation points that are connected to each other through stemming branches. As a result, a new system of homotopy functions, including numerous bifurcation points, is formed as H{x,t} = (x-x0) ( 1 + f2 - t), where x0 is the starting point. Because the functions are squared, many systems of equations must be solved to find a starting point on a reduced system of homotopy functions written as H{x,t} = 1 + f2 - t. Therefore, robustness is achieved at the expense of increased computation time. To improve the efficiency of the algorithm, the Levenberg-Marquardt method is used to find the starting point for the reduced homotopy system by solving a system of nonlinear equations with the degree of freedom equal to one. Then, a continuation method is used to track the paths from the resulting starting point to seek at least one root. Because all roots are bifurcation points, tracking the stemming branches from each subsequent root is the final step. The new algorithm was able to find successfully all the reported roots for 20 test problems that included a variety of algebraic and transcendental terms. In some cases additional roots were obtained. DEWEY : 660 ISSN : 0888-5885 En ligne : http://cat.inist.fr/?aModele=afficheN&cpsidt=24395834 [article] A robust homotopy continuation method for seeking all real roots of unconstrained systems of nonlinear algebraic and transcendental equations [texte imprimé] / Saeed Khaleghi Rahimian, Auteur ; Farhang Jalali, Auteur ; J. D. Seader, Auteur . - 2011 . - pp. 8892–8900. Chimie industrielle Langues : Anglais (eng) in Industrial & engineering chemistry research > Vol. 50 N° 15 (Août 2011) . - pp. 8892–8900 Mots-clés : Continuation method Homotopy Résumé : A new homotopy developed for finding all real roots to a single nonlinear equation is extended to a system of nonlinear algebraic and transcendental equations written as f{x} = 0 to find all real roots, including those on isolas. To reach roots that may lie on isolas, the functions are squared. This causes all roots to be bifurcation points that are connected to each other through stemming branches. As a result, a new system of homotopy functions, including numerous bifurcation points, is formed as H{x,t} = (x-x0) ( 1 + f2 - t), where x0 is the starting point. Because the functions are squared, many systems of equations must be solved to find a starting point on a reduced system of homotopy functions written as H{x,t} = 1 + f2 - t. Therefore, robustness is achieved at the expense of increased computation time. To improve the efficiency of the algorithm, the Levenberg-Marquardt method is used to find the starting point for the reduced homotopy system by solving a system of nonlinear equations with the degree of freedom equal to one. Then, a continuation method is used to track the paths from the resulting starting point to seek at least one root. Because all roots are bifurcation points, tracking the stemming branches from each subsequent root is the final step. The new algorithm was able to find successfully all the reported roots for 20 test problems that included a variety of algebraic and transcendental terms. In some cases additional roots were obtained. DEWEY : 660 ISSN : 0888-5885 En ligne : http://cat.inist.fr/?aModele=afficheN&cpsidt=24395834

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
aucun exemplaire