The Refinement-Schemes Unified Algorithms for Certain Nth Order Linear and Nonlinear Differential Equations With a Set of Constraints
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Open Access Color
GOLD
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Top 10%
Abstract
We first present a generalized class of binary interpolating refinement schemes and their properties. Then the refinement-schemes-based unified algorithms for the solution of certain nth order linear and nonlinear differential equations with a set of constraints are presented. Moreover, several algorithms based on the refinement schemes for solving differential equations are the special cases of our algorithms.
Description
Mustafa, Ghulam/0000-0002-0441-8485
ORCID
Keywords
Differential Equation, Constraints, Boundary Value Problems, Algorithm, Refinement Schemes, Interpolation, Boundary value problems, Algorithm, Differential equation, Constraints, QA1-939, Refinement schemes, Mathematics, Interpolation, Numerical solution of boundary value problems involving ordinary differential equations, algorithm, Finite element, Rayleigh-Ritz, Galerkin and collocation methods for ordinary differential equations, boundary value problems, refinement schemes, interpolation, differential equation, constraints, Numerical solution of singularly perturbed problems involving ordinary differential equations
Fields of Science
0101 mathematics, 01 natural sciences
Citation
Ejaz, Syeda Tehmina...et al. (2021). "The refinement-schemes-based unified algorithms for certain nth order linear and nonlinear differential equations with a set of constraints", Advances in Difference Equations, Vol. 2021, No. 1.
WoS Q
Scopus Q
OpenCitations Citation Count
2
Volume
2021
Issue
1
Start Page
End Page
PlumX Metrics
Citations
Scopus : 3
Captures
Mendeley Readers : 3
SCOPUS™ Citations
3
checked on May 30, 2026
Web of Science™ Citations
3
checked on May 30, 2026
Page Views
6
checked on May 30, 2026
Google Scholar™
