Local polynomial regression and filtering for a versatile meshfree PDE solver

A high-order, meshfree finite difference method for solving partial differential equations is presented. The spatial domain is sampled by an irregular point cloud, and at each point a local polynomial approximation is formulated. This polynomial is used to approximate both function and its derivatives. The function approximation is used as a filter to regularise the solution and ensure stability of the method.<br/><br/>The local polynomial is obtained by straightforward least squares minimisation, which is solved by using the singular value decomposition method, with truncation. A non-parametric regression with robust M-estimator functions is also investigated and exhibits additional robustness and accuracy. A straightforward semi-discrete form is obtained by adopting an explicit time discretisation, and combined with the local polynomial regression, a modular assembly of complete solver algorithms is possible.<br/><br/>The resulting numerical method is accurate, simple and versatile. Challenging numerical benchmark tests are investigated, namely the solution to inviscid Burgers' equation, linearised Euler equations and incompressible Navier-Stokes equations (with the artificial compressibility and vorticity transport formulations) in Eulerian and Lagrangian reference frames.

Authors

Publication Details

Journal
Bristol Research (University of Bristol)
Published
2026-02-05
Primary Topic
Numerical methods in engineering
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Local polynomial regression and filtering for a versatile meshfree PDE solver

Alberto M Gambaruto
Bristol Research (University of Bristol)
Numerical methods in engineering
article

Local polynomial regression and filtering for a versatile meshfree PDE solver

Alberto M Gambaruto
article en

Abstract

A high-order, meshfree finite difference method for solving partial differential equations is presented. The spatial domain is sampled by an irregular point cloud, and at each point a local polynomial approximation is formulated. This polynomial is used to approximate both function and its derivatives. The function approximation is used as a filter to regularise the solution and ensure stability of the method.<br/><br/>The local polynomial is obtained by straightforward least squares minimisation, which is solved by using the singular value decomposition method, with truncation. A non-parametric regression with robust M-estimator functions is also investigated and exhibits additional robustness and accuracy. A straightforward semi-discrete form is obtained by adopting an explicit time discretisation, and combined with the local polynomial regression, a modular assembly of complete solver algorithms is possible.<br/><br/>The resulting numerical method is accurate, simple and versatile. Challenging numerical benchmark tests are investigated, namely the solution to inviscid Burgers' equation, linearised Euler equations and incompressible Navier-Stokes equations (with the artificial compressibility and vorticity transport formulations) in Eulerian and Lagrangian reference frames.

Bristol Research (University of Bristol)
Openalex Percentile: Top 54%
Numerical methods in engineering
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Local polynomial regression and filtering for a versatile meshfree PDE solver — Alberto M Gambaruto · Bristol Research (University of Bristol) (2026) | TGRS Research Map | TGRS