VIEW THIS AS

Auto mode follows the Route Engine until you choose a viewpoint.

YOU ARE HERE

ROUTE CHECK

CONNECTED TO

WHAT NEXT

Use the canonical route for this room, or HELP if you are unsure.

The Gold Standard of Radial Basis Function Finite Differences

Three students in school uniforms work through open books at a classroom table, with textbooks and stationery nearby and study notes on the whiteboard behind them.

Radial basis function finite differences, usually called RBF-FD, approximate a derivative by a weighted sum of nearby function values. The weights come from a small radial basis interpolation problem, often augmented with polynomials. Repeating that construction at many locations produces a sparse operator for a differential equation. A dependable calculation checks the local weights, point geometry, boundary equations and complete solution separately.

This guide explains those checks through original calculations: an eight-equation stencil system, a boundary-value problem with an exact reference, a noise calculation and a diffusion stability test. The examples show why five points do not automatically mean fourth-order accuracy, why a small residual can accompany a wrong solution, and why stable time evolution need not preserve nonnegative values. All numerical cases below are teaching models with stated assumptions.

CHAPTER 1 OF 14 · Understand fields, interpolation and weights

1. Separate the field, the stencil and the operator

Back to contents

Imagine a temperature field sampled at irregular positions. A value tells you how hot one location is. A first derivative describes a rate of spatial change. A second derivative describes how that slope changes. A heat equation uses derivatives to connect the present field with its subsequent evolution. These are different outputs, even when they begin with the same numbers.

A stencil is the selected group of source locations used for one calculation. The target is where the derivative is wanted. They need not be identical sets: the target may be one of the source nodes, but a method can also evaluate derivatives elsewhere. Record which situation applies before assembling any matrix.

Write the intended approximation as Lf(x*) ≈ Σ wⱼf(xⱼ). Here L is a specified linear differential operator, x* is the target, xⱼ are stencil locations and wⱼ are differentiation weights. The weights depend on geometry, approximation choices and L. They do not depend on the particular values of f when those choices are fixed.

That last distinction explains the computational attraction. Once a stencil has been built, the same row can differentiate many fields or successive states of a simulation. If the nodes move, the geometry changes and the old weights generally need rebuilding. A cached row is reusable only while its defining conditions remain valid.

A local method still has global responsibilities

RBF-FD uses small interpolation problems to construct rows. It does not require one global radial expansion with a coefficient for every node. This differs from the global collocation approach introduced in the RBF collocation specialist article.

Nevertheless, a PDE solution couples those local rows. Boundary conditions, nullspaces, stability and conservation belong to that assembled problem. Local solvability alone cannot settle them. Start a project with two written questions: what should each row reproduce, and what should the complete solution satisfy?

For N targets and at most n source weights per row, the assembled differentiation matrix has at most Nn stored contributions before combining duplicates or removing zeros. With 100,000 targets and thirty-point stencils, that is three million contributions, compared with ten billion entries in a dense square matrix. This arithmetic explains the benefit of locality. It is not a runtime prediction: neighbour searches, small matrix factorizations, sparse solver fill-in and preconditioning also consume resources. Measure construction time and solution time separately when comparing implementations.

Contents · Next chapter

CHAPTER 2 OF 14 · Understand fields, interpolation and weights

2. Build the local interpolant before differentiating it

Back to contents

For one stencil, consider s(x)=Σ aⱼφ(||x−xⱼ||)+Σ bₖpₖ(x). The radial functions are centred at the source nodes. The pₖ form a chosen polynomial basis. The coefficients a and b are determined by matching the stencil values and imposing polynomial side conditions.

Define Kᵢⱼ=φ(||xᵢ−xⱼ||) and Pᵢₖ=pₖ(xᵢ). With zero smoothing, the interpolation equations are Ka+Pb=f and Pᵀa=0. Together they form a block system whose top row is [K P] and bottom row is [Pᵀ 0]. The right-hand side is the data vector followed by zeros.

