Jansson Derivative Method Overview

• Jansson derivative method is an SVD-based technique that stabilizes numerical differentiation from noisy data by truncating divergent operator inversions.
• It employs a closed-form projection with QR decomposition and thresholding to extract coefficients and perform robust residual diagnostics.
• The approach extends to fractional derivatives by replacing the standard integration operator with a Riemann–Liouville operator, managing ill-posedness via TSVD regularization.

The Jansson derivative method, in the literature summarized here, denotes a singular-value-decomposition-based procedure for numerical differentiation from noisy discrete data. In its classical form, it differentiates noisy data by inverting the integration operator via its SVD and truncating the inversion at a finite index to control noise amplification. In the formulation developed in "Closed-Form Projection Method for Regularizing a Function Defined by a Discrete Set of Noisy Data and for Estimating its Derivative and Fractional Derivative" (Burns et al., 2018), this idea becomes a closed-form, finite-dimensional projection method with measurement weighting, QR-based coefficient extraction, residual diagnostics, and an extension from first derivatives to fractional derivatives.

1. Terminology and scope

Within the supplied sources, the term has a primary and a secondary status. Its primary meaning is the SVD-based derivative method described explicitly as the classical “Jansson derivative method” in the context of differentiating an antiderivative or fractional integral corrupted by noise (Burns et al., 2018). Two later papers discuss different derivative constructions and explicitly note that they do not themselves use the name.

Context	Description	Paper
Noisy-data differentiation	Classical “Jansson derivative method” via SVD inversion and truncation	(Burns et al., 2018)
Jacobi-polynomial order derivatives	The name is not used; if encountered elsewhere, it corresponds there to the parameter-derivative/Wronskian approach	(Schulze-Halberg, 26 Jun 2026)
Derivatives of matrix functions	The paper does not use or mention the term; the method is the Mathias/Fréchet block-matrix approach	(Puhr et al., 2016)

The dominant encyclopedic meaning in the present corpus is therefore the inverse-problem method of (Burns et al., 2018). In that setting, the problem begins with noisy samples $\{(x_i,y_i)\}$ of either the antiderivative $g$ of an unknown $f$, with $g(x)=\int_a^x f(t)\,dt$ or more generally $g=I_a^\mu f$ for $0<\mu<1$, or of the function $f$ itself. The measurement model is

$y_i = h(x_i) + \epsilon_i,$

with $E[\epsilon]=0$ and $$\operatorname{Cov}(\epsilon)=S^2=\operatorname{diag}(s_1^2,\ldots,s_m^2)$$ (Burns et al., 2018).

A plausible implication is that the phrase “Jansson derivative method” should be read carefully across subfields: in inverse problems it refers to TSVD differentiation of integral data, whereas in the other two cited papers the term is only discussed as absent or as a possible external naming variant.

2. Operator-theoretic formulation

The method is built on explicit singular systems of smoothing operators. For standard differentiation on $g$0, one uses the integration operator

$g$1

with $g$2 and the singular system

$g$3

$g$4

satisfying $g$5, $g$6, orthonormality in $g$7, and $g$8 (Burns et al., 2018).

For fractional differentiation on $g$9, the relevant operator is the left-sided Riemann–Liouville fractional integral

$f$0

On $f$1, with $f$2 and $f$3, a closed-form SVD is

$f$4

$f$5

$f$6

$f$7

Here the $f$8 form an orthonormal basis for $f$9 and the $g(x)=\int_a^x f(t)\,dt$0 are orthonormal in $g(x)=\int_a^x f(t)\,dt$1, with $g(x)=\int_a^x f(t)\,dt$2 and $g(x)=\int_a^x f(t)\,dt$3 (Burns et al., 2018).

These singular systems encode the ill-posedness directly. The ideal inversion

$g(x)=\int_a^x f(t)\,dt$4

is unstable because $g(x)=\int_a^x f(t)\,dt$5. Jansson’s idea is therefore to replace the divergent inversion by the truncated-SVD estimate

$g(x)=\int_a^x f(t)\,dt$6

with a truncation index chosen from discrepancy or related criteria (Burns et al., 2018).

3. Closed-form projection and coefficient recovery

The 2018 formulation converts this operator-theoretic inversion into a finite-dimensional procedure on discrete noisy data. The data are first scaled by $g(x)=\int_a^x f(t)\,dt$7 to account for heteroscedasticity. Writing $g(x)=\int_a^x f(t)\,dt$8 when an antiderivative is measured, or $g(x)=\int_a^x f(t)\,dt$9 when the measured object is the function itself, the scaled data satisfy a white-noise model in which residuals can be interpreted statistically (Burns et al., 2018).

