• Source: Moving least squares

Moving least squares is a method of reconstructing continuous functions from a set of unorganized point samples via the calculation of a weighted least squares measure biased towards the region around the point at which the reconstructed value is requested.
In computer graphics, the moving least squares method is useful for reconstructing a surface from a set of points. Often it is used to create a 3D surface from a point cloud through either downsampling or upsampling.
In numerical analysis to handle contributions of geometry where it is difficult to obtain discretizations, the moving least squares methods have also been used and generalized to solve PDEs on curved surfaces and other geometries. This includes numerical methods developed for curved surfaces for solving scalar parabolic PDEs and vector-valued hydrodynamic PDEs.
In machine learning, moving least squares methods have also been used to develop model classes and learning methods. This includes function regression methods and neural network function and operator regression approaches, such as GMLS-Nets.




Definition



Consider a function



f
:


R


n


→

R



{\displaystyle f:\mathbb {R} ^{n}\to \mathbb {R} }

and a set of sample points



S
=
{
(

x

i


,

f

i


)

|

f
(

x

i


)
=

f

i


}


{\displaystyle S=\{(x_{i},f_{i})|f(x_{i})=f_{i}\}}

. Then, the moving least square approximation of degree



m


{\displaystyle m}

at the point



x


{\displaystyle x}

is






p
~



(
x
)


{\displaystyle {\tilde {p}}(x)}

where






p
~





{\displaystyle {\tilde {p}}}

minimizes the weighted least-square error





∑

i
∈
I


(
p
(

x

i


)
−

f

i



)

2


θ
(
‖
x
−

x

i


‖
)


{\displaystyle \sum _{i\in I}(p(x_{i})-f_{i})^{2}\theta (\|x-x_{i}\|)}


over all polynomials



p


{\displaystyle p}

of degree



m


{\displaystyle m}

in





R


n




{\displaystyle \mathbb {R} ^{n}}

.



θ
(
s
)


{\displaystyle \theta (s)}

is the weight and it tends to zero as



s
→
∞


{\displaystyle s\to \infty }

.
In the example



θ
(
s
)
=

e

−

s

2






{\displaystyle \theta (s)=e^{-s^{2}}}

. The smooth interpolator of "order 3" is a quadratic interpolator.




See also


Local regression
Diffuse element method
Moving average




References



The approximation power of moving least squares David Levin, Mathematics of Computation, Volume 67, 1517-1531, 1998 [1]
Moving least squares response surface approximation: Formulation and metal forming applications Piotr Breitkopf; Hakim Naceur; Alain Rassineux; Pierre Villon, Computers and Structures, Volume 83, 17-18, 2005.
Generalizing the finite element method: diffuse approximation and diffuse elements, B Nayroles, G Touzot. Pierre Villon, P, Computational Mechanics Volume 10, pp 307-318, 1992




External links


An As-Short-As-Possible Introduction to the Least Squares, Weighted Least Squares and Moving Least Squares Methods for Scattered Data Approximation and Interpolation

Kata Kunci Pencarian:

• Analitik prediktif
• Moving least squares
• Local regression
• Moving average
• Levenberg–Marquardt algorithm
• List of statistics articles
• Discrete least squares meshless method
• Potential energy surface
• Multidisciplinary design optimization
• Meshfree methods
• Finite pointset method