The zero block does not mean the polynomial coefficients vanish. It expresses the side conditions on a. Confusing the two gives a different system. Equally, aⱼ is not generally f(xⱼ): each radial basis function contributes at several nodes, so interpolation requires a coupled solve.

The SciPy RBFInterpolator reference documents this augmented interpolation structure and its solvability conditions. It identifies distinct data locations, full column rank of P and kernel-appropriate polynomial degree as relevant requirements. Its routine is an interpolation interface; the documentation does not make every interpolant into a validated PDE solver.

Choose a concrete kernel

Our main calculation uses the cubic polyharmonic spline φ(r)=r³ and polynomials 1, x and x² in one dimension. The second derivative of |x−c|³ is 6|x−c|, including the continuous value zero at x=c. This makes the operator right-hand side easy to calculate exactly.

This kernel has no Gaussian-style width to optimise in the zero-smoothing construction used here. That removes one choice, not every choice. Polynomial degree, stencil size, spatial scale and node geometry still matter. We deliberately specify all four rather than treating “cubic” as a complete numerical method.

Previous chapter · Contents · Next chapter

CHAPTER 3 OF 14 · Understand fields, interpolation and weights

3. Obtain weights by solving the dual system

Back to contents

One approach would interpolate every new data vector and then differentiate the resulting function. A more economical approach calculates the linear combination of data values that gives the same derivative. That combination is the RBF-FD weight vector.

Let ℓⱼ be L applied to the radial function centred at xⱼ, evaluated at x*. Let qₖ=Lpₖ(x*). For the symmetric block system above, solve Kw+Pμ=ℓ together with Pᵀw=q. The auxiliary vector μ enforces the polynomial constraints; it is not another set of data weights.

The derivation is short enough to check. Multiply Kw+Pμ=ℓ by aᵀ. Since Pᵀa=0, this gives aᵀKw=aᵀℓ. Also bᵀPᵀw=bᵀq. Adding the identities yields wᵀ(Ka+Pb)=ℓᵀa+qᵀb=Ls(x*). Because Ka+Pb=f, the desired result is wᵀf.

Which variable is differentiated?

Differentiate with respect to the evaluation coordinate x before setting x=x*. Do not differentiate with respect to the centre coordinate by accident. Odd derivatives change sign when the wrong coordinate is used. Even derivatives can conceal that mistake because two sign changes cancel.

For a second derivative with basis 1, x, x², q=(0,0,2). Therefore the weights must satisfy Σwⱼ=0, Σwⱼxⱼ=0 and Σwⱼxⱼ²=2. These are immediate tests on the computed row, independent of any PDE solution.

The RBF package differentiation documentation distinguishes target points, source points, stencil size, derivative multi-indices and polynomial order. Those distinctions are worth retaining in your own implementation record. A returned array of plausible numbers is difficult to audit if its target and source ordering have been lost.

Previous chapter · Contents · Next chapter

CHAPTER 4 OF 14 · Calculate stencils and check geometry

4. Solve a five-point cubic-PHS stencil completely

Back to contents

Use dimensionless nodes −2, −1, 0, 1, 2, target zero, kernel r³ and polynomial degree two. There are five weights and three auxiliary unknowns, giving eight equations. The five rows of K are (0,1,8,27,64), (1,0,1,8,27), (8,1,0,1,8), (27,8,1,0,1) and (64,27,8,1,0).

The corresponding rows of P are (1,−2,4), (1,−1,1), (1,0,0), (1,1,1) and (1,2,4). The radial right-hand side is ℓ=(12,6,0,6,12), because the second derivative is 6 times distance from the target. The polynomial right-hand side remains (0,0,2).

Solving gives w=(−3/8, 5/2, −17/4, 5/2, −3/8) and μ=(1,0,−1/4). These fractions are the full answer for this declared construction. A different polynomial degree or node set need not produce the same row.

Check the equations by substitution

At the central radial row, Kw=8(−3/8)+5/2+5/2+8(−3/8)=−1. The polynomial contribution there is μ₀=1. Their sum is zero, matching the central entry of ℓ.

