An Optimal Multiquadric Variable Shape Parameter for Boundary Value Problems Using Particle Swarm Optimization
Bibliographic record
Abstract
The multiquadric radial basis function method has been widely used to solve partial differential equations-based problems regarding its flexibility and meshfree characteristics. The accuracy and stability of this method are derived and based on the use of a free-shape parameter that sensibly controls the comportment of the technique. Significant improvements have already been reported and show that variable shape parameters conduct the method to handle problems with striking results compared to global-based techniques. Nevertheless, choosing a suitable set of shape parameters is still an open topic because of the complexity of the method when the number of collocation points increases. The current work proposes a variant particle swarm optimization based on local displacement with attractors to determine the multi-quadratic function's ``best'' optimal variable shape parameter in solving boundary value problems. Based on an initially random set of variable shape parameters, the proposed algorithm first performs and evaluates the errors between the expected exact solution and the approximate solution thoroughly. In the first stage, the particle swarm algorithm search for an optimal set of shape parameters that minimize the error and the conditioning number of the radial basis system matrix. In the second stage, the obtained optimal set of shape parameters is applied to solve the considered problem. In this way, when the number of collocation points increases, the first stage based on particle swarm optimization stabilizes the strategy. It proposes an ``acceptable'' set of shape parameters for the given problem. The proposed method is applied to a set of well-known boundary value problems in one and two-dimensional spaces and compared to other techniques published in the literature. The results show that the proposed method achieves more accurate solutions than recently proposed in the literature.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| 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.002 | 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".