The numerical approach for finding the solution of fractional order systems of boundary value problems (BPVs) is derived in this paper. The implementation of the weighted residuals such as Galerkin, Least Square, and ...The numerical approach for finding the solution of fractional order systems of boundary value problems (BPVs) is derived in this paper. The implementation of the weighted residuals such as Galerkin, Least Square, and Collocation methods are included for solving fractional order differential equations, which is broadened to acquire the approximate solutions of fractional order systems with differentiable polynomials, namely Legendre polynomials, as basis functions. The algorithm of the residual formulations of matrix form can be coded efficiently. The interpretation of Caputo fractional derivatives is employed here. We have demonstrated these methods numerically through a few examples of linear and nonlinear BVPs. The results in absolute errors show that the present method efficiently finds the numerical solutions of fractional order systems of differential equations.展开更多
In this manuscript,an algorithm for the computation of numerical solutions to some variable order fractional differential equations(FDEs)subject to the boundary and initial conditions is developed.We use shifted Legen...In this manuscript,an algorithm for the computation of numerical solutions to some variable order fractional differential equations(FDEs)subject to the boundary and initial conditions is developed.We use shifted Legendre polynomials for the required numerical algorithm to develop some operational matrices.Further,operational matrices are constructed using variable order differentiation and integration.We are finding the operationalmatrices of variable order differentiation and integration by omitting the discretization of data.With the help of aforesaid matrices,considered FDEs are converted to algebraic equations of Sylvester type.Finally,the algebraic equations we get are solved with the help of mathematical software like Matlab or Mathematica to compute numerical solutions.Some examples are given to check the proposed method’s accuracy and graphical representations.Exact and numerical solutions are also compared in the paper for some examples.The efficiency of the method can be enhanced further by increasing the scale level.展开更多
A Legendre-Legendre spectral collocation scheme is constructed for Korteweg-de Vries(KdV)equation on bounded domain by using the Legendre collocation method in both time and space,which is a nonlinear matrix equation ...A Legendre-Legendre spectral collocation scheme is constructed for Korteweg-de Vries(KdV)equation on bounded domain by using the Legendre collocation method in both time and space,which is a nonlinear matrix equation that is changed to a nonlinear systems and can be solved by the usual fixed point iteration.Numerical results demonstrate the efficiency of the method and spectral accuracy.展开更多
Guidance is offered for understanding and using the Legendre transformation and its associated duality among functions and curves. The genesis of this paper was encounters with colleagues and students asking about the...Guidance is offered for understanding and using the Legendre transformation and its associated duality among functions and curves. The genesis of this paper was encounters with colleagues and students asking about the transformation. A main feature is simplicity of exposition, while keeping in mind the purpose or application for using the transformation.展开更多
In this paper, we prove Legendre’s conjecture: There is a prime number between n<sup>2</sup> and (n +1)<sup>2</sup> for every positive integer n. We also prove three related conjectures. The m...In this paper, we prove Legendre’s conjecture: There is a prime number between n<sup>2</sup> and (n +1)<sup>2</sup> for every positive integer n. We also prove three related conjectures. The method that we use is to analyze binomial coefficients. It is developed by the author from the method of analyzing binomial central coefficients, that was used by Paul Erdős in his proof of Bertrand’s postulate - Chebyshev’s theorem.展开更多
文摘The numerical approach for finding the solution of fractional order systems of boundary value problems (BPVs) is derived in this paper. The implementation of the weighted residuals such as Galerkin, Least Square, and Collocation methods are included for solving fractional order differential equations, which is broadened to acquire the approximate solutions of fractional order systems with differentiable polynomials, namely Legendre polynomials, as basis functions. The algorithm of the residual formulations of matrix form can be coded efficiently. The interpretation of Caputo fractional derivatives is employed here. We have demonstrated these methods numerically through a few examples of linear and nonlinear BVPs. The results in absolute errors show that the present method efficiently finds the numerical solutions of fractional order systems of differential equations.
基金Supporting Project No.(PNURSP2022R 14),Princess Nourah bint A bdurahman University,Riyadh,Saudi Arabia.
文摘In this manuscript,an algorithm for the computation of numerical solutions to some variable order fractional differential equations(FDEs)subject to the boundary and initial conditions is developed.We use shifted Legendre polynomials for the required numerical algorithm to develop some operational matrices.Further,operational matrices are constructed using variable order differentiation and integration.We are finding the operationalmatrices of variable order differentiation and integration by omitting the discretization of data.With the help of aforesaid matrices,considered FDEs are converted to algebraic equations of Sylvester type.Finally,the algebraic equations we get are solved with the help of mathematical software like Matlab or Mathematica to compute numerical solutions.Some examples are given to check the proposed method’s accuracy and graphical representations.Exact and numerical solutions are also compared in the paper for some examples.The efficiency of the method can be enhanced further by increasing the scale level.
基金Supported by National Natural Science Foundation of China(Grant Nos.11771299,11371123)Natural Science Foundation of Henan Province(Grant No.202300410156).
文摘A Legendre-Legendre spectral collocation scheme is constructed for Korteweg-de Vries(KdV)equation on bounded domain by using the Legendre collocation method in both time and space,which is a nonlinear matrix equation that is changed to a nonlinear systems and can be solved by the usual fixed point iteration.Numerical results demonstrate the efficiency of the method and spectral accuracy.
文摘Guidance is offered for understanding and using the Legendre transformation and its associated duality among functions and curves. The genesis of this paper was encounters with colleagues and students asking about the transformation. A main feature is simplicity of exposition, while keeping in mind the purpose or application for using the transformation.
文摘In this paper, we prove Legendre’s conjecture: There is a prime number between n<sup>2</sup> and (n +1)<sup>2</sup> for every positive integer n. We also prove three related conjectures. The method that we use is to analyze binomial coefficients. It is developed by the author from the method of analyzing binomial central coefficients, that was used by Paul Erdős in his proof of Bertrand’s postulate - Chebyshev’s theorem.
