Novel Hybrid Function Operational Matrices of Fractional Integration: An Application for Solving Multi-Order Fractional Differential Equations
Bibliographic record
Abstract
Although fractional calculus has evolved significantly since its origin in the 1695 correspondence between Leibniz and L’Hôpital, the numerical treatment of multi-order fractional differential equations remains a challenge. Existing methods are often either computationally expensive or reliant on complex operational frameworks that hinder their broader applicability. In the present study, a novel numerical algorithm is proposed based on orthogonal hybrid functions (HFs), which were constructed as linear combinations of piecewise constant sample-and-hold functions and piecewise linear triangular functions. These functions, belonging to the class of degree-1 orthogonal polynomials, were employed to obtain the numerical solution of multi-order fractional differential equations defined in the Caputo sense. A generalized one-shot operational matrix was derived to explicitly express the Riemann–Liouville fractional integral of HFs in terms of the HFs themselves. This allowed the original multi-order fractional differential equation to be transformed directly into a system of algebraic equations, thereby simplifying the solution process. The developed algorithm was then applied to a range of benchmark problems, including both linear and nonlinear multi-order FDEs with constant and variable coefficients. Numerical comparisons with well-established methods in the literature revealed that the proposed approach not only achieved higher accuracy but also significantly reduced computational effort, demonstrating its potential as a reliable and efficient numerical tool for fractional-order modeling.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 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".