972 research outputs found

    RIACS

    Get PDF
    Topics considered include: high-performance computing; cognitive and perceptual prostheses (computational aids designed to leverage human abilities); autonomous systems. Also included: development of a 3D unstructured grid code based on a finite volume formulation and applied to the Navier-stokes equations; Cartesian grid methods for complex geometry; multigrid methods for solving elliptic problems on unstructured grids; algebraic non-overlapping domain decomposition methods for compressible fluid flow problems on unstructured meshes; numerical methods for the compressible navier-stokes equations with application to aerodynamic flows; research in aerodynamic shape optimization; S-HARP: a parallel dynamic spectral partitioner; numerical schemes for the Hamilton-Jacobi and level set equations on triangulated domains; application of high-order shock capturing schemes to direct simulation of turbulence; multicast technology; network testbeds; supercomputer consolidation project

    A New Discontinuous Galerkin Finite Element Method for Directly Solving the Hamilton-Jacobi Equations

    Full text link
    In this paper, we improve upon the discontinuous Galerkin (DG) method for Hamilton-Jacobi (HJ) equation with convex Hamiltonians in (Y. Cheng and C.-W. Shu, J. Comput. Phys. 223:398-415,2007) and develop a new DG method for directly solving the general HJ equations. The new method avoids the reconstruction of the solution across elements by utilizing the Roe speed at the cell interface. Besides, we propose an entropy fix by adding penalty terms proportional to the jump of the normal derivative of the numerical solution. The particular form of the entropy fix was inspired by the Harten and Hyman's entropy fix (A. Harten and J. M. Hyman. J. Comput. Phys. 50(2):235-269, 1983) for Roe scheme for the conservation laws. The resulting scheme is compact, simple to implement even on unstructured meshes, and is demonstrated to work for nonconvex Hamiltonians. Benchmark numerical experiments in one dimension and two dimensions are provided to validate the performance of the method

    Construction of simple, stable and convergent high order schemes for steady first order Hamilton Jacobi equations.

    Get PDF
    We develop a very simple algorithm that permits to construct compact, high order schemes for steady first order Hamilton Jacobi equations. The algorithm relies on the blending of a first order scheme and a compact high order one. The blending is conducted in such a way that the scheme is formally high order accurate. A convergence proof is given. We provide several numerical illustrations that demonstrate the effective accuracy of the scheme. The numerical examples use triangular unstructured meshes, but our method may be applied to other kind of meshes. Several implementation remarks are also given

    A semi-Lagrangian scheme for Hamilton–Jacobi–Bellman equations with oblique derivatives boundary conditions

    Get PDF
    We investigate in this work a fully-discrete semi-Lagrangian approximation of second order possibly degenerate Hamilton–Jacobi–Bellman (HJB) equations on a bounded domain O⊂ RN (N= 1 , 2 , 3) with oblique derivatives boundary conditions. These equations appear naturally in the study of optimal control of diffusion processes with oblique reflection at the boundary of the domain. The proposed scheme is shown to satisfy a consistency type property, it is monotone and stable. Our main result is the convergence of the numerical solution towards the unique viscosity solution of the HJB equation. The convergence result holds under the same asymptotic relation between the time and space discretization steps as in the classical setting for semi-Lagrangian schemes on O= RN. We present some numerical results, in dimensions N=1,2, on unstructured meshes, that confirm the numerical convergence of the scheme

    Finite-Element Discretization of Static Hamilton-Jacobi Equations Based on a Local Variational Principle

    Full text link
    We propose a linear finite-element discretization of Dirichlet problems for static Hamilton-Jacobi equations on unstructured triangulations. The discretization is based on simplified localized Dirichlet problems that are solved by a local variational principle. It generalizes several approaches known in the literature and allows for a simple and transparent convergence theory. In this paper the resulting system of nonlinear equations is solved by an adaptive Gauss-Seidel iteration that is easily implemented and quite effective as a couple of numerical experiments show.Comment: 19 page

    Doctor of Philosophy

    Get PDF
    dissertationPartial differential equations (PDEs) are widely used in science and engineering to model phenomena such as sound, heat, and electrostatics. In many practical science and engineering applications, the solutions of PDEs require the tessellation of computational domains into unstructured meshes and entail computationally expensive and time-consuming processes. Therefore, efficient and fast PDE solving techniques on unstructured meshes are important in these applications. Relative to CPUs, the faster growth curves in the speed and greater power efficiency of the SIMD streaming processors, such as GPUs, have gained them an increasingly important role in the high-performance computing area. Combining suitable parallel algorithms and these streaming processors, we can develop very efficient numerical solvers of PDEs. The contributions of this dissertation are twofold: proposal of two general strategies to design efficient PDE solvers on GPUs and the specific applications of these strategies to solve different types of PDEs. Specifically, this dissertation consists of four parts. First, we describe the general strategies, the domain decomposition strategy and the hybrid gathering strategy. Next, we introduce a parallel algorithm for solving the eikonal equation on fully unstructured meshes efficiently. Third, we present the algorithms and data structures necessary to move the entire FEM pipeline to the GPU. Fourth, we propose a parallel algorithm for solving the levelset equation on fully unstructured 2D or 3D meshes or manifolds. This algorithm combines a narrowband scheme with domain decomposition for efficient levelset equation solving
    • …
    corecore