Results 281 to 290 of about 4,063,184 (303)
Some of the next articles are maybe not open access.
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 +3 more
openaire +1 more source
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 +3 more
openaire +1 more source
Error estimates for moving least square approximations
Bulletin of the Brazilian Mathematical Society, 2003zbMATH 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, 2006AbstractBased 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. +3 more
openaire +3 more sources
Hybrid model of moving Least-Square Approximation in wireless networks
2010 International Conference on Computer Application and System Modeling (ICCASM 2010), 2010An 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 +4 more
openaire +1 more source
Engineering analysis with boundary elements, 2023
Hasan Zamani-Gharaghoshi +2 more
semanticscholar +1 more source
Hasan Zamani-Gharaghoshi +2 more
semanticscholar +1 more source
Engineering Analysis with Boundary Elements, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Dong-Sheng, Xu, Qiang
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yang, Dong-Sheng, Xu, Qiang
openaire +1 more source
International Journal of Computational Mathematics
In this study, we propose a moving least squares approximation with shifted Chebyshev polynomials to solve linear and nonlinear third-kind Volterra delay integral equations (VDIEs).
E. Aourir, N. Izem, H. L. Dastjerdi
semanticscholar +1 more source
In this study, we propose a moving least squares approximation with shifted Chebyshev polynomials to solve linear and nonlinear third-kind Volterra delay integral equations (VDIEs).
E. Aourir, N. Izem, H. L. Dastjerdi
semanticscholar +1 more source
Approximate Moving Least-Squares Approximation with Compactly Supported Radial Weights
2003We 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
Good quality point sets and error estimates for moving least square approximations
Applied Numerical Mathematics, 2003The author discusses the construction of moving least square approximations. Error estimates in Sobolev spaces are given. It is discussed that the condition number of the star of nodes could be used as a good measure for the quality of the distribution of the nodes and patches.
openaire +2 more sources

