Habibur Rahman
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Habibur Rahman has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Muhammad I. Bhatti
Department of Physics and Astronomy, University of Texas Rio Grande Valley, Edinburg, TX 78539, USA
5 shared publications - Nicholas Dimakis
Department of Physics and Astronomy, University of Texas Rio Grande Valley, Edinburg, TX 78539, USA
3 shared publications
Latest Publications
- Open Access
- 25 September 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (19) , 3084
Solutions for Linear Fractional Differential Equations with Multiple Constraints Using Fractional B-Poly Bases
This study presents an innovative numerical method for solving linear fractional differential equations (LFDEs) using modified Bernstein polynomial bases. The proposed approach effectively addresses the challenges posed by the nonlocal nature of fractional derivatives, providing a robust framework for handling multiple initial and boundary value constraints. By integrating the LFDEs and approximating the solutions with modified fractional-order Bernstein polynomials, we derive operational matrices to solve the resulting system numerically. The method’s accuracy is validated through several examples, showing excellent agreement between numerical and exact solutions. Comparative analysis with existing data further confirms the reliability of the approach, with absolute errors ranging from 10−18 to 10−4. The results highlight the method’s efficiency and versatility in modeling complex systems governed by fractional dynamics. This work offers a computationally efficient and accurate tool for fractional calculus applications in science and engineering, helping to bridge existing gaps in numerical techniques.
- 25 September 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (19) , 3084
Open AccessSolutions for Linear Fractional Differential Equations with Multiple Constraints Using Fractional B-Poly Bases
This study presents an innovative numerical method for solving linear fractional differential equations (LFDEs) using modified Bernstein polynomial bases. The proposed approach effectively addresses the challenges posed by the nonlocal nature of fractional derivatives, providing a robust framework for handling multiple initial and boundary value constraints. By integrating the LFDEs and approximating the solutions with modified fractional-order Bernstein polynomials, we derive operational matrices to solve the resulting system numerically. The method’s accuracy is validated through several examples, showing excellent agreement between numerical and exact solutions. Comparative analysis with existing data further confirms the reliability of the approach, with absolute errors ranging from 10−18 to 10−4. The results highlight the method’s efficiency and versatility in modeling complex systems governed by fractional dynamics. This work offers a computationally efficient and accurate tool for fractional calculus applications in science and engineering, helping to bridge existing gaps in numerical techniques.
- Open Access
A B-Polynomial Approach to Approximate Solutions of PDEs with Multiple Initial Conditions
In this article, we present a novel B-Polynomial Approach for approximating solutions to partial differential equations (PDEs), addressing the multiple initial conditions. Our method stands out by utilizing two-dimensional Bernstein polynomials (B-polynomials) in conjunction with their operational matrices to effectively manage the complexity associated with PDEs. This approach not only enhances the accuracy of solutions but also provides a structured framework for tackling various boundary conditions. The PDE is transformed into a system of algebraic equations, which are then solved to approximate the PDE solution. The process is divided into two main steps: First, the PDE is integrated to incorporate all initial and boundary conditions. Second, we express the approximate solution using B-polynomials and determine the unknown expansion coefficients via the Galerkin finite element method. The accuracy of the solution is assessed by adjusting the number of B-polynomials used in the expansion. The absolute error is estimated by comparing the exact and semi-numerical solutions. We apply this method to several examples, presenting results in tables and visualizing them with graphs. The approach demonstrates improved accuracy as the number of B-polynomials increases, with CPU time increasing linearly. Additionally, we compare our results with other methods, highlighting that our approach is both simple and effective for solving multidimensional PDEs imposed with multiple initial and boundary conditions.
Open AccessA B-Polynomial Approach to Approximate Solutions of PDEs with Multiple Initial Conditions
In this article, we present a novel B-Polynomial Approach for approximating solutions to partial differential equations (PDEs), addressing the multiple initial conditions. Our method stands out by utilizing two-dimensional Bernstein polynomials (B-polynomials) in conjunction with their operational matrices to effectively manage the complexity associated with PDEs. This approach not only enhances the accuracy of solutions but also provides a structured framework for tackling various boundary conditions. The PDE is transformed into a system of algebraic equations, which are then solved to approximate the PDE solution. The process is divided into two main steps: First, the PDE is integrated to incorporate all initial and boundary conditions. Second, we express the approximate solution using B-polynomials and determine the unknown expansion coefficients via the Galerkin finite element method. The accuracy of the solution is assessed by adjusting the number of B-polynomials used in the expansion. The absolute error is estimated by comparing the exact and semi-numerical solutions. We apply this method to several examples, presenting results in tables and visualizing them with graphs. The approach demonstrates improved accuracy as the number of B-polynomials increases, with CPU time increasing linearly. Additionally, we compare our results with other methods, highlighting that our approach is both simple and effective for solving multidimensional PDEs imposed with multiple initial and boundary conditions.
- Open Access
- 10 November 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (22) , 4604
Employing a Fractional Basis Set to Solve Nonlinear Multidimensional Fractional Differential Equations
Fractional-order partial differential equations have gained significant attention due to their wide range of applications in various fields. This paper employed a novel technique for solving nonlinear multidimensional fractional differential equations by means of a modified version of the Bernstein polynomials called the Bhatti-fractional polynomials basis set. The method involved approximating the desired solution and treated the resulting equation as a matrix equation. All fractional derivatives are considered in the Caputo sense. The resulting operational matrix was inverted, and the desired solution was obtained. The effectiveness of the method was demonstrated by solving two specific types of nonlinear multidimensional fractional differential equations. The results showed higher accuracy, with absolute errors ranging from to when compared with exact solutions. The proposed technique offered computational efficiency that could be implemented in various programming languages. The examples of two partial fractional differential equations were solved using Mathematica symbolic programming language, and the method showed potential for efficient resolution of fractional differential equations.- 10 November 2023
- Published by MDPI AG in Mathematics
- Vol. 11 (22) , 4604
Open AccessEmploying a Fractional Basis Set to Solve Nonlinear Multidimensional Fractional Differential Equations
Fractional-order partial differential equations have gained significant attention due to their wide range of applications in various fields. This paper employed a novel technique for solving nonlinear multidimensional fractional differential equations by means of a modified version of the Bernstein polynomials called the Bhatti-fractional polynomials basis set. The method involved approximating the desired solution and treated the resulting equation as a matrix equation. All fractional derivatives are considered in the Caputo sense. The resulting operational matrix was inverted, and the desired solution was obtained. The effectiveness of the method was demonstrated by solving two specific types of nonlinear multidimensional fractional differential equations. The results showed higher accuracy, with absolute errors ranging from to when compared with exact solutions. The proposed technique offered computational efficiency that could be implemented in various programming languages. The examples of two partial fractional differential equations were solved using Mathematica symbolic programming language, and the method showed potential for efficient resolution of fractional differential equations. - Open Access
- 11 November 2021
- Published by MDPI AG in Fractal and Fractional
- Vol. 5 (4) , 208
Technique to Solve Linear Fractional Differential Equations Using B-Polynomials Bases
A multidimensional, modified, fractional-order B-polys technique was implemented for finding solutions of linear fractional-order partial differential equations. To calculate the results of the linear Fractional Partial Differential Equations (FPDE), the sum of the product of fractional B-polys and the coefficients was employed. Moreover, minimization of error in the coefficients was found by employing the Galerkin method. Before the Galerkin method was applied, the linear FPDE was transformed into an operational matrix equation that was inverted to provide the values of the unknown coefficients in the approximate solution. A valid multidimensional solution was determined when an appropriate number of basis sets and fractional-order of B-polys were chosen. In addition, initial conditions were applied to the operational matrix to seek proper solutions in multidimensions. The technique was applied to four examples of linear FPDEs and the agreements between exact and approximate solutions were found to be excellent. The current technique can be expanded to find multidimensional fractional partial differential equations in other areas, such as physics and engineering fields.
- 11 November 2021
- Published by MDPI AG in Fractal and Fractional
- Vol. 5 (4) , 208
Open AccessTechnique to Solve Linear Fractional Differential Equations Using B-Polynomials Bases
A multidimensional, modified, fractional-order B-polys technique was implemented for finding solutions of linear fractional-order partial differential equations. To calculate the results of the linear Fractional Partial Differential Equations (FPDE), the sum of the product of fractional B-polys and the coefficients was employed. Moreover, minimization of error in the coefficients was found by employing the Galerkin method. Before the Galerkin method was applied, the linear FPDE was transformed into an operational matrix equation that was inverted to provide the values of the unknown coefficients in the approximate solution. A valid multidimensional solution was determined when an appropriate number of basis sets and fractional-order of B-polys were chosen. In addition, initial conditions were applied to the operational matrix to seek proper solutions in multidimensions. The technique was applied to four examples of linear FPDEs and the agreements between exact and approximate solutions were found to be excellent. The current technique can be expanded to find multidimensional fractional partial differential equations in other areas, such as physics and engineering fields.
- Open Access
- 31 August 2021
- Published by MDPI AG in Fractal and Fractional
- Vol. 5 (3) , 106
Approximate Solutions of Nonlinear Partial Differential Equations Using B-Polynomial Bases
A multivariable technique has been incorporated for guesstimating solutions of Nonlinear Partial Differential Equations (NPDE) using bases set of B-Polynomials (B-polys). To approximate the anticipated solution of the NPD equation, a linear product of variable coefficients and B-polys has been employed. Additionally, the variable quantities in the anticipated solution are determined using the Galerkin method for minimizing errors. Before the minimization process is to take place, the NPDE is converted into an operational matrix equation which, when inverted, yields values of the undefined coefficients in the expected solution. The nonlinear terms of the NPDE are combined in the operational matrix equation using the initial guess and iterated until converged values of coefficients are obtained. A valid converged solution of NPDE is established when an appropriate degree of B-poly basis is employed, and the initial conditions are imposed on the operational matrix before the inverse is invoked. However, the accuracy of the solution depends on the number of B-polys of a certain degree expressed in multidimensional variables. Four examples of NPDE have been worked out to show the efficacy and accuracy of the two-dimensional B-poly technique. The estimated solutions of the examples are compared with the known exact solutions and an excellent agreement is found between them. In calculating the solutions of the NPD equations, the currently employed technique provides a higher-order precision compared to the finite difference method. The present technique could be readily extended to solving complex partial differential equations in multivariable problems.- 31 August 2021
- Published by MDPI AG in Fractal and Fractional
- Vol. 5 (3) , 106
Open AccessApproximate Solutions of Nonlinear Partial Differential Equations Using B-Polynomial Bases
A multivariable technique has been incorporated for guesstimating solutions of Nonlinear Partial Differential Equations (NPDE) using bases set of B-Polynomials (B-polys). To approximate the anticipated solution of the NPD equation, a linear product of variable coefficients and B-polys has been employed. Additionally, the variable quantities in the anticipated solution are determined using the Galerkin method for minimizing errors. Before the minimization process is to take place, the NPDE is converted into an operational matrix equation which, when inverted, yields values of the undefined coefficients in the expected solution. The nonlinear terms of the NPDE are combined in the operational matrix equation using the initial guess and iterated until converged values of coefficients are obtained. A valid converged solution of NPDE is established when an appropriate degree of B-poly basis is employed, and the initial conditions are imposed on the operational matrix before the inverse is invoked. However, the accuracy of the solution depends on the number of B-polys of a certain degree expressed in multidimensional variables. Four examples of NPDE have been worked out to show the efficacy and accuracy of the two-dimensional B-poly technique. The estimated solutions of the examples are compared with the known exact solutions and an excellent agreement is found between them. In calculating the solutions of the NPD equations, the currently employed technique provides a higher-order precision compared to the finite difference method. The present technique could be readily extended to solving complex partial differential equations in multivariable problems.