English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The primary motivation of this paper is to extend the application of the reproducing-kernel method (RKM) and the residual power series method (RPSM) to conduct a numerical investigation for a class of boundary value problems of fractional order 2α, \(0<\alpha\leq1\), concerned with obstacle, contact and unilateral problems. The RKM involves a variety of uses for emerging mathematical problems in the sciences, both for integer and non-integer (arbitrary) orders. The RPSM is combining the generalized Taylor series formula with the residual error functions. The fractional derivative is described in the Caputo sense. The representation of the analytical solution for the generalized fractional obstacle system is given by RKM with accurately computable structures in reproducing-kernel spaces. While the methodology of RPSM is based on the construction of a fractional power series expansion in rapidly convergent form and apparent sequences of solution without any restriction hypotheses. The recurrence form of the approximate function is selected by a well-posed truncated series that is proved to converge uniformly to the analytical solution. A comparative study was conducted between the obtained results by the RKM, RPSM and exact solution at different values of α. The numerical results confirm both the obtained theoretical predictions and the efficiency of the proposed methods to obtain the approximate solutions.

Two computational approaches for solving a fractional obstacle system in Hilbert space