Gelişmiş Arama

Basit öğe kaydını göster

dc.contributor.authorJouilik, Bouchtaen_US
dc.contributor.authorDaoudi, Jamalen_US
dc.contributor.authorTajani, Chakiren_US
dc.contributor.authorAbouchabaka, Jaafaren_US
dc.date.accessioned2023-01-02T18:05:36Z
dc.date.available2023-01-02T18:05:36Z
dc.date.issued2023-01
dc.identifier.citationJouilik, B., Daoudi, J., Tajani, C. & Abouchabaka, J. (2023). Numerical optimization algorithm based on genetic algorithm for a data completion problem. TWMS Journal Of Applied And Engineering Mathematics, 13(1), 86-97.en_US
dc.identifier.issn2146-1147en_US
dc.identifier.issn2587-1013en_US
dc.identifier.urihttp://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/5204
dc.identifier.urihttp://jaem.isikun.edu.tr/web/index.php/current/118-vol13no1/946
dc.description.abstractThis work presents numerical optimization algorithm based on genetic algorithm to solve the data completion problem for Laplace’s equation. It consists of covering the missing data on the inaccessible part of the boundary from measurements on the accessible part. This problem is known to be severely ill-posed in Hadamard sense; then, regularization methods must be exploited. Metaheuristics are methods inspired by natural phenomena and which have shown their effectiveness in solving several optimization problems in different domains. Thus, adapted genetic operators for real coded genetic algorithm is proposed by formulating the problem into an optimization one. Numerical results with irregular domain are presented showing the efficiency of the proposed algorithm.en_US
dc.language.isoenen_US
dc.publisherIşık University Pressen_US
dc.relation.ispartofTWMS Journal Of Applied And Engineering Mathematicsen_US
dc.rightsinfo:eu-repo/semantics/openAccessen_US
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 United States*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/us/*
dc.subjectInverse problemen_US
dc.subjectCauchy problemen_US
dc.subjectGenetic algorithmen_US
dc.subjectFinite element methoden_US
dc.titleNumerical optimization algorithm based on genetic algorithm for a data completion problemen_US
dc.typeArticleen_US
dc.description.versionPublisher's Versionen_US
dc.identifier.volume13
dc.identifier.issue1
dc.identifier.startpage86
dc.identifier.endpage97
dc.peerreviewedYesen_US
dc.publicationstatusPublisheden_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Başka Kurum Yazarıen_US
dc.indekslendigikaynakEmerging Sources Citation Index (ESCI)en_US
dc.indekslendigikaynakMathScineten_US
dc.indekslendigikaynakScopusen_US


Bu öğenin dosyaları:

Thumbnail

Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.

Basit öğe kaydını göster

info:eu-repo/semantics/openAccess
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess