An SOR Implicit Time-accurate Scheme in Calculating Unsteady Flows

The Successive Over Relaxation (SOR) is a variant of the iterative Gauss-Seidel method for solving a linear system of equations Ax=b. The SOR algorithm is used within the NEMO (Nucleus for European Modelling of the Ocean) ocean model for solving the elliptical equation for the barotropic stream function. The NEMO performance analysis shows that the SOR algorithm introduces a significant communication overhead. Its parallel implementation is based on the Red-Black method and foresees a communication step at each iteration. An enhanced parallel version of the algorithm has been developed by acting on the size of the overlap region to reduce the frequency of communications. The overlap size must be carefully tuned for reducing the communication overhead without increasing the computing time. This work describes an analytical performance model of the SOR algorithm that can be used for establishing the optimal size of the overlap region.

The application of parallel computers to reservoir simulation is studied with the aid of two recently introduced Multiple Instruction, Multiple Data (MIMD) computers. The problems posed by reservoir simulators are shown to be particularly well suited for such parallel computers* Fundamental parallel programming techniques using Fortran are presented for the Hetrogeneous Element Processor (HEP) produced by Denelcor and the iPSC Hypercube produced by Intel. These techniques are then applied to two of the most time consuming tasks in reservoir simulation: forming the matrix coefficients and producing a sparse matrix solution. The problem of parallel formation of sparse matrix coefficients is addressed for the single and multiphase cases using both black oil and compositional fluid models. Parallel sparse matrix solution is addressed by considering D4 ordered Gaussian elimination, and the multigrid, conjugate gradient, and Successive Over-Relaxation (SOR) methods. Three parallel algorithms based on SOR are developed to illustrate the possible diversity of parallel algorithms. The red-black and multicolored SOR methods which are often used on vector machines are shown to be easily adaptable to parallel MIMD machine. Matrix partitioning and a new method of iteration pipelining are also presented as parallel SOR methods. The various SOR algorithms, in parallel form, are mapped onto the HEP to illustrate the speedups currently possible on an MIMD machine. Projections are made on the future importance of these types of machines to reservoir simulation.

The successive over-relaxation (SOR) iteration method for solving linear systems of equations depends upon a relaxation parameter. A well-known theory for determining this parameter was given by Young for consistently ordered matrices. In this paper, for the three-dimensional Laplacian, we introduce several compact difference schemes and analyse the block-SOR method for the resulting linear systems. Their optimum relaxation parameters are given for the first time. Analysis shows that the value of the optimum relaxation parameter of block-SOR iteration is very sensitive for compact stencils when solving the three-dimensional Laplacian. This paper provides a theoretical solution for determining the optimum relaxation parameter in real applications. doi:10.1017/S1446181109000261

This paper presents two‐dimensional and unsteady RANS computations of time dependent, periodic, turbulent flow around a square block. Two turbulence models are used: the Launder–Sharma low‐Reynolds number k–ε model and a non‐linear extension sensitive to the anisotropy of turbulence. The Reynolds number based on the free stream velocity and obstacle side is Re=2.2×104. The present numerical results have been obtained using a finite volume code that solves the governing equations in a vertical plane, located at the lateral mid‐point of the channel. The pressure field is obtained with the SIMPLE algorithm. A bounded version of the third‐order QUICK scheme is used for the convective terms. Comparisons of the numerical results with the experimental data indicate that a preliminary steady solution of the governing equations using the linear k–ε does not lead to correct flow field predictions in the wake region downstream of the square cylinder. Consequently, the time derivatives of dependent variables are included in the transport equations and are discretized using the second‐order Crank–Nicolson scheme. The unsteady computations using the linear and non‐linear k–ε models significantly improve the velocity field predictions. However, the linear k–ε shows a number of predictive deficiencies, even in unsteady flow computations, especially in the prediction of the turbulence field. The introduction of a non‐linear k–ε model brings the two‐dimensional unsteady predictions of the time‐averaged velocity and turbulence fields and also the predicted values of the global parameters such as the Strouhal number and the drag coefficient to close agreement with the data. Copyright © 2009 John Wiley & Sons, Ltd.

