Key points are not available for this paper at this time.
An algorithm for approximating solutions to 2nd-order linear differential equations with polynomial coefficients in B-polynomials (Bernstein polynomial basis) subject to Dirichlet conditions is introduced. The algorithm expands the desired solution in terms of B-polynomials over a closed interval 0, 1 and then makes use of the orthonormal relation of B-polynomials with its dual basis to determine the expansion coefficients to construct a solution. Matrix formulation is used throughout the entire procedure. However, accuracy and efficiency are dependent on the size of the set of B-polynomials, and the procedure is much simpler compared to orthogonal polynomials for solving differential equations. The current procedure is implemented to solve five linear equations and one first-order nonlinear equation, and excellent agreement is found between the exact and approximate solutions. In addition, the algorithm improves the accuracy and efficiency of the traditional methods for solving differential equations that rely on much more complicated numerical techniques. This procedure has great potential to be implemented in more complex systems where there are no exact solutions available except approximations.
H. M. Ahmed (Thu,) studied this question.