A Computational Method for Solving a Class of Fractional-Order Non-Linear Singularly Perturbed Volterra Integro-Differential Boundary-Value Problems

In this thesis, we present a computational method for solving a class of fractional singularly perturbed Volterra integro-differential boundary-value problems with a boundary layer at one end. The implemented technique consists of solving two problems which are a reduced problem and a boundary layer correction problem. The reproducing kernel method is used to the second problem. Pade’ approximation technique is used to satisfy the conditions at infinity. Existence and uniformly convergence for the approximate solution are also investigated. Numerical results provided to show the efficiency of the proposed method

Efficient method for solving nonlinear weakly singular kernel fractional integro-differential equations

This paper introduced an efficient method to obtain the solution of linear and nonlinear weakly singular kernel fractional integro-differential equations (WSKFIDEs). It used Riemann-Liouville fractional integration (R-LFI) to remove singularities and approximated the regularized problem with a combined approach using the generalized fractional step-Mittag-Leffler function (GFSMLF) and operational integral fractional Mittag matrix (OIFMM) method. The resulting algebraic equations were turned into an optimization problem. We also proved the method's accuracy in approximating any function, as well as its fractional differentiation and integration within WSKFIDEs. The proposed method was performed on some attractive examples in order to show how their solutions behave at various values of the fractional order $\digamma$. The paper provided a valuable contribution to the field of fractional calculus (FC) by presenting a novel method for solving WSKFIDEs. Additionally, the accuracy of this method was verified by comparing its results with those obtained using other methods

D˙IFERANS˙IYEL DENKLEMLER˙IN YAPAY S˙IN˙IR AGLARI ˘ ˙ILE NÜMER˙IK ÇÖZÜMLER˙I

D˙IFERANS˙IYEL DENKLEMLER˙IN YAPAY S˙IN˙IR AGLARI ˘ ˙ILE NÜMER˙IK ÇÖZÜMLER˙I ˙Iclal GÖR Doktora Tezi, Matematik Anabilim Dalı Tez Danı¸smanı: Dr. Ögr. Üyesi Korhan GÜNEL ˘ 2020, 91 sayfa Bu çalı¸smada, birinci ve ikinci mertebeden lineer ba¸slangıç deger problemleri, ˘ Dirichlet sınır ko¸sulları içeren ikinci mertebeden lineer ve lineer olmayan diferansiyel denklemler ve birinci mertebeden lineer diferansiyel denklem sistemlerinin nümerik çözümleri ileri beslemeli tek ara katmanlı yapay sinir agları ˘ kullanılarak elde edilmi¸stir. Problemlerin çözümleri için modellenen sinir agları, popülasyon tabanlı global ˘ optimizasyon metotlarından Parçacık Sürü Optimizasyonu, Kütle Çekim Arama Algoritması, Yapay Arı Koloni Algoritması ve Karınca Koloni Optimizasyonu kullanılarak egitilmi¸stir. Ek olarak bahsi geçen optimizasyon algoritmaları ˘ Parçacık Sürü Optimizasyonu algoritması ile hibritlenerek çözümler elde edilmi¸stir. Tez çalı¸sması boyunca incelenen optimizasyon yakla¸sımlarından elde edilen izlenimler dogrultusunda, bilinen en iyi çözümün kom¸sulu ˘ gunda üretilen ˘ hiper-küreleri kullanan yeni bir mutasyon operatörü tanımlanmı¸stır. Deneysel çalı¸smalarda elde edilen bulgular, adi diferansiyel denklemlerin nümerik çözümlerini elde etmede yapay sinir agı kullanımının geleneksel iterasyon tabanlı ˘ yöntemlere göre iyi bir alternatif olabilecegini göstermi¸stir. Yapay sinir a ˘ glarının, ˘ çözüm aranan aralıgın her noktasında tahmini bir de ˘ ger üretebilme yetenekleri bu ˘ yöntemleri klasik yöntemlere göre tercih edilebilir hale getirmektedir. Tezde önerilen yakla¸sım, farklı sabit adım uzunlukları için degi¸sik tipteki ˘ diferansiyel denklemler üzerinde test edilmi¸s ve diger yöntemlerle kıyaslandı ˘ gında ˘ genel olarak benzer veya çogu zaman daha iyi sonuç vermi¸stir. Bununla birlikte, ˘ her tipte diferansiyel denklemi çözebilecek evrensel bir yapay sinir agı modeli ˘ olu¸sturmanın olası olmadıgı kanısına varılmı¸stır.˙IÇ˙INDEK˙ILER KABUL VE ONAY SAYFASI . . . . . . . . . . . . . . . . . . . . . . . . iii B˙IL˙IMSEL ET˙IK B˙ILD˙IR˙IM SAYFASI . . . . . . . . . . . . . . . . . . . v ÖZET . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii ABSTRACT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix ÖNSÖZ . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi S˙IMGELER D˙IZ˙IN˙I . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xv ¸SEK˙ILLER D˙IZ˙IN˙I . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xvii Ç˙IZELGELER D˙IZ˙IN˙I . . . . . . . . . . . . . . . . . . . . . . . . . . . xix 1. G˙IR˙I ¸S . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 2. MATERYAL VE METOT . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.1. ˙Ileri Beslemeli Yapay Sinir Agları ile Diferansiyel Denklemlerin ˘ Nümerik Çözümleri . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.2. Diferansiyel Denklem Sistemlerinin Çözümleri . . . . . . . . . . . . 15 2.3. Popülasyon Tabanlı Global Optimizasyon Yakla¸sımları . . . . . . . . 17 2.3.1. Parçacık Sürü Optimizasyonu . . . . . . . . . . . . . . . . . . . . 18 2.3.2. Kütle Çekim Arama Algoritması . . . . . . . . . . . . . . . . . . . 21 2.3.3. Yapay Arı Koloni Algoritması . . . . . . . . . . . . . . . . . . . . 25 2.3.3.1. Yapay Arı Koloni Algoritması için Yeni Bir Mutasyon Önerisi . . . 28 2.3.4. Karınca Koloni Optimizasyonu . . . . . . . . . . . . . . . . . . . 31 3. DENEYSEL ÇALI ¸SMALAR . . . . . . . . . . . . . . . . . . . . . . . 37 4. TARTI ¸SMA VE SONUÇ . . . . . . . . . . . . . . . . . . . . . . . . . 70 KAYNAKLAR . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75 EKLER . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83 A. EKLER D˙IZ˙IN˙I . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83 ÖZGEÇM˙I ¸S . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8

