Solving Some Physics Problems Involving Fractional-Order Differential Equations with the Morgan-Voyce Polynomials
Bibliographic record
Abstract
In this research, we present a new computational technique for solving some physics problems involving fractional-order differential equations including the famous Bagley–Torvik method. The model is considered one of the important models to simulate the coupled oscillator and various other applications in science and engineering. We adapt a collocation technique involving a new operational matrix that utilizes the Liouville–Caputo operator of differentiation and Morgan–Voyce polynomials, in combination with the Tau spectral method. We first present the differentiation matrix of fractional order that is used to convert the problem and its conditions into an algebraic system of equations with unknown coefficients, which are then used to find the solutions to the proposed models. An error analysis for the method is proved to verify the convergence of the acquired solutions. To test the effectiveness of the proposed technique, several examples are simulated using the presented technique and these results are compared with other techniques from the literature. In addition, the computational time is computed and tabulated to ensure the efficacy and robustness of the method. The outcomes of the numerical examples support the theoretical results and show the accuracy and applicability of the presented approach. The method is shown to give better results than the other methods using a lower number of bases and with less spent time, and helped in highlighting some of the important features of the model. The technique proves to be a valuable approach that can be extended in the future for other fractional models having real applications such as the fractional partial differential equations and fractional integro-differential equations.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".