At the leftmost row, Kw=5/2+8(−17/4)+27(5/2)+64(−3/8)=12. The polynomial contribution is 1+4(−1/4)=0. The total is twelve, as required. Symmetry supplies the matching rightmost check.

The weights sum to zero. Their first moment is zero by symmetry. Their second moment is 8(−3/8)+2(5/2)=2. Thus constants and straight lines produce zero curvature, while x² produces two.

Now apply the same row to x⁴. The answer is 32(−3/8)+2(5/2)=−7, although the exact second derivative at zero is zero. This is not a failed linear solve. It is approximation error outside the reproduced polynomial space, and it will become a useful refinement test.

Previous chapter · Contents · Next chapter

CHAPTER 5 OF 14 · Calculate stencils and check geometry

5. Polynomial degree changes what five nodes can promise

Back to contents

Replace the polynomial basis by 1, x, x², x³, x⁴ while retaining five distinct one-dimensional nodes. The polynomial matrix is now square and invertible. The conditions Pᵀw=q determine the weights completely, leaving no freedom for the radial equations to choose a different row.

At the symmetric nodes of chapter four, the result becomes w=(−1/12, 4/3, −5/2, 4/3, −1/12). It differentiates every polynomial through degree four exactly. Symmetry also cancels odd powers at the central target. The earlier cubic-PHS, degree-two row does not have this property merely because it uses the same number of nodes.

On physical nodes −2h, −h, 0, h, 2h, divide these weights by h². Applying the degree-two row to x⁴ gives −7h². Applying the degree-four row to x⁴ gives zero. Applying the degree-four row to x⁶ gives −8h⁴, while the exact central second derivative is again zero.

For a sufficiently smooth function, these moments give leading central errors −(7/24)h²f⁽⁴⁾(0) for the first row and −(1/90)h⁴f⁽⁶⁾(0) for the second. These are statements about the specified symmetric stencil, not all scattered-node arrangements.

Why retain radial functions at all?

Practical multidimensional stencils commonly have more nodes than polynomial basis terms. Polynomial exactness then leaves freedom that the radial equations resolve. A square, polynomial-determined teaching example is useful for understanding the limiting case; it does not describe every working RBF-FD construction.

Flyer, Fornberg, Bayona and Barnett’s primary study investigates polynomial augmentation with polyharmonic splines and its effect on interpolation and derivative accuracy. It supports treating polynomial degree as a central design choice. It does not justify choosing the highest possible degree without examining geometry, numerical sensitivity and the final PDE problem.

Previous chapter · Contents · Next chapter

CHAPTER 6 OF 14 · Calculate stencils and check geometry

6. Count polynomial terms, then inspect geometry

Back to contents

In two dimensions, total degree two includes six terms: 1, x, y, x², xy and y². Total degree three includes ten. In three dimensions, total degree two includes ten. In general, total degree p in d dimensions has binomial(p+d,d) terms. This is a necessary counting check before constructing a full polynomial basis.

Having enough nodes is not sufficient. The polynomial evaluation matrix must distinguish all those terms on the selected geometry. If a nonzero polynomial in the chosen space vanishes at every stencil node, its coefficients cannot be identified from those samples.

A failure that is not collinearity

Place six or more distinct nodes on the unit circle. They may be well spread around the target and certainly need not lie on a straight line. Nevertheless, x²+y²−1 vanishes at every node. The columns for 1, x² and y² therefore satisfy a linear dependence. Full quadratic augmentation is rank-deficient.

Adding more points on exactly the same circle does not remove that dependence. Add an appropriately positioned off-circle node or redesign the stencil, then check rank again. A large neighbour count can repeat the same missing information rather than repair it.

Nearly circular arrangements can create numerical sensitivity without exact singularity. Similarly, points packed into a thin strip may poorly resolve changes across the strip. Plotting the stencil around its target and inspecting singular values of a scaled P makes those problems easier to interpret.