Utility of the preconditioned conjugate gradient algorithm with a diagonal preconditioner for solving mixed-model equations in animal breeding applications was evaluated with 16 test problems. The problems included single- and multiple-trait analyses, with data on beef, dairy, and swine ranging from small examples to national data sets. Multiple-trait models considered low and high genetic correlations. Convergence was based on relative differences between left- and right-hand sides. The ordering of equations was fixed effects followed by random effects, with no special ordering within random effects. The preconditioned conjugate gradient program implemented with double precision converged for all models. However, when implemented in single precision, the preconditioned conjugate gradient algorithm did not converge for seven large models. The preconditioned conjugate gradient and successive overrelaxation algorithms were subsequently compared for 13 of the test problems. The preconditioned conjugate gradient algorithm was easy to implement with the iteration on data for general models. However, successive overrelaxation requires specific programming for each set of models. On average, the preconditioned conjugate gradient algorithm converged in three times fewer rounds of iteration than successive overrelaxation. With straightforward implementations, programs using the preconditioned conjugate gradient algorithm may be two or more times faster than those using successive overrelaxation. However, programs using the preconditioned conjugate gradient algorithm would use more memory than would comparable implementations using successive overrelaxation. Extensive optimization of either algorithm can influence rankings. The preconditioned conjugate gradient implemented with iteration on data, a diagonal preconditioner, and in double precision may be the algorithm of choice for solving mixed-model equations when sufficient memory is available and ease of implementation is essential.

Partial difference equation plays important role in simulating a wide variety of science and engineering problem. In this paper, we develop numerical application which implements the iterative methods for steady state simulation and its numerical engine. A new approach names Alternate Left Right is applied onto Successive Overrelaxation (SOR) called as the Alternate Left Right Successive Overrelaxation (ALRSOR) iterative method. The experiment's results are compared amongst SOR and ALRSOR to reveal the performance of these numerical engines. From the results, Alternate Left Right approach successfully increases the speed computation. In conclusion, ALRSOR method performs the fastest amongst the compared method.

Convergence is established for asynchronous parallel successive overrelaxation (SOR) algorithms for the symmetric linear complementarity problem. For the case of a strictly diagonally dominant matrix convergence is achieved for a relaxation factor interval of (0, 2] with line search, and (0, 1] without line search. Computational tests on the Sequent Symmetry S81 multiprocessor give speedup efficiency in the 43%–91% range for the cases for which convergence is established. The tests also show superiority of the asynchronous SOR algorithms over their synchronous counterparts.

A three-dimensional Navier-Stokes solver is applied to the computation of unsteady nozzle flows resulting from fluctuating backpressure and validated by comparison with experimental measurements. The flow is modeled by the three-dimensional compressible Navier-Stokes equations using the Launder-Sharma near-wall k-e turbulence model. The mean-flow and turbulence-transport equations are integrated in time using a first-order implicit scheme with third-order MUSCL upwind-biased Van Leer flux-vector-splitting. The configuration studied is a three-dimensional nozzle, with thick sidewall boundary layers. The three-dimensional effect is produced by the shock wave-boundary layer interaction at the corners of the nozzle, where an important three-dimensional recirculating zone appears. The flow is unsteady because of backpressure fluctuation, produced experimentally by a rotating rod of elliptical cross section. The unsteady computations were run for a backpressure fluctuation frequency of 180 Hz.

Unsteady transonic flow calculations are presented for wing-fuselage configurations. Calculations are performed by extending the XTRAN3S unsteady transonic small-disturbance code to allow the treatment of a fuselage. Details of the XTRAN3S fuselage modeling are discussed in the context of the small-disturbance equation. Transonic calculations are presented for three wing-fuselage configurations with leading edge sweep angles ranging from 0 deg to 46.76 deg. Simple bending and torsion modal oscillations of the wing are calculated. Sectional lift and moment coefficients for the wing-alone and wing-fuselage cases are compared and the effects of fuselage aerodynamic interference on the unsteady wing loading are revealed. Tabulated generalized aerodynamic forces used in flutter analyses, indicate small changes in the real in-phase component and as much as a 30% change in the imaginary component when the fuselage is included in the calculation. These changes result in a 2 to 5% increase in total magnitude and a several degree increase in phase.

