sparse grid method
Recently Published Documents


TOTAL DOCUMENTS

18
(FIVE YEARS 2)

H-INDEX

4
(FIVE YEARS 0)

2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Zhipeng Yang ◽  
Xuejian Li ◽  
Xiaoming He ◽  
Ju Ming

<p style='text-indent:20px;'>In this paper, we develop a sparse grid stochastic collocation method to improve the computational efficiency in handling the steady Stokes-Darcy model with random hydraulic conductivity. To represent the random hydraulic conductivity, the truncated Karhunen-Loève expansion is used. For the discrete form in probability space, we adopt the stochastic collocation method and then use the Smolyak sparse grid method to improve the efficiency. For the uncoupled deterministic subproblems at collocation nodes, we apply the general coupled finite element method. Numerical experiment results are presented to illustrate the features of this method, such as the sample size, convergence, and randomness transmission through the interface.</p>


2017 ◽  
Vol 17 (2) ◽  
pp. 299-322 ◽  
Author(s):  
Stephen Russell ◽  
Niall Madden

AbstractOur goal is to present an elementary approach to the analysis and programming of sparse grid finite element methods. This family of schemes can compute accurate solutions to partial differential equations, but using far fewer degrees of freedom than their classical counterparts. After a brief discussion of the classical Galerkin finite element method with bilinear elements, we give a short analysis of what is probably the simplest sparse grid method: the two-scale technique of Lin et al. [14]. We then demonstrate how to extend this to a multiscale sparse grid method which, up to choice of basis, is equivalent to the hierarchical approach, as described by, e.g., Bungartz and Griebel [4]. However, by presenting it as an extension of the two-scale method, we can give an elementary treatment of its analysis and implementation. For each method considered, we provide MATLAB code, and a comparison of accuracy and computational costs.


2015 ◽  
Vol 53 (3) ◽  
pp. 1508-1536 ◽  
Author(s):  
G. Zhang ◽  
C. Webster ◽  
M. Gunzburger ◽  
J. Burkardt

2014 ◽  
Author(s):  
Guannan Zhang ◽  
Clayton G. Webster ◽  
Max D. Gunzburger ◽  
John V. Burkardt

2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
Shu-Li Mei ◽  
De-Hai Zhu

The Perona-Malik equation is a famous image edge-preserved denoising model, which is represented as a nonlinear 2-dimension partial differential equation. Based on the homotopy perturbation method (HPM) and the multiscale interpolation theory, a dynamic sparse grid method for Perona-Malik was constructed in this paper. Compared with the traditional multiscale numerical techniques, the proposed method is independent of the basis function. In this method, a dynamic choice scheme of external grid points is proposed to eliminate the artifacts introduced by the partitioning technique. In order to decrease the calculation amount introduced by the change of the external grid points, the Newton interpolation technique is employed instead of the traditional Lagrange interpolation operator, and the condition number of the discretized matrix different equations is taken into account of the choice of the external grid points. Using the new numerical scheme, the time complexity of the sparse grid method for the image denoising is decreased toO(4J+2j) fromO(43J), (j≪J). The experiment results show that the dynamic choice scheme of the external gird points can eliminate the boundary effect effectively and the efficiency can also be improved greatly comparing with the classical interval wavelets numerical methods.


Sign in / Sign up

Export Citation Format

Share Document