There are several classifications of linear Integral Equations. Some of them include; Voltera Integral Equations, Fredholm Linear Integral Equations, Fredholm-Voltera Integrodifferential. In the past, solutions of higher-order Fredholm-Volterra Integrodifferential Equations [FVIE] have been presented. However, this work uses a computational techniques premised on the third kind Chebyshev polynomials method. The performance of the results for distinctive degrees of approximation (M) of the trial solution is cautiously studied and comparisons have been additionally made between the approximate/estimated and exact/definite solution at different intervals of the problems under consideration. Modelled Problems have been provided to illustrate the performance and relevance of the techniques. However, it turned out that as M increases, the outcomes received after every iteration get closer to the exact solution in all of the problems considered. The results of the experiments are therefore visible from the tables of errors and the graphical representation presented in this work.
In this study, the Volterra-FredholmIntegro-Differential Equations (VFIDEs) are solved computationally using first-kind Chebyshev polynomials as basis functions. The technique converts VFIDEs into a system of unknown Chebyshev coefficients linear algebraic equations, which are then solved via matrix inversion. Five numerical examples were solved in order to assess the scheme's correctness and effectiveness. The findings reveal that the approach outperforms the comparison results in the literature
This work presents a collocation computational algorithm for solving linear Integro-Differential Equations (IDEs) of the Fredholm and Volterra types. The proposed method utilizes shifted Legendre polynomials and breaks down the problem into a series of linear algebraic equations. The matrix inversion technique is then employed to solve these equations. To validate the effectiveness of the suggested approach, the authors examined three numerical examples. The results obtained from the proposed method were compared with those reported in the existing literature. The findings demonstrate that the proposed algorithm is not only accurate but also efficient in solving linear IDEs. In order to present the results, the study employs tables and figures. These graphical representations aid in displaying the numerical outcomes obtained from the algorithm. All calculations were performed using Maple 18 software.
30 August 2024 in Partial Differential Equations in Applied Mathematics
This study employs Shifted Vieta-Lucas Polynomials using the variational iteration approach to numerically resolve sixth and seventh order Boundary Value Problems (BVPs), The proposed method in the study is used, with the trial functions for the approximation being the shifted Vieta Lucas polynomials generated for the given boundary value problem. The study provides an efficient and accurate solutions to higher-order BVPs using a combination of Shifted Vieta-Lucas Polynomials and the variational iteration approach and finds applications in mathematics and other fields of sciences and engineering.
This study demonstrates the derivation of a two-step block scheme simulation through a linear block approach. The scheme's fundamental properties were thoroughly analyzed and found to fulfill all necessary conditions. The research focused on examining specific classes of oscillatory differential equations and comparing them to established methods. The findings indicate that the newly proposed methods exhibit superior accuracy and faster convergence compared to the existing methods investigated in this research. Consequently, the results highlight the improved precision and quicker convergence achieved with the new method. All computations were executed using Maple 18 software