pith. sign in

arxiv: 2604.25417 · v3 · pith:VLJ7TK36new · submitted 2026-04-28 · 🧮 math.NA · cs.NA

Fractional calculus via variable-transform-based spectral approximations

Xiaolin Liu , Kuan Xu This is my paper

Pith reviewed 2026-05-07 15:45 UTC · model grok-4.3

classification 🧮 math.NA cs.NA
keywords fractional calculusspectral methodsvariable transformsChebyshev polynomialsfractional integralsnumerical stabilityspectral approximationstransplanted polynomials
0
0 comments X

The pith

Variable transforms applied to Chebyshev polynomials yield stable spectral approximations for fractional integral operators.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a unifying framework that constructs spectral approximations to fractional integral operators by composing Chebyshev polynomials with variable transforms. Algebraic transforms produce approximations based on Jacobi fractional polynomials, while exponential transforms create more versatile versions suitable for a wider range of problems. The resulting approximations maintain numerical stability and achieve optimal computational complexity, enabling fast spectral methods for fractional calculus. Numerical demonstrations with the double-exponential transform show success on examples that defeat existing spectral approaches.

Core claim

We present a novel and unifying framework for constructing spectral approximations to fractional integral operators. These spectral approximations are based on transplanted Chebyshev polynomials, which are obtained by composing Chebyshev polynomials with a variable transform. When an algebraic transform is used, the framework produces spectral approximations based on Jacobi fractional polynomials. When an exponential transform is used, it yields a versatile spectral approximation that is applicable to a much broader class of fractional calculus problems. The construction of such spectral approximations is both numerically stable and optimal in terms of complexity. These spectral approaches,,

What carries the argument

Transplanted Chebyshev polynomials formed by composing standard Chebyshev polynomials with a variable transform, which serve as the basis for approximating fractional integral operators.

If this is right

  • Spectral methods for fractional calculus become both stable and computationally fast with optimal complexity.
  • The double-exponential transform extends the reach of spectral methods to classes of problems that current techniques cannot handle.
  • The same construction unifies algebraic-transform cases (yielding Jacobi fractional polynomials) with exponential-transform cases under one framework.
  • Fractional integral operators can be discretized spectrally in a way that supports direct application to broader fractional calculus problems.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The framework might be adapted to approximate fractional derivatives by adjusting the underlying integral representation.
  • Discretizations from this method could improve conditioning when solving fractional differential equations numerically.
  • Automated selection of transform parameters might remove the need for manual tuning in general implementations.

Load-bearing premise

The chosen variable transforms preserve spectral accuracy and numerical stability for the fractional integral operator without introducing instabilities or requiring problem-specific parameter adjustments.

What would settle it

Numerical experiments on the double-exponential version that exhibit loss of exponential convergence rates or sudden instability for standard fractional orders and smooth test functions would disprove the stability and accuracy claims.

Figures

Figures reproduced from arXiv: 2604.25417 by Kuan Xu, Xiaolin Liu.

Figure 1
Figure 1. Figure 1: The algebraic transform (3.1) for α = 0 and β = 1/2: (a) the forward transform and (b) the first five JFPs. which coincides with the multiplication matrix for infinite Chebyshev series. Proof. For any k, l ∈ N, Qk(x)Ql(x) = Tk(y)Tl(y) = 1 2 view at source ↗
Figure 2
Figure 2. Figure 2: The double-exponential transform: (a) the forward transform (3.3a) with view at source ↗
Figure 3
Figure 3. Figure 3: (a) The parameter ω versus the errors in the computed values of (1+ψ(y))µ for various fractional order µ. The vertical line marks the values determined by (3.6). Error in the DETCP expansion of (b) f(x) = (1−x) 1 3 (1+x) 1 2 , (c) (1+x) 10−5 , and (d) f(x) = e x . For these functions, ω = 4.238, 14.646, 3.154, respectively, and the errors are estimated by evaluating the pointwise error at 2 × 104 evenly sp… view at source ↗
Figure 4
Figure 4. Figure 4: (a) G(y, 1/2) is smooth except at y = −1, where it has a weak singularity of order (1 + y) µ. (b) A log–log plot of G(y, t) near y = −1. function with an extremely weak singularity, and a smooth (indeed, analytic) function. On the one hand, if 1 ± ψ(y) is evaluated naively, the exponential convergence of the approximation error ceases prematurely. With the stabilization technique in (3.7), the error in the… view at source ↗
Figure 5
Figure 5. Figure 5: Error versus N for (a) the fractional Abel integral equation (4.1) of various fractional order µ and (b) the Riesz fractional integral equation (4.2). in Figure 5a. After an initial phase of exponential decay to approximately machine precision, the errors level off without rebounce, which indicates the stability of the DESA-based spectral method. To the best of our knowledge, this appears to be the first n… view at source ↗
Figure 6
Figure 6. Figure 6: Solving (4.3) by the DESA-based spectral method: (a) the solution and (b) view at source ↗
Figure 7
Figure 7. Figure 7: Real and imaginary parts of the solution to the fractional Airy equation view at source ↗
Figure 8
Figure 8. Figure 8: (a) Cauchy errors of the six eigenvalues of smallest modulus, obtained by view at source ↗
Figure 9
Figure 9. Figure 9: ε-pseudospectra of the half-derivative FDO (4.10) for ε = 10−2 , 10−3 , . . . , 10−12, from left to right. The ε-pseudospectra obtained by the “solve-then-discretize” paradigm are shown in view at source ↗
read the original abstract