Given sample nodes $g=I_a^\mu f$0, one assembles the range-basis design matrix

$g=I_a^\mu f$1

The algorithm then uses

$g=I_a^\mu f$2

with $g=I_a^\mu f$3 orthogonal and $g=I_a^\mu f$4 upper-triangular, followed by the rotated, scaled coefficients

$g=I_a^\mu f$5

Because $g=I_a^\mu f$6 is orthogonal, the noise in $g=I_a^\mu f$7 remains white with unit variance, and the components $g=I_a^\mu f$8 can be interpreted as orthogonalized projections of the scaled data onto increasingly oscillatory basis functions (Burns et al., 2018).

Signal extraction is performed by thresholding. One starts with $g=I_a^\mu f$9 and defines

$0<\mu<1$0

Then

$0<\mu<1$1

and

$0<\mu<1$2

From $0<\mu<1$3 and hence $0<\mu<1$4, one solves

$0<\mu<1$5

This yields a smooth closed-form approximation in the range space,

$0<\mu<1$6

The source estimate is then obtained by SVD inversion:

$0<\mu<1$7

For $0<\mu<1$8 on $0<\mu<1$9, this becomes

$f$0

For $f$1 on $f$2, it becomes

$f$3

These are exactly truncated-SVD inversions with hard spectral cut-off (Burns et al., 2018).

4. Regularization, diagnostics, and error structure

A defining feature of the closed-form implementation is that truncation is not treated as a purely formal spectral step. It is tied to residual diagnostics after the $f$4 rotation. The paper proposes four diagnostics: a Morozov-type discrepancy criterion, normality of residuals by histogram and chi-square goodness-of-fit, a cumulative periodogram within $f$5 Kolmogorov–Smirnov confidence bands, and heuristic exclusion of isolated high-frequency coefficients that pass the threshold but degrade the estimate (Burns et al., 2018).

The discrepancy principle is stated in the whitened variables as

$f$6

Because the residual should behave like white noise under the model, the normality and periodogram checks supply an operational criterion for whether the retained modes have captured the signal while leaving the noise in the residual (Burns et al., 2018).

The regularization is equivalent to TSVD on the underlying operator. In the explicit singular systems, the filter factors are

$f$7

The paper contrasts this with a Tikhonov filter, for which the factor is described as

$f$8

This distinction is central: the Jansson construction uses a hard cut-off rather than continuous damping (Burns et al., 2018).

From the SVD viewpoint, if $f$9 denotes $y_i = h(x_i) + \epsilon_i,$0 or $y_i = h(x_i) + \epsilon_i,$1 and $y_i = h(x_i) + \epsilon_i,$2 with $y_i = h(x_i) + \epsilon_i,$3, the TSVD error satisfies

$y_i = h(x_i) + \epsilon_i,$4

If $y_i = h(x_i) + \epsilon_i,$5 and $y_i = h(x_i) + \epsilon_i,$6, then the bias decays like $y_i = h(x_i) + \epsilon_i,$7 and the variance grows like $y_i = h(x_i) + \epsilon_i,$8. Balancing yields

$y_i = h(x_i) + \epsilon_i,$9

The paper interprets this as showing that higher $E[\epsilon]=0$0 makes inversion more ill-posed, because the Abel singular values decay as $E[\epsilon]=0$1 (Burns et al., 2018).

5. Direct differentiation and fractional generalization

The method is not restricted to recovering $E[\epsilon]=0$2 from antiderivative data. When the measured quantity is $E[\epsilon]=0$3 itself, the paper proposes a decoupled route: regularize $E[\epsilon]=0$4 by a low-degree orthogonal expansion and then differentiate or apply fractional operators analytically (Burns et al., 2018).

For this mode, one chooses $E[\epsilon]=0$5 as Legendre or Jacobi polynomials on $E[\epsilon]=0$6, or sines and cosines on $E[\epsilon]=0$7 or periodic domains, and computes

$E[\epsilon]=0$8

with coefficients from weighted least squares or interpolation on the signal subspace determined by the thresholded coefficients. The derivative is then

$E[\epsilon]=0$9

For Jacobi polynomials, the identity used is

$$\operatorname{Cov}(\epsilon)=S^2=\operatorname{diag}(s_1^2,\ldots,s_m^2)$$0

In the trigonometric SVD basis on $$\operatorname{Cov}(\epsilon)=S^2=\operatorname{diag}(s_1^2,\ldots,s_m^2)$$1, the derivative identities are

