<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>Mathematics</title>
<link href="https://repository.ju.edu.et//handle/123456789/139" rel="alternate"/>
<subtitle/>
<id>https://repository.ju.edu.et//handle/123456789/139</id>
<updated>2026-04-05T23:27:38Z</updated>
<dc:date>2026-04-05T23:27:38Z</dc:date>
<entry>
<title>Quadratic B-spline Collocation Method for Solving Singularly Perturbed Quasilinear Sobolev Equations</title>
<link href="https://repository.ju.edu.et//handle/123456789/10227" rel="alternate"/>
<author>
<name>Lemessa Fikadu Babe</name>
</author>
<author>
<name>Gemechis File</name>
</author>
<author>
<name>Feyisa Edosa</name>
</author>
<id>https://repository.ju.edu.et//handle/123456789/10227</id>
<updated>2026-03-12T12:24:56Z</updated>
<published>2024-12-22T00:00:00Z</published>
<summary type="text">Quadratic B-spline Collocation Method for Solving Singularly Perturbed Quasilinear Sobolev Equations
Lemessa Fikadu Babe; Gemechis File; Feyisa Edosa
In this thesis, the one-dimensional singularly perturbed quasilinear Sobolev equationis considered&#13;
and treated numerically. Newton’s linearization approach is used to linearize the nonlinear term.&#13;
The finite difference method is used to treat the linearized equation spatial direction discretization.&#13;
The temporal direction the quadratic B-spline collocation method is applied. The propsed scheme’s&#13;
stability is analysed and established. The scheme converges with an order of convergence one in time&#13;
and two in space. The theoretical results were illustrated using numerical example.
</summary>
<dc:date>2024-12-22T00:00:00Z</dc:date>
</entry>
<entry>
<title>Non-Standard finite difference scheme based on the ta-Method For predator-Prey dynamical system</title>
<link href="https://repository.ju.edu.et//handle/123456789/10187" rel="alternate"/>
<author>
<name>Issa Zakir Abagidi</name>
</author>
<author>
<name>Woinshet Defar Mergia</name>
</author>
<author>
<name>Mebratu Fenta Wakeni</name>
</author>
<id>https://repository.ju.edu.et//handle/123456789/10187</id>
<updated>2026-03-04T06:38:40Z</updated>
<published>2025-03-18T00:00:00Z</published>
<summary type="text">Non-Standard finite difference scheme based on the ta-Method For predator-Prey dynamical system
Issa Zakir Abagidi; Woinshet Defar Mergia; Mebratu Fenta Wakeni
In this thesis, a Non-Standard Finite Difference (NSFD) method based on the θ− method is&#13;
formulated for solving the mathematical model of the Beddington-DeAngelis functional&#13;
response predator-prey dynamical system. The NSFD scheme incorporates a time step&#13;
function, which ensures the preservation of key qualitative features of the continuous system&#13;
while providing flexibility in handling stiffness. A rigorous linear stability and convergence&#13;
analysis is conducted to evaluate the scheme’s theoretical properties. This analysis exhibits the&#13;
advantages of the NSFD method in preserving stability, accuracy, and convergence, making it&#13;
a robust tool for modeling ecological and dynamical systems. Numerical comparisons between&#13;
the proposed method and existing methods demonstrate that the new NSFD-based approach&#13;
exhibits superior accuracy and convergence
</summary>
<dc:date>2025-03-18T00:00:00Z</dc:date>
</entry>
<entry>
<title>An Iterative Algorithm for a Common Solution of Split  Equality of Variational Inequality Problem of  Pseudomonotone Mappings in Banach Spaces</title>
<link href="https://repository.ju.edu.et//handle/123456789/10036" rel="alternate"/>
<author>
<name>Tesfaye Etana Amante</name>
</author>
<author>
<name>Getahun Bekele</name>
</author>
<author>
<name>Mafuz Humer</name>
</author>
<id>https://repository.ju.edu.et//handle/123456789/10036</id>
<updated>2025-11-05T12:38:52Z</updated>
<published>2024-12-27T00:00:00Z</published>
<summary type="text">An Iterative Algorithm for a Common Solution of Split  Equality of Variational Inequality Problem of  Pseudomonotone Mappings in Banach Spaces
Tesfaye Etana Amante; Getahun Bekele; Mafuz Humer
In this thesis we introduced an iterative algorithm for a common solution of split&#13;
 equality of variational inequality problem of pseudomonotone mappings in Ba&#13;
nach spaces and proved a strong convergence of a sequence generated by proposed&#13;
 algorithm to asolution of split equality of variational inequality problem of pseu&#13;
domonotone mappings in Banach spaces. Finally, we gave applications of our main&#13;
 results to approximate a common solution of split equality minimum point prob&#13;
lem for convex functions in real re exive Banach spaces. Our results extended and&#13;
 generalized many results in the literature.
</summary>
<dc:date>2024-12-27T00:00:00Z</dc:date>
</entry>
<entry>
<title>Cubic Non-Polynomial Spline on Piecewise Mesh for Robin Type              Singularly Perturbed Reaction Diffusion Problem</title>
<link href="https://repository.ju.edu.et//handle/123456789/10031" rel="alternate"/>
<author>
<name>Bethelhem Esayas Ayele</name>
</author>
<author>
<name>Tesfaye Aga Bullo</name>
</author>
<author>
<name>Gemechis File Duressa</name>
</author>
<id>https://repository.ju.edu.et//handle/123456789/10031</id>
<updated>2025-11-05T12:04:35Z</updated>
<published>2024-06-11T00:00:00Z</published>
<summary type="text">Cubic Non-Polynomial Spline on Piecewise Mesh for Robin Type              Singularly Perturbed Reaction Diffusion Problem
Bethelhem Esayas Ayele; Tesfaye Aga Bullo; Gemechis File Duressa
This thesis introduces a novel approach to solving Robin type singularly perturbed reaction&#13;
diffusion problems through cubic non-polynomial spline approximation on a piecewise mesh. &#13;
The methodology involves discretizing the solution domain using a piecewise mesh size, followed &#13;
by defining a cubic non-polynomial spline function and obtaining its derivatives. Subsequently, &#13;
the derivatives in the differential equations are transformed into difference approximations, &#13;
leading to a linear system of algebraic equations expressed in a three-term recurrence relation, &#13;
solvable through an elimination algorithm. The stability and consistency of the method are &#13;
thoroughly investigated to ensure its convergence. Furthermore, numerical model examples are &#13;
employed to validate the proposed method, with results compared against other methods cited in &#13;
the literature. The maximum absolute error and order of convergence for each model example &#13;
are presented to demonstrate the significant advancements offered by the present method.
</summary>
<dc:date>2024-06-11T00:00:00Z</dc:date>
</entry>
</feed>
