A Unified Framework Using Orthogonal Hybrid Functions for Solving Linear and Nonlinear Fractional Differential Systems
Bibliographic record
Abstract
This paper presents a novel and computationally efficient numerical method for solving systems of fractional-order differential equations using orthogonal hybrid functions (HFs). The proposed HFs are constructed by combining piecewise constant orthogonal sample-and-hold functions with piecewise linear orthogonal right-handed triangular functions, resulting in a flexible and accurate approximation basis. A central innovation of the method is the derivation of generalized one-shot operational matrices that approximate the Riemann–Liouville fractional integral, enabling direct integration of differential operators of arbitrary order. These matrices act as unified integrators for both integer and non-integer orders, enhancing the method’s applicability and scalability. A rigorous convergence analysis is provided, establishing theoretical guarantees for the accuracy of the numerical solution. The effectiveness and robustness of the approach are demonstrated through several benchmark problems, including fractional-order models related to smoking dynamics, lung cancer progression, and Hepatitis B infection. Comparative results highlight the method’s superior performance in terms of accuracy, numerical stability, and computational efficiency when applied to complex, nonlinear, and high-dimensional fractional-order systems.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| 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".