Results 201 to 210 of about 18,097 (230)

Adaptive Moving Least Square Approximations and Its Application

AIP Conference Proceedings, 2010
In Moving Least Square approximation, the nodal connectivity varies from point to point depending upon the domain of influence. Widely accepted rules about how to choose radius of influence do not exist. Since radius of influence will greatly effect the numerical accuracy, especially for high gradient and fast oscillatory problem.
Yuan Zhanbin, Nie Yufeng, Ouyang Jie, Jane W. Z. Lu, Andrew Y. T. Leung, Vai Pan Iu, Kai Meng Mok   +6 more
openaire   +1 more source

Virtual boundary meshless least square integral method with moving least squares approximation for 2D elastic problem

Engineering Analysis With Boundary Elements, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dong-Sheng Yang
exaly   +2 more sources

Numerical investigation on the transport equation in spherical coordinates via generalized moving least squares and moving kriging least squares approximations

Engineering with Computers, 2019
The main aim of this paper is to present new and simple numerical methods for solving the time-dependent transport equation on the sphere in spherical coordinates. We use two techniques, namely generalized moving least squares and moving kriging least squares to find the new formulations for approximating the advection operator in spherical coordinates
Vahid Mohammadi, Mehdi Dehghan 0002, Amirreza Khodadadian, Thomas Wick   +3 more
openaire   +1 more source

Error Estimates in Sobolev Spaces for Moving Least Square Approximations

SIAM Journal on Numerical Analysis, 2001
Let \(\Omega\) be a convex set in \(\mathbb{R}^N\) and let \(\xi_{1}, \xi_{2},\dots,\xi_{n}\) be given points in \(\Omega\). Furthermore let \(\Phi_{R}\) be a function with values in \([0,1]\) and support in the ball \(\{ z|\|z\|\leq R \}\). Denote by \(\mathcal{P}_{m}\) the set of polynomials of degree \(m\) or less and \(s\) its dimension. Let \(p_{1}
openaire   +1 more source

Error estimates for moving least square approximations

Bulletin of the Brazilian Mathematical Society, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Complex variable moving least‐squares method: a meshless approximation technique

International Journal for Numerical Methods in Engineering, 2006
AbstractBased on the moving least‐squares (MLS) approximation, we propose a new approximation method—the complex variable moving least‐squares (CVMLS) approximation. With the CVMLS approximation, the trial function of a two‐dimensional problem is formed with a one‐dimensional basis function.
Liew, K. M., Feng, Cong, Cheng, Yumin, Kitipornchai, S.   +3 more
openaire   +3 more sources

Local integration of population dynamics via moving least squares approximation

Engineering with Computers, 2015
This paper applies an approach based on the Galerkin and collocation methods so-called meshless local Petrov---Galerkin (MLPG) method to treat a nonlinear partial integro-differential equation arising in population dynamics. In the proposed method, the MLPG method is applied to the interior nodes while the meshless collocation method is used for the ...
openaire   +1 more source

Hybrid model of moving Least-Square Approximation in wireless networks

2010 International Conference on Computer Application and System Modeling (ICCASM 2010), 2010
An adaptive handover algorithm for wireless communication systems is addressed in this paper. Moving from the Generalized Extended Least Square handover algorithm proposed in [1], we model the handover mechanism as a hybrid system, and we include it in a dynamic optimization problem which is solved through the use of a trellis diagram.
null Jie Liu, null Tao Zhang, null Xiao-Lin Yang, null Bin Zhou, Wei Wei   +4 more
exaly   +2 more sources

Approximate Moving Least-Squares Approximation with Compactly Supported Radial Weights

2003
We use Maz’ya and Schmidt’s theory of approximate approximation to devise a fast and accurate approximate moving least-squares approximation method which does not require the solution of any linear systems. Since we use compactly supported weight functions, the remaining summation is also efficient.
openaire   +1 more source

Direct approximation on spheres using generalized moving least squares

BIT Numerical Mathematics, 2017
This paper presents a moving square method on the sphere of \(\mathbb R^d\) that differs from the classical one considering a different approach -- the so-called direct approach. Let \(X\) be the set of points in the sphere. The classical method is based on the approximation of a certain function \(u\) by a set of functions and requires the action of ...
openaire   +1 more source