International Conference on Mathematical Analysis and Applications in Science and Engineering – Book of Extended Abstracts

The present volume on Mathematical Analysis and Applications in Science and Engineering - Book of Extended Abstracts of the ICMASC’2022 collects the extended abstracts of the talks presented at the International Conference on Mathematical Analysis and Applications in Science and Engineering – ICMA2SC'22 that took place at the beautiful city of Porto, Portugal, in June 27th-June 29th 2022 (3 days). Its aim was to bring together researchers in every discipline of applied mathematics, science, engineering, industry, and technology, to discuss the development of new mathematical models, theories, and applications that contribute to the advancement of scientific knowledge and practice. Authors proposed research in topics including partial and ordinary differential equations, integer and fractional order equations, linear algebra, numerical analysis, operations research, discrete mathematics, optimization, control, probability, computational mathematics, amongst others. The conference was designed to maximize the involvement of all participants and will present the state-of- the-art research and the latest achievements.info:eu-repo/semantics/publishedVersio

The 2nd International Conference on Mathematical Modelling in Applied Sciences, ICMMAS’19, Belgorod, Russia, August 20-24, 2019 : book of abstracts

The proposed Scientific Program of the conference is including plenary lectures, contributed oral talks, poster sessions and listeners. Five suggested special sessions / mini-symposium are also considered by the scientific committe

Nonlinear Systems

The editors of this book have incorporated contributions from a diverse group of leading researchers in the field of nonlinear systems. To enrich the scope of the content, this book contains a valuable selection of works on fractional differential equations.The book aims to provide an overview of the current knowledge on nonlinear systems and some aspects of fractional calculus. The main subject areas are divided into two theoretical and applied sections. Nonlinear systems are useful for researchers in mathematics, applied mathematics, and physics, as well as graduate students who are studying these systems with reference to their theory and application. This book is also an ideal complement to the specific literature on engineering, biology, health science, and other applied science areas. The opportunity given by IntechOpen to offer this book under the open access system contributes to disseminating the field of nonlinear systems to a wide range of researchers

4.Uluslararası Öğrenciler Fen Bilimleri Kongresi Bildiriler Kitabı

Çevrimiçi ( XIII, 495 Sayfa ; 26 cm.)

An order verification method for truncated asymptotic expansion solutions to initial value problems

The focus of this paper is to obtain explicit solutions to initial value problems, where numerical methods cannot provide one, and to verify the accuracy orders of the explicit solutions. One of available methods to obtain an explicit solution is the asymptotic (formal) expansion method. However, we must be sure with the accuracy order of the explicit solution. In this paper, an order verification method is proposed for truncated asymptotic formal expansion solutions to initial value problems. A least-squares fit of error data is used in the existing order verification method. The method that we propose does not involve any application of least-squares fit of error data, so is simpler, yet produces accurate expected accuracy orders of solutions of explicit truncated asymptotic formal expansions. With our proposed method, we are successful in verifying the accuracy orders of solutions of truncated asymptotic formal expansions to the linear and nonlinear initial value problems accurately

Quantum Biomimetics

136 p.En esta tesis proponemos el concepto de Biomimética Cuántica orientado hacia la reproducción de comportamientos propios de los seres vivos en protocolos de información cuántica. En concreto, las propiedades que aspiramos a imitar emergen como resultado de fenómenos de interacción en diferentes escalas, resultando inaccesibles para un tratamiento matemático acorde al ofrecido por las plataformas de tecnologías cuánticas. Por tanto, el objetivo de la tesis es el de diseñar modelos con cabida para las mencionadas características biológicas pero simplificados de forma que puedan ser adaptados en protocolos experimentales. La tesis se divide en tres partes, una por cada rasgo biológico diferente empleado como inspiración: selección natural, memoria e inteligencia. El estudio presentado en la primera parte culmina con la obtención de un modelo de vida artificial con una identidad exclusivamente cuántica, que no solo permite la escenificación del modelo de selección natural a escala microscópica si no que proporciona un posible marco para la implementación de algoritmos genéticos y problemas de optimización en plataformas cuánticas. En la segunda parte se muestran algoritmos asociados con la simulación de evolución temporal regida por ecuaciones con una dependencia explicita en términos deslocalizados temporalmente. Estos permiten la incorporación de la retroalimentación y posalimentación al conjunto de herramientas en información cuántica. La tercera y última parte versa acerca de la posible simbiosis entre los algoritmos de aprendizaje y los protocolos cuánticos. Mostramos como aplicar técnicas de optimización clásicas para tratar problemas cuánticos así como la codificación y resolución de problemas en dinámicas puramente cuánticas