Divergence-free and curl-free moving least squares approximations

This paper presents a vector-valued moving least squares (MLS) approximation for reconstructing vector fields that are divergence-free or curl-free. The proposed method constructs analytically divergence-free or curl-free shape functions by applying appropriate differential operators to a stream (potential) function approximated using the MLS method. The procedure involves solving a sparse linear least squares problem, for which the Conjugate Gradient Least Squares (CGLS) algorithm is employed to reduce computational costs compared to the direct solvers. The approach relies solely on a set of scattered nodes in the computational domain and requires no background triangulation. We provide error bounds for the approximation and support the theoretical bounds with numerical experiments. Additionally, we demonstrate the application of the divergence-free MLS approximation to the numerical solution of Darcy's flow equations.

Authors

Publication Details

Journal
Journal of Computational and Applied Mathematics
Published
2026-01-03
DOI
https://doi.org/10.1016/j.cam.2026.117338
Primary Topic
Model Reduction and Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Divergence-free and curl-free moving least squares approximations

Davoud Mirzaei, Vahid Mohammadi
Journal of Computational and Applied Mathematics
Model Reduction and Neural Networks
article

Divergence-free and curl-free moving least squares approximations

Davoud Mirzaei, Vahid Mohammadi
article en

Abstract

This paper presents a vector-valued moving least squares (MLS) approximation for reconstructing vector fields that are divergence-free or curl-free. The proposed method constructs analytically divergence-free or curl-free shape functions by applying appropriate differential operators to a stream (potential) function approximated using the MLS method. The procedure involves solving a sparse linear least squares problem, for which the Conjugate Gradient Least Squares (CGLS) algorithm is employed to reduce computational costs compared to the direct solvers. The approach relies solely on a set of scattered nodes in the computational domain and requires no background triangulation. We provide error bounds for the approximation and support the theoretical bounds with numerical experiments. Additionally, we demonstrate the application of the divergence-free MLS approximation to the numerical solution of Darcy's flow equations.

Journal of Computational and Applied MathematicsVol. 482
Openalex Percentile: Top 97%
Model Reduction and Neural Networks
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.