Unsteady transonic flow calculations are presented for aerodynamically interfering lifting surface configurations. Calculations are performed by extending the XTRAN3S (Version 1.5) unsteady transonic small-disturbance code to allow the treatment of an additional lifting surface. The research was conducted as a first-step toward developing the capability to treat a complete flight vehicle. Grid generation procedures for swept tapered interfering lifting surface applications of XTRAN3S are described. Transonic calculations are presented for wing-tail and canard-wing configurations for several values of mean angle of attack. The effects of aerodynamic interference on transonic steady pressure distributions and steady and oscillatory spanwise lift distributions are demonstrated. Results due to wing, tail, or canard pitching motions are presented and discussed in detail.

The characteristics of unsteady flow motions have long been a serious concern in the study of various fluid dynamic and combustion problems. With the advancement of computer resources, numerical approaches to these problems appear to be feasible. The objective of this paper is to assess the accuracy of several numerical schemes for unsteady flow calculations. In the present study, Fourier error analysis is performed for various numerical schemes based on a two-dimensional wave equation. Four methods sieved from the error analysis are then adopted for further assessment. Model problems include unsteady quasi-one-dimensional inviscid flows, two-dimensional wave propagations, and unsteady two-dimensional inviscid flows. According to the comparison between numerical and exact solutions, although second-order upwind scheme captures the unsteady flow and wave motions quite well, it is relatively more dissipative than sixth-order central difference scheme. Among various numerical approaches tested in this paper, the best performed one is Runge-Kutta method for time integration and six-order central difference for spatial discretization.

This paper presents results of unsteady viscous flow calculations and corresponding cold flow experiments of a three-stage low-pressure turbine. The investigation emphasizes the study of unsteady flow interaction. A time-accurate Reynolds-averaged Navier–Stokes solver is applied for the computations. Turbulence is modeled using the Spalart–Allmaras one-equation turbulence model and the influence of modern transition models on the unsteady flow predictions is investigated. The integration of the governing equations in time is performed with a four-stage Runge–Kutta scheme, which is accelerated by a two-grid method in the viscous boundary layer around the blades. At the inlet and outlet, nonreflecting boundary conditions are used. The quasi-three-dimensional calculations are conducted on a stream surface around midspan, allowing a varying stream tube thickness. In order to study the unsteady flow interaction, a three-stage low-pressure turbine rig of a modern commercial jet engine is built up. In addition to the design point, the Reynolds number, the wheel speed, and the pressure ratio are also varied in the tests. The numerical method is able to capture important unsteady effects found in the experiments, i.e., unsteady transition as well as the blade row interaction. In particular, the flow field with respect to time-averaged and unsteady quantities such as surface pressure, entropy, and skin friction is compared with the experiments conducted in the cold air flow test rig. [S0889-504X(00)02004-3]

Godunov-type schemes with an inertia term for unsteady full Mach number range flow calculations

A hybrid grid technique for the solution of 2D, unsteady flows is developed. This technique is capable of handling complex, multiple component geometries in relative motion, such as those encountered in turbomachinery. The numerical approach utilizes a mixed structured-unstructured zonal grid topology along with modeling equations and solution methods that are most appropriate in the individual domains, therefore combining the advantages of both structured and unstructured grid techniques.

In this paper, we develop the explicit finite difference method (FDM) to solve an ill-posed Cauchy problem for the 3D acoustic wave equation in a time domain with the data on a part of the boundary given (continuation problem) in a cube. FDM is one of the numerical methods used to compute the solutions of hyperbolic partial differential equations (PDEs) by discretizing the given domain into a finite number of regions and a consequent reduction in given PDEs into a system of linear algebraic equations (SLAE). We present a theory, and through Matlab Version: 9.14.0.2286388 (R2023a), we find an efficient solution of a dense system of equations by implementing the numerical solution of this approach using several iterative techniques. We extend the formulation of the Jacobi, Gauss–Seidel, and successive over-relaxation (SOR) iterative methods in solving the linear system for computational efficiency and for the properties of the convergence of the proposed method. Numerical experiments are conducted, and we compare the analytical solution and numerical solution for different time phenomena.