18,861 research outputs found
Excessive Memory Usage of the ELLPACK Sparse Matrix Storage Scheme throughout the Finite Element Computations
Sparse matrices are occasionally encountered during solution of various problems by means of numerical methods, particularly the finite element method. ELLPACK sparse matrix storage scheme, one of the most widely used methods due to its implementation ease, is investigated in this study. The scheme uses excessive memory due to its definition. For the conventional finite element method, where the node elements are used, the excessive memory caused by redundant entries in the ELLPACK sparse matrix storage scheme becomes negligible for large scale problems. On the other hand, our analyses show that the redundancy is still considerable for the occasions where facet or edge elements have to be used
Fourier-based schemes with modified Green operator for computing the electrical response of heterogeneous media with accurate local fields
A modified Green operator is proposed as an improvement of Fourier-based
numerical schemes commonly used for computing the electrical or thermal
response of heterogeneous media. Contrary to other methods, the number of
iterations necessary to achieve convergence tends to a finite value when the
contrast of properties between the phases becomes infinite. Furthermore, it is
shown that the method produces much more accurate local fields inside
highly-conducting and quasi-insulating phases, as well as in the vicinity of
the phases interfaces. These good properties stem from the discretization of
Green's function, which is consistent with the pixel grid while retaining the
local nature of the operator that acts on the polarization field. Finally, a
fast implementation of the "direct scheme" of Moulinec et al. (1994) that
allows for parcimonious memory use is proposed.Comment: v2: `postprint' document (a few remaining typos in the published
version herein corrected in red; results unchanged
Exponential Integrators on Graphic Processing Units
In this paper we revisit stencil methods on GPUs in the context of
exponential integrators. We further discuss boundary conditions, in the same
context, and show that simple boundary conditions (for example, homogeneous
Dirichlet or homogeneous Neumann boundary conditions) do not affect the
performance if implemented directly into the CUDA kernel. In addition, we show
that stencil methods with position-dependent coefficients can be implemented
efficiently as well.
As an application, we discuss the implementation of exponential integrators
for different classes of problems in a single and multi GPU setup (up to 4
GPUs). We further show that for stencil based methods such parallelization can
be done very efficiently, while for some unstructured matrices the
parallelization to multiple GPUs is severely limited by the throughput of the
PCIe bus.Comment: To appear in: Proceedings of the 2013 International Conference on
High Performance Computing Simulation (HPCS 2013), IEEE (2013
Dispersion and dissipation error in high-order Runge-Kutta discontinuous Galerkin discretisations of the Maxwell equations
Different time-stepping methods for a nodal high-order discontinuous Galerkin discretisation of the Maxwell equations are discussed. A comparison between the most popular choices of Runge-Kutta (RK) methods is made from the point of view of accuracy and computational work. By choosing the strong-stability-preserving Runge-Kutta (SSP-RK) time-integration method of order consistent with the polynomial order of the spatial discretisation, better accuracy can be attained compared with fixed-order schemes. Moreover, this comes without a significant increase in the computational work. A numerical Fourier analysis is performed for this Runge-Kutta discontinuous Galerkin (RKDG) discretisation to gain insight into the dispersion and dissipation properties of the fully discrete scheme. The analysis is carried out on both the one-dimensional and the two-dimensional fully discrete schemes and, in the latter case, on uniform as well as on non-uniform meshes. It also provides practical information on the convergence of the dissipation and dispersion error up to polynomial order 10 for the one-dimensional fully discrete scheme
Variational Approach in Wavelet Framework to Polynomial Approximations of Nonlinear Accelerator Problems
In this paper we present applications of methods from wavelet analysis to
polynomial approximations for a number of accelerator physics problems.
According to variational approach in the general case we have the solution as a
multiresolution (multiscales) expansion in the base of compactly supported
wavelet basis. We give extension of our results to the cases of periodic
orbital particle motion and arbitrary variable coefficients. Then we consider
more flexible variational method which is based on biorthogonal wavelet
approach. Also we consider different variational approach, which is applied to
each scale.Comment: LaTeX2e, aipproc.sty, 21 Page
Nonlinear Dynamics of Accelerator via Wavelet Approach
In this paper we present the applications of methods from wavelet analysis to
polynomial approximations for a number of accelerator physics problems. In the
general case we have the solution as a multiresolution expansion in the base of
compactly supported wavelet basis. The solution is parametrized by the
solutions of two reduced algebraical problems, one is nonlinear and the second
is some linear problem, which is obtained from one of the next wavelet
constructions: Fast Wavelet Transform, Stationary Subdivision Schemes, the
method of Connection Coefficients. According to the orbit method and by using
construction from the geometric quantization theory we construct the symplectic
and Poisson structures associated with generalized wavelets by using
metaplectic structure. We consider wavelet approach to the calculations of
Melnikov functions in the theory of homoclinic chaos in perturbed Hamiltonian
systems and for parametrization of Arnold-Weinstein curves in Floer variational
approach.Comment: 16 pages, no figures, LaTeX2e, aipproc.sty, aipproc.cl
Feasibility of using the Massively Parallel Processor for large eddy simulations and other Computational Fluid Dynamics applications
The results of an investigation into the feasibility of using the MPP for direct and large eddy simulations of the Navier-Stokes equations is presented. A major part of this study was devoted to the implementation of two of the standard numerical algorithms for CFD. These implementations were not run on the Massively Parallel Processor (MPP) since the machine delivered to NASA Goddard does not have sufficient capacity. Instead, a detailed implementation plan was designed and from these were derived estimates of the time and space requirements of the algorithms on a suitably configured MPP. In addition, other issues related to the practical implementation of these algorithms on an MPP-like architecture were considered; namely, adaptive grid generation, zonal boundary conditions, the table lookup problem, and the software interface. Performance estimates show that the architectural components of the MPP, the Staging Memory and the Array Unit, appear to be well suited to the numerical algorithms of CFD. This combined with the prospect of building a faster and larger MMP-like machine holds the promise of achieving sustained gigaflop rates that are required for the numerical simulations in CFD
Krylov implicit integration factor discontinuous Galerkin methods on sparse grids for high dimensional reaction-diffusion equations
Computational costs of numerically solving multidimensional partial
differential equations (PDEs) increase significantly when the spatial
dimensions of the PDEs are high, due to large number of spatial grid points.
For multidimensional reaction-diffusion equations, stiffness of the system
provides additional challenges for achieving efficient numerical simulations.
In this paper, we propose a class of Krylov implicit integration factor (IIF)
discontinuous Galerkin (DG) methods on sparse grids to solve reaction-diffusion
equations on high spatial dimensions. The key ingredient of spatial DG
discretization is the multiwavelet bases on nested sparse grids, which can
significantly reduce the numbers of degrees of freedom. To deal with the
stiffness of the DG spatial operator in discretizing reaction-diffusion
equations, we apply the efficient IIF time discretization methods, which are a
class of exponential integrators. Krylov subspace approximations are used to
evaluate the large size matrix exponentials resulting from IIF schemes for
solving PDEs on high spatial dimensions. Stability and error analysis for the
semi-discrete scheme are performed. Numerical examples of both scalar equations
and systems in two and three spatial dimensions are provided to demonstrate the
accuracy and efficiency of the methods. The stiffness of the reaction-diffusion
equations is resolved well and large time step size computations are obtained
- âŠ