On multiplicative and Volterra minimization methods

dc.contributor.authorÖzyapıcı, Ali
dc.contributor.authorRıza, Mustafa
dc.contributor.authorBilgehan, Bülent
dc.contributor.authorBashirov, Agamirza
dc.date.accessioned2016-10-12T18:50:54Z
dc.date.available2016-10-12T18:50:54Z
dc.date.issued2014
dc.departmentEastern Mediterranean University, Faculty of Arts & Sciences, Department of Physicsen_US
dc.descriptionDue to copyright restrictions, the access to the publisher version (published version) of this article is only available via subscription. You may click URI and have access to the Publisher Version of this article through the publisher web site or online databases, if your Library or institution has subscription to the related journal or publication.en_US
dc.description.abstractTheory and applications of multiplicative and Volterra calculi have been evolving rapidly over the recent years. As numerical minimization methods have a wide range of applications in science and engineering, the idea of the design of minimization methods based on multiplicative and Volterra calculi is self-evident. In this paper, the well-known Newton minimization method for one and two variables is developed in the frameworks of multiplicative and Volterra calculi. The efficiency of these proposed minimization methods is exposed by examples, and the results are compared with the original minimization method. One of the striking results of the proposed method is that the rate of convergence and the range of initial values are considerably larger compared to the original method.en_US
dc.identifier.citationA. Özyapıcı, M. Riza, B. Bilgehan, and A. Bashirov, On multiplicative and Volterra minimization methods, Numerical Algorithms, 67(3), 623 (2014)en_US
dc.identifier.doi10.1007/s11075-013-9813-9
dc.identifier.endpage636en_US
dc.identifier.issn1017-1398(print)
dc.identifier.issn1572-9265(online)
dc.identifier.issue3en_US
dc.identifier.scopus2-s2.0-84911003234
dc.identifier.scopusqualityQ1
dc.identifier.startpage623en_US
dc.identifier.urihttp://dx.doi.org/10.1007/s11075-013-9813-9
dc.identifier.urihttps://hdl.handle.net/11129/3024
dc.identifier.volume67en_US
dc.identifier.wosWOS:000344598600009
dc.identifier.wosqualityQ1
dc.indekslendigikaynakScopus
dc.indekslendigikaynakWeb of Science
dc.language.isoen
dc.publisherSpringer USen_US
dc.relation.ispartofNumerical Algorithms
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectNewton minimization, Computer Scienceen_US
dc.subject41A25, Algorithms, Curve fitting, Multiplicative minimization,en_US
dc.subject65D15, Theory of Computation, Volterra calculus, Numerical Analysis,en_US
dc.subjectNumeric Computing, Multiplicative calculusen_US
dc.subjectMATHEMATICS, APPLIED, CALCULUSen_US
dc.titleOn multiplicative and Volterra minimization methodsen_US
dc.typeArticle

Files

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.77 KB
Format:
Item-specific license agreed upon to submission
Description: