Solving Polynomial Systems Using a Modified Line Search Approach

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F12%3A86084532" target="_blank" >RIV/61989100:27240/12:86084532 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Solving Polynomial Systems Using a Modified Line Search Approach

Popis výsledku v původním jazyce

This paper proposes a modified line search technique for solving systems of complex nonlinear equations. Line search is a widely used iterative global search method. Since optimization strategies have been (and continue to be) successfully used for solving systems of nonlinear equations, the system is reduced to a one-dimensional equation system for optimization purpose. The proposed line search procedure incorporates a re-start technique, which makes use of derivatives to reduce the search space and tore-generate thereafter the starting points in between the new ranges. Several well known applications such as interval arithmetic benchmark, kinematics, neuropsychology, combustion, chemical equilibrium and economics application are considered for testing the performances of the proposed approach. To validate the strength of the proposed approach, systems having between 5 and 20 equations are considered. Results are compared with an evolutionary algorithm approach, which transforms the

Název v anglickém jazyce

Solving Polynomial Systems Using a Modified Line Search Approach

Popis výsledku anglicky

This paper proposes a modified line search technique for solving systems of complex nonlinear equations. Line search is a widely used iterative global search method. Since optimization strategies have been (and continue to be) successfully used for solving systems of nonlinear equations, the system is reduced to a one-dimensional equation system for optimization purpose. The proposed line search procedure incorporates a re-start technique, which makes use of derivatives to reduce the search space and tore-generate thereafter the starting points in between the new ranges. Several well known applications such as interval arithmetic benchmark, kinematics, neuropsychology, combustion, chemical equilibrium and economics application are considered for testing the performances of the proposed approach. To validate the strength of the proposed approach, systems having between 5 and 20 equations are considered. Results are compared with an evolutionary algorithm approach, which transforms the

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

International journal of innovative computing, information and control

ISSN

1349-4198

e-ISSN

—

Svazek periodika

8

Číslo periodika v rámci svazku

1B

Stát vydavatele periodika

JP - Japonsko

Počet stran výsledku

27

Strana od-do

501-526

Kód UT WoS článku

000299648400001

EID výsledku v databázi Scopus

—