531 research outputs found
A bibliography on parallel and vector numerical algorithms
This is a bibliography of numerical methods. It also includes a number of other references on machine architecture, programming language, and other topics of interest to scientific computing. Certain conference proceedings and anthologies which have been published in book form are listed also
Solution of partial differential equations on vector and parallel computers
The present status of numerical methods for partial differential equations on vector and parallel computers was reviewed. The relevant aspects of these computers are discussed and a brief review of their development is included, with particular attention paid to those characteristics that influence algorithm selection. Both direct and iterative methods are given for elliptic equations as well as explicit and implicit methods for initial boundary value problems. The intent is to point out attractive methods as well as areas where this class of computer architecture cannot be fully utilized because of either hardware restrictions or the lack of adequate algorithms. Application areas utilizing these computers are briefly discussed
Cumulative reports and publications through December 31, 1990
This document contains a complete list of ICASE reports. Since ICASE reports are intended to be preprints of articles that will appear in journals or conference proceedings, the published reference is included when it is available
Computational methods and software systems for dynamics and control of large space structures
Two key areas of crucial importance to the computer-based simulation of large space structures are discussed. The first area involves multibody dynamics (MBD) of flexible space structures, with applications directed to deployment, construction, and maneuvering. The second area deals with advanced software systems, with emphasis on parallel processing. The latest research thrust in the second area involves massively parallel computers
Matrix-free GPU implementation of a preconditioned conjugate gradient solver for anisotropic elliptic PDEs
Many problems in geophysical and atmospheric modelling require the fast
solution of elliptic partial differential equations (PDEs) in "flat" three
dimensional geometries. In particular, an anisotropic elliptic PDE for the
pressure correction has to be solved at every time step in the dynamical core
of many numerical weather prediction models, and equations of a very similar
structure arise in global ocean models, subsurface flow simulations and gas and
oil reservoir modelling. The elliptic solve is often the bottleneck of the
forecast, and an algorithmically optimal method has to be used and implemented
efficiently. Graphics Processing Units have been shown to be highly efficient
for a wide range of applications in scientific computing, and recently
iterative solvers have been parallelised on these architectures. We describe
the GPU implementation and optimisation of a Preconditioned Conjugate Gradient
(PCG) algorithm for the solution of a three dimensional anisotropic elliptic
PDE for the pressure correction in NWP. Our implementation exploits the strong
vertical anisotropy of the elliptic operator in the construction of a suitable
preconditioner. As the algorithm is memory bound, performance can be improved
significantly by reducing the amount of global memory access. We achieve this
by using a matrix-free implementation which does not require explicit storage
of the matrix and instead recalculates the local stencil. Global memory access
can also be reduced by rewriting the algorithm using loop fusion and we show
that this further reduces the runtime on the GPU. We demonstrate the
performance of our matrix-free GPU code by comparing it to a sequential CPU
implementation and to a matrix-explicit GPU code which uses existing libraries.
The absolute performance of the algorithm for different problem sizes is
quantified in terms of floating point throughput and global memory bandwidth.Comment: 18 pages, 7 figure
HIGH ACCURACY MULTISCALE MULTIGRID COMPUTATION FOR PARTIAL DIFFERENTIAL EQUATIONS
Scientific computing and computer simulation play an increasingly important role in scientific investigation and engineering designs, supplementing traditional experiments, such as in automotive crash studies, global climate change, ocean modeling, medical imaging, and nuclear weapons. The numerical simulation is much cheaper than experimentation for these application areas and it can be used as the third way of science discovery beyond the experimental and theoretical analysis. However, the increasing demand of high resolution solutions of the Partial Differential Equations (PDEs) with less computational time has increased the importance for researchers and engineers to come up with efficient and scalable computational techniques that can solve very large-scale problems. In this dissertation, we build an efficient and highly accurate computational framework to solve PDEs using high order discretization schemes and multiscale multigrid method.
Since there is no existing explicit sixth order compact finite difference schemes on a single scale grids, we used Gupta and Zhang’s fourth order compact (FOC) schemes on different scale grids combined with Richardson extrapolation schemes to compute the sixth order solutions on coarse grid. Then we developed an operator based interpolation scheme to approximate the sixth order solutions for every find grid point. We tested our method for 1D/2D/3D Poisson and convection-diffusion equations.
We developed a multiscale multigrid method to efficiently solve the linear systems arising from FOC discretizations. It is similar to the full multigrid method, but it does not start from the coarsest level. The major advantage of the multiscale multigrid method is that it has an optimal computational cost similar to that of a full multigrid method and can bring us the converged fourth order solutions on two grids with different scales. In order to keep grid independent convergence for the multiscale multigrid method, line relaxation and plane relaxation are used for 2D and 3D convection diffusion equations with high Reynolds number, respectively. In addition, the residual scaling technique is also applied for high Reynolds number problems.
To further optimize the multiscale computation procedure, we developed two new methods. The first method is developed to solve the FOC solutions on two grids using standardW-cycle structure. The novelty of this strategy is that we use the coarse level grid that will be generated in the standard geometric multigrid to solve the discretized equations and achieve higher order accuracy solution. It is more efficient and costs less CPU and memory compared with the V-cycle based multiscale multigrid method.
The second method is called the multiple coarse grid computation. It is first proposed in superconvergent multigrid method to speed up the convergence. The basic idea of multigrid superconvergent method is to use multiple coarse grids to generate better correction for the fine grid solution than that from the single coarse grid. However, as far as we know, it has never been used to increase the order of solution accuracy for the fine grid. In this dissertation, we use the idea of multiple coarse grid computation to approximate the fourth order solutions on every coarse grid and fine grid. Then we apply the Richardson extrapolation for every fine grid point to get the sixth order solutions.
For parallel implementation, we studied the parallelization and vectorization potential of the Gauss-Seidel relaxation by partitioning the grid space with four colors for solving 3D convection-diffusion equations. We used OpenMP to parallelize the loops in relaxation and residual computation. The numerical results show that the parallelized and the sequential implementation have the same convergence rate and the accuracy of the computed solutions
- …