We present a novel and unifying framework for constructing spectral approximations to fractional integral operators. These spectral approximations are based on transplanted Chebyshev polynomials, which are obtained by composing Chebyshev polynomials with a variable transform. When an algebraic transform is used, the framework produces spectral approximations based on Jacobi fractional polynomials. When an exponential transform is used, it yields a versatile spectral approximation that is applicable to a much broader class of fractional calculus problems. The construction of such spectral approximations is both numerically stable and optimal in terms of complexity. These spectral approximations lead to stable and fast spectral methods for fractional calculus. The spectral approximation based on the double-exponential transform is demonstrated through extensive numerical examples that are intractable for existing spectral methods.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The paper presents a unifying framework for spectral approximations to fractional integral operators based on transplanted Chebyshev polynomials obtained via composition with variable transforms. Algebraic transforms yield Jacobi fractional polynomials, while exponential (including double-exponential) transforms produce approximations applicable to a broader class of problems. The construction is claimed to be numerically stable and optimal in complexity, enabling stable and fast spectral methods for fractional calculus, with the double-exponential version demonstrated on extensive numerical examples intractable for prior spectral methods.

Significance. If the stability, optimality, and preservation of spectral accuracy hold, the framework would provide a practical unifying approach for handling fractional integrals in spectral methods, extending applicability to challenging non-local problems and potentially improving efficiency over existing techniques in fractional differential equations.

major comments (2)
  1. [Abstract (and associated construction sections)] The central claim that variable transforms (algebraic or double-exponential) preserve spectral accuracy and numerical stability for the fractional integral operator without degradation due to the non-local weakly singular kernel is load-bearing but not obviously true; the abstract asserts this holds broadly and yields optimal complexity, yet any mismatch in mapped endpoint behavior or quadrature could reduce rates to algebraic. A concrete convergence theorem or error bound analysis is required to support this.
  2. [Abstract] The optimality in complexity and numerical stability of the construction are asserted without explicit verification steps, parameter sensitivity analysis for the transform, or comparison of convergence rates against standard Chebyshev methods on the fractional operator; this undermines the claim that the double-exponential version succeeds on intractable examples.
minor comments (1)
  1. Clarify the precise definition of 'transplanted Chebyshev polynomials' and how the composition is implemented numerically to avoid ambiguity in reproducibility.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thorough review and valuable suggestions. We address the major comments below and outline the revisions we plan to make to strengthen the manuscript.

read point-by-point responses

  1. Referee: [Abstract (and associated construction sections)] The central claim that variable transforms (algebraic or double-exponential) preserve spectral accuracy and numerical stability for the fractional integral operator without degradation due to the non-local weakly singular kernel is load-bearing but not obviously true; the abstract asserts this holds broadly and yields optimal complexity, yet any mismatch in mapped endpoint behavior or quadrature could reduce rates to algebraic. A concrete convergence theorem or error bound analysis is required to support this.

    Authors: We agree that a more explicit analysis would strengthen the claims. In the revised manuscript, we will add a new section providing a convergence theorem for the transplanted approximations. The theorem will bound the error in terms of the smoothness of the integrand and the properties of the variable transform, showing that spectral accuracy is preserved for both algebraic and double-exponential cases. This will include analysis of the mapped endpoint behavior to ensure no reduction to algebraic rates. revision: yes

  2. Referee: [Abstract] The optimality in complexity and numerical stability of the construction are asserted without explicit verification steps, parameter sensitivity analysis for the transform, or comparison of convergence rates against standard Chebyshev methods on the fractional operator; this undermines the claim that the double-exponential version succeeds on intractable examples.

    Authors: We will enhance the manuscript by including explicit verification of the complexity (showing O(N) or optimal operations per evaluation) and stability through condition number analysis. Additionally, we will add a parameter sensitivity study for the double-exponential transform parameters and direct comparisons of convergence rates with standard Chebyshev spectral methods applied directly to the fractional integral. These additions will support the claims and demonstrate the advantages on the challenging examples. revision: yes

Circularity Check

0 steps flagged

No circularity: derivation built from explicit transforms and standard Chebyshev properties

full rationale

The paper defines its spectral approximations explicitly by composing Chebyshev polynomials with algebraic or double-exponential variable transforms, then applies them to fractional integral operators. No equations or claims reduce the output approximations to fitted inputs, self-referential definitions, or load-bearing self-citations; the stability, optimality, and applicability statements follow from the construction using known Chebyshev convergence properties and explicit maps. The framework is therefore self-contained and does not exhibit any of the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The framework rests on standard properties of Chebyshev polynomials and variable transforms without introducing new free parameters or postulated entities.

axioms (1)
  • domain assumption Composition of Chebyshev polynomials with algebraic or exponential maps preserves the ability to approximate fractional integral operators with spectral accuracy.
    Invoked when claiming the resulting approximations are stable and optimal.

pith-pipeline@v0.9.0 · 5404 in / 1152 out tokens · 35642 ms · 2026-05-07T15:45:34.807645+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.