Nearest-neighbour selection is a convenient starting rule, not a guarantee of a suitable domain stencil. Points across a narrow obstacle can be close in Euclidean distance while belonging to a different side of the physical problem. Nodes at interfaces may require separate treatment. Preserve the domain’s connectivity and boundary meaning when deciding which values may inform one derivative.

Previous chapter · Contents · Next chapter

CHAPTER 7 OF 14 · Scale and solve boundary problems

7. Scale coordinates and transform the operator

Back to contents

Let ξ=(x−x*)/h for a positive local length h. A derivative with respect to x then satisfies d/dx=(1/h)d/dξ, and a second derivative satisfies d²/dx²=(1/h²)d²/dξ². If you solve for dimensionless second-derivative weights, divide the resulting row by h² before applying it to physical data.

For chapter four with h=0.1 metres, the physical weights are (−37.5,250,−425,250,−37.5) per square metre. If the field is measured in kelvins, the result has units kelvins per square metre. The large-looking coefficients are partly the necessary effect of differentiating over a short length.

Re-centering and scaling can make the polynomial columns easier to compare. It does not add information or repair a truly rank-deficient node arrangement. Scaling changes numerical representation; geometric degeneracy concerns what the samples can distinguish.

Uniform and directional scaling are different

If ξ=x/Lx and η=y/Ly, then the physical Laplacian is Lx⁻²∂²/∂ξ²+Ly⁻²∂²/∂η². It is not a single multiple of the dimensionless Laplacian unless the two length scales agree. Rescaling each coordinate independently while leaving the operator unchanged solves a different physical problem.

For kernels containing a shape parameter, record its convention too. In exp(−(εr)²), ε has inverse-length units when r is physical length. Re-expressing distances in another unit requires a corresponding numerical change in ε if the same kernel is intended.

For our zero-smoothing cubic-PHS calculation, a uniform distance scaling changes r³ by a common cubic factor. The appropriately transformed operator and polynomial equations preserve the intended physical weights after the chain rule is applied. This useful scale behaviour does not make arbitrary anisotropic coordinate changes physically neutral.

Previous chapter · Contents · Next chapter

CHAPTER 8 OF 14 · Scale and solve boundary problems

8. Assemble and solve a boundary-value problem

Back to contents

Consider −u″(x)=f(x) on 0<x<1 with u(0)=u(1)=0. Choose the exact reference u(x)=x²(1−x)², so f(x)=−2+12x−12x². Use nodes 0, 1/4, 1/2, 3/4 and 1. For this small demonstration, each interior target uses all five nodes, cubic PHS and degree-two polynomials.

Use the coordinate t=4x−2. The nodes become −2,−1,0,1,2. At target t=−1, the dimensionless second-derivative weights are (3/2,−7/2,5/2,−1/2,0). At zero they are the chapter-four weights. At t=1 they are (0,−1/2,5/2,−7/2,3/2). Multiply each by sixteen to recover derivatives with respect to x.

After negating for −u″ and eliminating the known boundary values, the three interior rows are (56,−40,8), (−40,68,−40) and (8,−40,56). The right-hand side is (1/4,1,1/4). This completely specifies the small linear system.

Symmetry gives equal outer unknowns a and a middle unknown b. The equations reduce to 64a−40b=1/4 and −80a+68b=1. Solving gives a=19/384 and b=7/96. Substitute them back: the first equation gives 1/4 and the second gives one.

A perfect algebraic residual is not a perfect field

The exact nodal values are (9/256,1/16,9/256). Therefore the outer errors are 11/768 and the middle error is 1/96. The numerical equations can be solved exactly while their solution differs from the continuous reference. That is discretization error, exposed by an independent known solution.

If we instead reproduce degree-four polynomials on these same five nodes, the quartic reference is differentiated exactly. With the specified boundary values, its nodal values satisfy the resulting system. This improvement follows from the changed approximation space, not from a tighter solver tolerance or a prettier plot.

Previous chapter · Contents · Next chapter

