A multigrid diagonal implicit algorithm has been developed to solve the three-dimensional Euler equations of inviscid compressible flow on block-structured grids. An improved method of advancing the multigrid cycle has been examined with respect to convergence rates, accuracy, and efficiency. In this method, the multigrid cycle is advanced independently in each of the blocks, and the information exchange between the blocks is done using buffer arrays, allowing for the asynchronous updating of interface boundary conditions. This updating scheme is used to eliminate the convergence problems found in a previous implementation of the algorithm while retaining its potential for efficient parallel execution. Results are computed for transonic flows past wings and include pressure distributions to verify the accuracy of the scheme and convergence histories to demonstrate the efficiency of the method. Efficiencies that were obtained using a modest number of processors in parallel are also presented and discussed.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Parallel computing strategies for block multigrid implicit solution of the Euler equations


    Contributors:

    Published in:

    AIAA Journal ; 30 , 8 Au


    Publication date :

    1992-08-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English


    Keywords :