An efficient numerical scheme for the two-dimensional shallow water equations using arithmetic averaging

A finite difference scheme based on flux difference splitting is presented for the solution of the two-dimensional shallow water equations of ideal fluid flow. A linearised problem, analogous to that of Riemann for gas dynamics is defined, and a scheme, based on numerical characteristic decomposition is presented for obtaining approximate solutions to the linearised problem, and incorporates the technique of operator splitting. An average of the flow variables across the interface between cells is required, and this average is chosen to be the arithmetic mean for computational efficiency leading to arithmetic averaging. This is in contrast to usual ‘square root’ averages found in this type of Riemann solver, where the computational expense can be prohibitive. The method of upwind differencing is used for the resulting scalar problems, together with a flux limiter for obtaining a second order scheme which avoids nonphysical, spurious oscillations. An extension to the two-dimensional equations with source terms is included. The scheme is applied to the one-dimensional problems of a breaking dam and reflection of a bore, and in each case the approximate solution is compared to the exact solution of ideal fluid flow. The scheme is also applied to a problem of stationary bore generation in a channel of variable cross-section. Finally, the scheme is applied to two other dam-break problems, this time in two dimensions with one having cylindrical symmetry. Each approximate solution compares well with those given by other authors.

An efficient finite difference scheme for three-dimensional, non-equilibrium flows using operator splitting

An efficient finite difference scheme is presented for the inviscid terms of the three-dimensional, compressible flow equations for chemical non-equilibrium gases. This scheme represents an extension and an improvement of one proposed by the author, and includes operator splitting.

A non-uniform mesh scheme for compressible flow

A non-uniform mesh scheme is presented for the computation of compressible flows governed by the Euler equations of gas dynamics. The scheme is based on flux-difference splitting and represents an extension of a similar scheme designed for uniform meshes. The numerical results demonstrate that little, if any, spurious oscillation occurs as a result of the non-uniformity of the mesh; and importantly, shock speeds are computed correctly.

A shock capturing scheme for steady, supercritical, free-surface flow

Abstract A finite difference scheme is presented for the solution of the two-dimensional shallow water equations in steady, supercritical flow. The scheme incorporates numerical characteristic decomposition, is shock capturing by design and incorporates space-marching as a result of the assumption that the flow is wholly supercritical in at least one space dimension. Results are shown for problems involving oblique hydraulic jumps and reflection from a wall.

A TVD finite difference scheme with non-uniform meshes and without upstream weighting

We present a finite difference scheme, with the TVD (total variation diminishing) property, for scalar conservation laws. The scheme applies to non-uniform meshes, allowing for variable mesh spacing, and is without upstream weighting. When applied to systems of conservation laws, no scalar decomposition is required, nor are any artificial tuning parameters, and this leads to an efficient, robust algorithm.

Shock capturing scheme for steady, supersonic, isentropic flow

A finite difference scheme is presented for the solution of the two-dimensional equations of steady, supersonic, isentropic flow. The scheme incorporates numerical characteristic decomposition, is shock-capturing by design and incorporates space marching as a result of the assumption that the flow is wholly supersonic in at least one space dimension. Results are shown for problems involving oblique hydraulic jumps and reflection from a wall.

A finite difference scheme for inviscid flows with non-eequilibrium chemistry and internal energy

A finite difference scheme is presented for the inviscid terms of the equations of compressible fluid dynamics with general non-equilibrium chemistry and internal energy.

A finite difference scheme for steady, supersonic, two-dimensional, compressible flow of real gases

A finite difference scheme is presented for the solution of the two-dimensional equations of steady, supersonic, compressible flow of real gases. The scheme incorparates numerical characteristic decomposition, is shock-capturing by design and incorporates space-marching as a result of the assumption that the flow is wholly supersonic in at least one space dimension. Results are shown for problems involving oblique hydraulic jumps and reflection from a wall.

A numerical scheme for two-dimensional, open channel flows with non-rectangular geometries

An algorithm based on flux difference splitting is presented for the solution of two-dimensional, open channel flows. A transformation maps a non-rectangular, physical domain into a rectangular one. The governing equations are then the shallow water equations, including terms of slope and friction, in a generalized coordinate system. A regular mesh on a rectangular computational domain can then be employed. The resulting scheme has good jump capturing properties and the advantage of using boundary/body-fitted meshes. The scheme is applied to a problem of flow in a river whose geometry induces a region of supercritical flow.

Error estimates for a fully discrete spectral scheme for a class of nonlinear, nonlocal dispersive wave equations

We analyze a fully discrete spectral method for the numerical solution of the initial- and periodic boundary-value problem for two nonlinear, nonlocal, dispersive wave equations, the Benjamin–Ono and the Intermediate Long Wave equations. The equations are discretized in space by the standard Fourier–Galerkin spectral method and in time by the explicit leap-frog scheme. For the resulting fully discrete, conditionally stable scheme we prove an L2-error bound of spectral accuracy in space and of second-order accuracy in time.

Minimum neighbour and extended Kalman filter estimator: a practical distributed channel assignment scheme for dense wireless local area networks

Dense deployments of wireless local area networks (WLANs) are becoming a norm in many cities around the world. However, increased interference and traffic demands can severely limit the aggregate throughput achievable unless an effective channel assignment scheme is used. In this work, a simple and effective distributed channel assignment (DCA) scheme is proposed. It is shown that in order to maximise throughput, each access point (AP) simply chooses the channel with the minimum number of active neighbour nodes (i.e. nodes associated with neighbouring APs that have packets to send). However, application of such a scheme to practice depends critically on its ability to estimate the number of neighbour nodes in each channel, for which no practical estimator has been proposed before. In view of this, an extended Kalman filter (EKF) estimator and an estimate of the number of nodes by AP are proposed. These not only provide fast and accurate estimates but can also exploit channel switching information of neighbouring APs. Extensive packet level simulation results show that the proposed minimum neighbour and EKF estimator (MINEK) scheme is highly scalable and can provide significant throughput improvement over other channel assignment schemes.

Image fusion based on median filters and SOFM neural networks: a three-step scheme

This paper presents a new image data fusion scheme by combining median filtering with self-organizing feature map (SOFM) neural networks. The scheme consists of three steps: (1) pre-processing of the images, where weighted median filtering removes part of the noise components corrupting the image, (2) pixel clustering for each image using self-organizing feature map neural networks, and (3) fusion of the images obtained in Step (2), which suppresses the residual noise components and thus further improves the image quality. It proves that such a three-step combination offers an impressive effectiveness and performance improvement, which is confirmed by simulations involving three image sensors (each of which has a different noise structure).

Orthogonal on-off BPSK: a convenient signaling scheme for near-far resistant detection in DS/CDMA

This paper proposes a convenient signaling scheme-orthogonal on-off BPSK (O3BPSK)-for near-far (NF) resistant detection in asynchronous direct-sequence code-division multiple-access (DS/CDMA) systems (uplink). The temporally adjacent bits from different users in the received signals are decoupled by using the on-off signaling, and the original data rate is maintained with no increase in transmission rate by adopting an orthogonal structure. The detector at the receiver is a one-shot linear decorrelating detector, which depends upon neither hard decision nor specific channel coding. The application of O3 strategy to the differentially encoded BPSK (D-BPSK) sequences is also presented. Finally, some computer simulations are shown to confirm the theoretical analysis.