CHAPTER 9 OF 14 · Scale and solve boundary problems

9. Boundaries change rows, signs and solvability

Back to contents

A prescribed value, or Dirichlet condition, supplies a value equation. If the boundary node itself is an unknown, that row can simply set its component to the specified value. If the boundary values are eliminated, their contributions move to the interior right-hand side with the appropriate sign.

For the first interior row in chapter eight, before imposing zero boundaries, the full equation is −24u₀+56u₁−40u₂+8u₃+0u₄=f₁. If u₀=g₀, the reduced right-hand side becomes f₁+24g₀. A forgotten boundary contribution changes the problem even when the reduced solver reports success.

A prescribed normal derivative requires derivative weights and an oriented unit normal. On the interval [0,1], the outward normal derivative is −u′(0) on the left and +u′(1) on the right. Reusing the same derivative sign at both ends confuses a coordinate derivative with an outward flux convention.

Pure Neumann data require another check

For −u″=f with outward derivatives g₀=−u′(0) and g₁=u′(1), integration gives ∫₀¹f(x)dx=−g₀−g₁. This compatibility condition is part of the continuous problem. If it fails, demanding both boundary fluxes and the source distribution is inconsistent.

Even when compatibility holds, adding a constant to u leaves both its second derivative and its boundary derivatives unchanged. A mean value or another reference condition is needed to fix that constant. A numerical singularity can therefore reflect genuine nonuniqueness, not defective software.

Boundary stencils also lose the symmetry available in the interior. Degree-two reproduction ensures the required quadratic moments, but it does not force cubic errors to cancel on a one-sided arrangement. Inspect boundary-adjacent errors separately. A good central stencil cannot certify the quality of rows that have different neighbours and different geometric support.

Previous chapter · Contents · Next chapter

CHAPTER 10 OF 14 · Test convergence, noise and stability

10. Measure convergence without confusing three errors

Back to contents

There are at least three numerical questions: how accurately the small weight system was solved, how accurately the assembled PDE equations were solved, and how closely the numerical field approximates the intended continuous solution. Small residuals answer the first two questions. They do not automatically answer the third.

A useful verification sequence begins with polynomial tests on individual rows. It then uses a manufactured solution: choose a smooth u, derive its source and boundary data analytically, solve the numerical problem and compare against that known u. Chapter eight shows every part of this process on a manageable system.

For refinement, keep the physical problem fixed while decreasing node spacing. State how stencil size, polynomial degree and node quality change. If two errors E(h) and E(h/2) are measured in the same norm, an observed order is log₂(E(h)/E(h/2)). Two levels suggest behaviour; several levels help reveal whether it persists.

For the central degree-two row applied to x⁴, the absolute error is exactly 7h². Halving h reduces it by four. For the degree-four row applied to x⁶, the absolute error is 8h⁴ and decreases by sixteen. These controlled results are stronger than estimating a slope from an unexplained graph, but they test only these functions and stencils.

Local and global rates can differ

The global error also involves the response of the discrete inverse, boundary rows and possible cancellation of truncation errors. Do not automatically label a complete PDE solver by the central row’s polynomial degree. The primary paper A superconvergence result in the RBF-FD method studies cases where solution convergence exceeds a naive expectation from operator truncation. Such behaviour must be demonstrated under the relevant conditions; it is not a universal bonus.

Use nonpolynomial test functions as well as reproduced polynomials. Include a problem with nonzero boundary values and inspect maximum error near the boundary. A solver that passes only the functions it was constructed to reproduce has passed an essential implementation check, but still faces a limited test.

Previous chapter · Contents · Next chapter

CHAPTER 11 OF 14 · Test convergence, noise and stability

11. Noise, stability and positivity are separate properties

Back to contents

Suppose the five values used by the chapter-four row have independent, zero-mean measurement errors with variance σ². Hold the coordinates and weights fixed. The variance of the resulting second-derivative noise is σ²Σwⱼ². For physical spacing h, this is (987/32)σ²/h⁴, with standard deviation approximately 5.5537σ/h².

