Multiple Roots of Systems of Equations by Repulsion Merit Functions
Autor(a) principal: | |
---|---|
Data de Publicação: | 2014 |
Outros Autores: | , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10400.22/5409 |
Resumo: | In this paper we address the problem of computing multiple roots of a system of nonlinear equations through the global optimization of an appropriate merit function. The search procedure for a global minimizer of the merit function is carried out by a metaheuristic, known as harmony search, which does not require any derivative information. The multiple roots of the system are sequentially determined along several iterations of a single run, where the merit function is accordingly modified by penalty terms that aim to create repulsion areas around previously computed minimizers. A repulsion algorithm based on a multiplicative kind penalty function is proposed. Preliminary numerical experiments with a benchmark set of problems show the effectiveness of the proposed method. |
id |
RCAP_c309edc39a6adfbd6c5f513b09c87429 |
---|---|
oai_identifier_str |
oai:recipp.ipp.pt:10400.22/5409 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
Multiple Roots of Systems of Equations by Repulsion Merit FunctionsSystem of equationsMultiple rootsPenalty functionRepulsionHarmony searchIn this paper we address the problem of computing multiple roots of a system of nonlinear equations through the global optimization of an appropriate merit function. The search procedure for a global minimizer of the merit function is carried out by a metaheuristic, known as harmony search, which does not require any derivative information. The multiple roots of the system are sequentially determined along several iterations of a single run, where the merit function is accordingly modified by penalty terms that aim to create repulsion areas around previously computed minimizers. A repulsion algorithm based on a multiplicative kind penalty function is proposed. Preliminary numerical experiments with a benchmark set of problems show the effectiveness of the proposed method.SpringerRepositório Científico do Instituto Politécnico do PortoRamadas, Gisela C. V.Fernandes, Edite M. G. P.Rocha, Ana Maria A. C.2015-01-15T10:41:17Z20142014-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.22/5409eng978-3-319-09128-010.1007/978-3-319-09129-7_10info:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2023-03-13T12:45:29Zoai:recipp.ipp.pt:10400.22/5409Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T17:26:04.737380Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
Multiple Roots of Systems of Equations by Repulsion Merit Functions |
title |
Multiple Roots of Systems of Equations by Repulsion Merit Functions |
spellingShingle |
Multiple Roots of Systems of Equations by Repulsion Merit Functions Ramadas, Gisela C. V. System of equations Multiple roots Penalty function Repulsion Harmony search |
title_short |
Multiple Roots of Systems of Equations by Repulsion Merit Functions |
title_full |
Multiple Roots of Systems of Equations by Repulsion Merit Functions |
title_fullStr |
Multiple Roots of Systems of Equations by Repulsion Merit Functions |
title_full_unstemmed |
Multiple Roots of Systems of Equations by Repulsion Merit Functions |
title_sort |
Multiple Roots of Systems of Equations by Repulsion Merit Functions |
author |
Ramadas, Gisela C. V. |
author_facet |
Ramadas, Gisela C. V. Fernandes, Edite M. G. P. Rocha, Ana Maria A. C. |
author_role |
author |
author2 |
Fernandes, Edite M. G. P. Rocha, Ana Maria A. C. |
author2_role |
author author |
dc.contributor.none.fl_str_mv |
Repositório Científico do Instituto Politécnico do Porto |
dc.contributor.author.fl_str_mv |
Ramadas, Gisela C. V. Fernandes, Edite M. G. P. Rocha, Ana Maria A. C. |
dc.subject.por.fl_str_mv |
System of equations Multiple roots Penalty function Repulsion Harmony search |
topic |
System of equations Multiple roots Penalty function Repulsion Harmony search |
description |
In this paper we address the problem of computing multiple roots of a system of nonlinear equations through the global optimization of an appropriate merit function. The search procedure for a global minimizer of the merit function is carried out by a metaheuristic, known as harmony search, which does not require any derivative information. The multiple roots of the system are sequentially determined along several iterations of a single run, where the merit function is accordingly modified by penalty terms that aim to create repulsion areas around previously computed minimizers. A repulsion algorithm based on a multiplicative kind penalty function is proposed. Preliminary numerical experiments with a benchmark set of problems show the effectiveness of the proposed method. |
publishDate |
2014 |
dc.date.none.fl_str_mv |
2014 2014-01-01T00:00:00Z 2015-01-15T10:41:17Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10400.22/5409 |
url |
http://hdl.handle.net/10400.22/5409 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
978-3-319-09128-0 10.1007/978-3-319-09129-7_10 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Springer |
publisher.none.fl_str_mv |
Springer |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1817551420677685248 |