Direct and iterative algorithms for the three-dimensional Euler equations

摘要: Direct and iterative algorithms have been developed for solving a finite volume discretization of the three-dimensional Euler equations in curvilinear coordinates. The are discretized using numerical derivatives flux vector Jacobians. Two direct solvers formulated, one which has diagonal plane matrix structure with significantly lower memory requirements. used as benchmark measuring convergence rate robustness more computationally efficient include two factored approaches, Newton-relaxation algorithm algorithm, uses A formulation also that may potential massive parallelization. It is demonstrated approach can give rates equal to solver problems. As demonstration both Jacobians, quadratic machine zero