By comparison, the ordinary central three-point row (1,−2,1)/h² has noise standard deviation √6σ/h², approximately 2.4495σ/h² under the same assumptions. Adding nodes has increased noise amplification in this particular comparison. It has not automatically created averaging or smoothing.

If every observation error is bounded in magnitude by δ, the five-point derivative error is bounded by 10δ/h² because the absolute weights sum to ten. Both calculations concern propagated data error, excluding approximation bias and coordinate uncertainty. Halving h multiplies these derivative-noise magnitudes by four when the observation noise stays unchanged.

A complete time-step calculation

Now consider a different setting: a uniform periodic grid for uₜ=κuₓₓ, κ>0, using the chapter-four row everywhere. A Fourier mode with angle θ has spatial eigenvalue λ(θ)=[−17/4+5cosθ−(3/4)cos2θ]/h². Writing c=cosθ gives the numerator −7/2+5c−(3/2)c², ranging from −10 to zero for −1≤c≤1.

Forward Euler multiplies a mode by 1+κΔtλ. Requiring its magnitude to be at most one gives the sufficient bound Δt≤h²/(5κ). With an even periodic node count, the alternating mode reaches the lower eigenvalue and makes this bound necessary too. This is a periodic, uniform-grid result, not a rule for arbitrary scattered clouds.

Yet the update coefficients at the two far neighbours are −3κΔt/(8h²), negative for every positive time step. Nonnegative initial data concentrated at one such neighbour can therefore make the target negative after one step. Fourier stability and positivity preservation have separated in an explicit calculation. Decide which property the physical application needs before interpreting “stable” as sufficient.

Previous chapter · Contents · Next chapter

CHAPTER 12 OF 14 · Test convergence, noise and stability

12. Diagnose the failure before changing parameters

Back to contents

When a local solve is singular, first inspect duplicate points and the polynomial rank. Check the number of terms, coordinate scale and target location. The circle example in chapter six shows why simply requesting more neighbours may preserve the same failure.

When weights exist but fail a polynomial test, inspect ordering, derivative conventions and scale factors. A row computed for one ordering of sources and applied to another can look numerically reasonable while giving nonsense. Keep node identifiers alongside weights rather than relying on an undocumented array order.

When polynomial tests pass but the PDE solution is wrong, examine operator signs and boundary elimination. Apply the full assembled matrix to a known polynomial field and compare the interior and boundary residuals separately. This distinguishes an assembly error from a local formula that was constructed correctly.

Do not repair every symptom with regularization

Adding a diagonal term to an interpolation matrix changes its equations and usually its exact interpolation promise. It may be useful in an explicitly noisy-data model, but it is not an invisible repair for duplicate nodes, a wrong normal or incompatible boundary data. State what changed and repeat the relevant reproduction checks.

When refinement initially improves error and then makes it worse, inspect roundoff, weight growth and measurement noise. The noise scaling in chapter eleven supplies a concrete mechanism. Also check whether progressively finer clouds maintain reasonable separation and coverage rather than producing tight clusters next to large holes.

When a diffusion simulation grows unexpectedly, test the spatial spectrum together with the chosen time integrator, including actual boundary rows. A stable periodic calculation does not prove stability for a bounded irregular domain. For nonsymmetric systems, transient amplification can also make eigenvalues alone an incomplete description of behaviour.

Finally, keep derivative accuracy separate from conservation. Row sums of zero make constant fields stationary under a derivative operator. They do not by themselves guarantee that a spatially weighted sum of the field is conserved. Conservation requires a corresponding left-nullspace or flux balance appropriate to the physical discretization. Test the actual integral or balance that matters.

Previous chapter · Contents · Next chapter

CHAPTER 13 OF 14 · Transfer and continue learning

13. Transfer check: a stretched domain changes the calculation

Back to contents

Suppose a rectangular domain is represented by ξ=x/Lx and η=y/Ly, with Lx=2 metres and Ly=0.5 metres. A colleague generates dimensionless second-derivative rows Dξξ and Dηη and adds them, calling the result a physical Laplacian. Determine what is missing before calculating a new field.

