A highly accurate and efficient Genocchi‐based spectral technique applied to singular fractional order boundary value problems
Bibliographic record
Abstract
This article focuses on an efficient and highly accurate approximate solver for a class of generalized singular boundary value problems (SBVPs) having nonlinearity and with two‐term fractional derivatives. The involved fractional derivative operators are given in the form of Liouville–Caputo. The developed algorithm for solving the generalized SBVPs consists of two main stages. The first stage is devoted to an iterative quasilinearization method (QLM) to conquer the (strong) nonlinearity of the governing SBVPs. Secondly, we employ the generalized Genocchi polynomials (GGPs) to treat the resulting sequence of linearized SBVPs numerically. An upper error estimate for the Genocchi series solution in the norm is obtained via a rigorous error analysis. The main benefit of the presented QLM‐GGPs procedure is that the required number of iteration in the first stage is within a few steps, and an accurate polynomial solution is obtained through computer implementations in the second stage. Three widely applicable test cases are investigated to observe the efficacy as well as the high‐order accuracy of the QLM‐GGPs algorithm. The comparable accuracy and robustness of the presented algorithm are validated by doing comparisons with the results of some well‐established available computational methods. It is apparently shown that the QLM‐GGPs algorithm provides a promising tool to solve strongly nonlinear SBVPs with two‐term fractional derivatives accurately and efficiently.
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.000 |
| 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".