meshfree method
Recently Published Documents


TOTAL DOCUMENTS

415
(FIVE YEARS 97)

H-INDEX

34
(FIVE YEARS 5)

2022 ◽  
Vol 389 ◽  
pp. 114396
Author(s):  
Tsung-Hui Huang ◽  
Jiun-Shyan Chen ◽  
Michael R. Tupek ◽  
Frank N. Beckwith ◽  
H. Eliot Fang

2021 ◽  
pp. 244-257
Author(s):  
Wilber Vélez ◽  
Flávio Mendonça ◽  
Artur Portela

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Mehdi Dehghan ◽  
Baharak Hooshyarfarzin ◽  
Mostafa Abbaszadeh

Purpose This study aims to use the polynomial approximation method based on the Pascal polynomial basis for obtaining the numerical solutions of partial differential equations. Moreover, this method does not require establishing grids in the computational domain. Design/methodology/approach In this study, the authors present a meshfree method based on Pascal polynomial expansion for the numerical solution of the Sobolev equation. In general, Sobolev-type equations have several applications in physics and mechanical engineering. Findings The authors use the Crank-Nicolson scheme to discrete the time variable and the Pascal polynomial-based (PPB) method for discretizing the spatial variables. But it is clear that increasing the value of the final time or number of time steps, will bear a lot of costs during numerical simulations. An important purpose of this paper is to reduce the execution time for applying the PPB method. To reach this aim, the proper orthogonal decomposition technique has been combined with the PPB method. Originality/value The developed procedure is tested on various examples of one-dimensional, two-dimensional and three-dimensional versions of the governed equation on the rectangular and irregular domains to check its accuracy and validity.


Sign in / Sign up

Export Citation Format

Share Document