The correct physical row is (1/4)Dξξ+4Dηη, with the length factors carrying inverse-square-metre units. The two directions require different multipliers. Applying one common factor would treat the stretched coordinate system as though its axes had the same physical scale.

Test the claim using u(x,y)=x²+y², with coordinates understood in metres. Its physical Laplacian is four. In normalized coordinates, u=4ξ²+0.25η², so the two dimensionless second derivatives are eight and one half. The incorrect unweighted sum is 8.5. The correctly transformed result is (1/4)×8+4×(1/2)=4.

Change the boundary question as well

At the right boundary, the physical outward normal derivative is ∂u/∂x=(1/2)∂u/∂ξ. At the top boundary, it is ∂u/∂y=2∂u/∂η. At the left and bottom, outward orientation adds minus signs. The same scaling issue therefore affects boundary rows, not just the interior Laplacian.

Now explain the transfer in words. The stored field values have not become different observations because the coordinates were renamed. The derivative measures change per physical distance, so the chain rule must connect the new numerical coordinates to that distance. That explanation is more durable than memorising “divide weights by h squared.”

As a second exercise, change the periodic diffusion example from h=0.1 to h=0.05 while keeping κ fixed. Its Euler stability bound becomes one quarter as large. Under unchanged independent observation noise, the central curvature-noise standard deviation becomes four times as large. Finer geometry has improved some approximation errors while tightening two other constraints.

Previous chapter · Contents · Next chapter

CHAPTER 14 OF 14 · Transfer and continue learning

14. Questions, practical routes and a reproducible result

Back to contents

Is RBF-FD the same as radial basis interpolation?

It uses local radial interpolation to construct differentiation weights. The final unknowns in a typical PDE solve are field values at nodes, assembled through many local rows. A global interpolant instead solves for coefficients of one expansion. The shared kernel vocabulary does not make their computational structures identical.

Does a polyharmonic spline remove all parameter choices?

No. It can remove the width-tuning problem associated with kernels such as Gaussians in the construction discussed here. You still choose the polynomial space, node arrangement, stencil size, operator, boundary treatment and solver. Those choices determine what the numerical result means.

How many nodes should a stencil contain?

Begin by counting polynomial terms, then verify geometric rank and numerical sensitivity. There is no universal number that guarantees quality across dimensions and operators. Compare plausible stencil sizes on a fixed validation problem, recording error and cost together rather than increasing size until a plot looks smooth.

Can a small residual establish accuracy?

It establishes that the selected algebraic equations have been solved closely. Chapter eight gives a counterexample to the stronger claim: an exact algebraic solution still differs from the known continuous solution. Use manufactured solutions, refinement and independent physical checks for the broader accuracy question.

What should a beginner do first?

Reproduce the eight-equation system by hand or with exact arithmetic. Check all polynomial moments. Change only the degree from two to four and explain why the weights change. Next solve the three-unknown boundary problem and calculate both the algebraic residual and the true nodal error.

For a programming project, generate a small irregular cloud, retain explicit source identifiers, and report rank, weights and polynomial residuals for several representative stencils. Include a boundary stencil. Only then assemble a manufactured PDE problem. This sequence makes mistakes local enough to understand and repair.

For a real modelling project, state whether positivity, conservation, flux accuracy or pointwise values matter most. Select validation cases that expose those requirements. An impressive convergence rate on a smooth manufactured field does not establish performance across an interface, a corner singularity or a poorly sampled physical region.

Sources and further reading

The numerical stencils, boundary system, noise propagation and periodic stability calculations in this guide were derived and independently recomputed for these examples. They are not reported industrial benchmarks. A reproducible result should retain its nodes, kernel, polynomial basis, coordinate transformation, boundary equations, solver tolerances and validation errors together, so another reader can reconstruct both the answer and its limits.

Previous chapter · Contents · Gold Standard master