$$\operatorname{Cov}(\epsilon)=S^2=\operatorname{diag}(s_1^2,\ldots,s_m^2)$$2

$$\operatorname{Cov}(\epsilon)=S^2=\operatorname{diag}(s_1^2,\ldots,s_m^2)$$3

so that if $$\operatorname{Cov}(\epsilon)=S^2=\operatorname{diag}(s_1^2,\ldots,s_m^2)$$4 then the inversion formula produces

$$\operatorname{Cov}(\epsilon)=S^2=\operatorname{diag}(s_1^2,\ldots,s_m^2)$$5

with $$\operatorname{Cov}(\epsilon)=S^2=\operatorname{diag}(s_1^2,\ldots,s_m^2)$$6 (Burns et al., 2018).

For fractional derivatives with $$\operatorname{Cov}(\epsilon)=S^2=\operatorname{diag}(s_1^2,\ldots,s_m^2)$$7, the paper gives two routes. In the inversion route, one interprets the measurement as $$\operatorname{Cov}(\epsilon)=S^2=\operatorname{diag}(s_1^2,\ldots,s_m^2)$$8 and computes

$$\operatorname{Cov}(\epsilon)=S^2=\operatorname{diag}(s_1^2,\ldots,s_m^2)$$9

or its collocation/QR version. In the decoupled route, one expands $g$00 in a Jacobi basis and applies known fractional operators termwise whenever closed-form RL or Caputo actions are available. The paper states that, in its examples, the inversion route with the Abel SVD was emphasized (Burns et al., 2018).

This generalization is described explicitly as a principled extension of Jansson’s method from $g$01 to $g$02. The central change is to replace the ordinary integration operator $g$03 by the fractional operator $g$04 and then use its closed-form SVD to estimate $g$05 by TSVD (Burns et al., 2018).

6. Practical behavior, limitations, and distinct later usages

The experimental summaries in (Burns et al., 2018) characterize the method as producing short closed-form sums for both the regularized data and the recovered source. In the Craig–Brown example on $g$06, the method retained $g$07–$g$08 low-frequency modes out of $g$09; the residual energy satisfied the discrepancy bounds, and the cumulative periodogram fell within $g$10 white-noise bands. In a polynomial example where $g$11 itself was measured, a $g$12-term Legendre expansion sufficed to recover $g$13 and $g$14 accurately. In the fractional example with $g$15 and $g$16 on $g$17, only $g$18 modes were needed to recover $g$19 to graphical accuracy, while QR stabilized Jacobi collocation up to approximately $g$20 columns, with the chosen $g$21 remaining well below the instability threshold (Burns et al., 2018).

The practical considerations stated in the paper are closely tied to the bases and operators. For $g$22 on $g$23, $g$24 aligns with $g$25, while $g$26 implies possible edge effects at $g$27. For $g$28, the boundary condition $g$29 is required, and the $g$30 are not differentiable at $g$31 when $g$32, matching the Abel kernel’s endpoint behavior. The nodes need not be uniform, because the matrix $g$33 is evaluated directly at the data sites; orthogonality is continuous, but QR stabilizes the discrete system. The paper also states that the $g$34 scaling is essential for heteroscedasticity and that robust variants such as Huber weights could be incorporated (Burns et al., 2018).

The listed limitations include conditioning of $g$35 for very high degrees, especially in Jacobi bases; possible boundary artifacts when the basis enforces endpoint zeros; sensitivity of $g$36 and hence $g$37; and vulnerability to outliers or non-Gaussian noise. The extensions named in the paper are adaptive or localized bases, Bayesian priors on coefficients, multidimensional generalizations using separable polynomial or trigonometric bases, and Tikhonov or GSVD filters in place of hard truncation (Burns et al., 2018).

The term’s later appearances in the supplied corpus point to different mathematical settings. "Derivative of the Jacobi polynomials with respect to their order and applications to indefinite integration" (Schulze-Halberg, 26 Jun 2026) derives explicit formulas for $g$38 and uses a Wronskian integral formula based on parameter derivatives; it states that the name “Jansson Derivative Method” is not used in the paper and that, if encountered elsewhere, it corresponds there to the same parameter-derivative/Wronskian approach. "A method to compute derivatives of functions of large complex matrices" (Puhr et al., 2016) presents a block-matrix Fréchet-derivative method due to Mathias, combined with Krylov approximations and generalized deflation, and likewise states that it does not use or mention the term. This suggests that the stable encyclopedic identification of the Jansson derivative method remains the TSVD differentiation framework of (Burns et al., 2018), while other uses are naming variants external to those papers rather than established internal terminology.