Search results

This paper presents a Monotonic Unbounded Schemes Transformer (MUST) approach to bound/monotonize (remove undershoots and overshoots) unbounded spatial differencing schemes automatically, and naturally. Automatically means the approach (1) captures the critical cell Peclet number when an unbounded scheme starts to produce physically unrealistic solution automatically, and (2) removes the undershoots and overshoots as part of the formulation without requiring human interventions. Naturally implies, all the terms in the discretization equation of the unbounded spatial differencing scheme are retained.

The authors do not formulate new higher-order scheme. MUST transforms an unbounded higher-order scheme into a bounded higher-order scheme.

The solutions obtained with MUST are identical to those without MUST when the cell Peclet number is smaller than the critical cell Peclet number. For cell Peclet numbers larger than the critical cell Peclet numbers, MUST sets the nodal values to the limiter value which can be derived for the problem at-hand. The authors propose a way to derive the limiter value. The authors tested MUST on the central differencing scheme, the second-order upwind differencing scheme and the QUICK differencing scheme. In all cases tested, MUST is able to (1) capture the critical cell Peclet numbers; the exact locations when overshoots and undershoots occur, and (2) limit the nodal value to the value of the limiter values. These are achieved by retaining all the discretization terms of the respective differencing schemes naturally and accomplished automatically as part of the discretization process. The authors demonstrated MUST using one-dimensional problems. Results for a two-dimensional convection–diffusion problem are shown in Appendix to show generality of MUST.

The authors present an original approach to convert any unbounded scheme to bounded scheme while retaining all the terms in the original discretization equation.

A new discretization scheme named NOTABLE (New Option for the Treatment of Advection in the Boundary Layer Equations) is presented. Despite its name, this scheme is intended to be used in a general transport equation to discretize the convective term. It is formally third‐order accurate in regions of smooth solution and first‐order accurate at grid points having local maxima. Within the finite‐volume formulation it relates the face values to the nodal values via a non‐linear function. This scheme has been compared with well‐known high‐order schemes like QUICK and it has always given more accurate solutions. After assessing the scheme in several unidimensional test cases for which an exact solution is available, its performance in a complex swirling flow is addressed.

In 1982, Smith and Hutton published comparative results of several different convection‐diffusion schemes applied to a specially devised test problem involving near‐discontinuities and strong streamline curvature. First‐order methods showed significant artificial diffusion, whereas higher‐order methods gave less smearing but had a tendency to overshoot and oscillate. Perhaps because unphysical oscillations are more obvious than unphysical smearing, the intervening period has seen a rise in popularity of low‐order artificially diffusive schemes, especially in the numerical heat‐transfer industry. This paper presents an alternative strategy of using non‐artificially diffusive higher‐order methods, while maintaining strictly monotonic transitions through the use of simple flux‐limiter constraints. Limited third‐order upwinding is usually found to be the most cost‐effective basic convection scheme. Tighter resolution of discontinuities can be obtained at little additional cost by using automatic adaptive stencil expansion to higher order in local regions, as needed.

In Malaysia, Get-Rich-Quick scheme (GRQS) is one of the financial fraud activities prohibited under Malaysian law. The common facet of such schemes involves plans that promise unrealistic rates of returns, and this new scheme continues to proliferate every year as the list of illegal investment companies and websites are growing. Indeed, GRQS will remain proliferating as long as there are people who are easily lured by the promise that wealth can be generated with little skill, effort or time. This paper aims to explain the phenomenon of GRQS in light of the existing laws in Malaysia. This paper also highlights the current development of Australian law pertaining to GRQS for comparative purpose.

This paper mainly relies on statutes as its primary sources of information. As such, this paper analyses the scope and provisions of the relevant laws that regulate GRQS and compare the existing GRQS provisions that are equivalent with Australian law.

Malaysia has comprehensive laws to combat GRQS activities. However, these laws are far from perfection, and only with immediate amendments, GRQS problems can be resolved more effectively. One of the weaknesses of current Malaysian laws to tackle GRQS is the lack of more stringent punishment against the operators of GRQS as well as the participants of the scheme. A comparison with equivalent GRQS law in Australia demonstrates that Australian laws provide a wide range of punishment to the operators and prohibits participation in GRQS. More importantly, Australia regards the offense as a strict liability offense where the mens rea or guilty mind of the perpetrators is exempted. Indeed, numerous proceedings have been instituted in the Australian Court against the operators and participants of GRQS.

This paper analyses the scope of relevant laws in Malaysia to combat GRQS and examines the strengths and weaknesses of these laws. This paper also compares Malaysian law with equivalent GRQS-related laws available in Australia. This paper further suggests that Malaysia should regulate sterner punishment for operators and participants of the scheme and that the offense is categorized under a strict liability offense where the mens rea or guilty mind of the offender is exempted.

The purpose of this paper is to evaluate the performance of a numerical method for the solution to shallow-water equations on a staggered grid, in simulations for shear instabilities at two convective Froude numbers.

The simulations start from a small perturbation to a base flow with a hyperbolic-tangent velocity profile. The subsequent development of the shear instabilities is studied from the simulations using a number of flux-limiting schemes, including the second-order MINMOD, the third-order ULTRA-QUICK and the fifth-order WENO schemes for the spatial interpolation of the nonlinear fluxes. The fourth-order Runge-Kutta method advances the simulation in time.

The simulations determine two parameters: the fractional growth rate of the linear instabilities; and the vorticity thickness of the first nonlinear peak. Grid refinement using 32, 64, 128, 256 and 512 nodes over one wave length determines the exact values by extrapolation and the computational error for the parameters. It also determines the overall order of convergence for each of the flux-limiting schemes used in the numerical simulations.

The four-digit accuracy of the numerical simulations presented in this paper are comparable to analytical solutions. The development of this reliable numerical simulation method has paved the way for further study of the instabilities in shear flows that radiate waves.

The purpose of this study is to investigate the errors arising from the numerical treatment of model processes, paying particular attention to the impact of key system features including widely variable dispersion coefficients, spatiotemporal velocities of algal cells, and the aggregation of algae from single cells to large colonies. An advection–dispersion model has been presented to describe the vertical transport of colonial and motile harmful algae in a lake environment.

Model performance is examined for two different numerical treatments of the advective term: first-order upwind and quadratic upwind with a stability-preserving flux limiter (SMART). To determine how these schemes impact predictions, comparisons are made across a sequence of models with increasing complexity.

Using first-order upwinding for advection–dispersion calculations with a time oscillating velocity field leads to oscillatory numerical dispersion. Subjecting an initially uniform distribution of large-sized algal colonies to a spatiotemporal velocity creates a concentration pulse, which reaches a steady-state width at high-grid Peclet numbers when using the SMART scheme; the pulse exhibits contraction–expansion behavior throughout a velocity cycle at all Peclet numbers when using first-order upwinding. When aggregation dynamics are included with advection-dominated spatiotemporal transport, results indicate the SMART scheme predicts larger peak concentration values than those predicted by first-order upwind, but peak location and the time to large colony appearance remain largely unchanged between the two advective schemes.

To the best of the authors’ knowledge, this study is the first numerical investigation of a novel advection–dispersion model of vertical algal transport. In addition, a generalized expression for the effective dispersion coefficient of temporally variable flow fields is presented.

The purpose of the paper is to propose some modifications to the SIMPLE (semi-implicit method for pressure-linked equations) algorithm. These modifications can ensure the numerical robustness and optimize computational efficiency. They remarkably promote the ability of the SIMPLE algorithm for incompressible DNS (direct numerical simulation) of multiscale problems, such as transitional flows and turbulent flows, by improving the properties of dispersion and dissipation.

The MDCD (minimized dispersion and controllable dissipation) scheme and MMIM (modified momentum interpolation method) are introduced. Six typical test cases are used to validate the modified algorithm, including the linear convective flow, lid-driven cavity flow, laminar boundary layer, Taylor vortex and DHIT (decaying homogenous isotropic turbulence). Particularly, a highly unsteady DNS of separated-flow transition in turbomachinery is precisely predicted by the modified algorithm.

The numerical examples show the distinct superiority of the modified algorithm in both internal flows and external flows. The advantages of the MDCD scheme and MMIM make the SIMPLE algorithm a promising method for DNS.

Some effective modifications to the SIMPLE algorithm are addressed. It is the first attempt to introduce the MDCD approach into the SIMPLE-type algorithms. The new algorithm is especially suitable for the incompressible DNS of convection-dominated flows.

The purpose of this paper is to present a pressure‐correction procedure for incompressible flows using unstructured meshes. A method of implementing high‐order spatial schemes on unstructured grids was introduced.

The procedure used a collocated cell‐centered unstructured grid arrangement. In order to improve the accuracy of calculation, the widely used high‐order schemes for convection, developed for structured grids and in the form of either the normalized variable and space formulation (NVSF) or the total variation diminishing (TVD) flux limiters (FL), were introduced and implemented onto the unstructured grids. This implementation was carried out by constructing a local coordinate and introducing a virtual upstream node.

The procedure was validated by calculating the lid‐driven cavity flows which had benchmark numerical solutions. For comparison, these flows were also computed by a commercial package, the FLUENT. The results obtained by the present procedure agreed well with the benchmark solution although very coarse grids were used. For the FLUENT, however, worse agreements with the benchmark solutions were obtained although the grids used for computation were the same. These demonstrated the robustness of the presented numerical procedure.

With the present method, high‐order schemes in either NVSF or TVD FL forms for structured grids can be easily implemented onto unstructured grids. This provides more choices of high‐order schemes for calculating complex flows.

The purpose of this paper is to simulate the behaviour of the symmetrical turn‐up vortex amplifier (STuVA) to obtain insight into its maximum through‐flow operation within the eight‐port STuVA, and understand the relation between its design parameters and flow characteristics. Furthermore, it is to test the performance of different turbulent models and near‐wall models using the same grid, the same numerical methods and the same computational fluid dynamics code under multiple impingement conditions.

Three turbulence models, the standard k‐ε, the renormalization group (RNG) k‐ε model and the Reynolds stress model (RSM), and three near‐wall models have been used to simulate the confined incompressible turbulent flow in an eight‐port STuVA using unstructured meshes. The STuVA is a special symmetrical design of turn‐up vortex amplifier, and the simulation focused on its extreme operation in the maximum flow state with no swirling. The predictions were compared with basic pressure‐drop flow rate measurements made using air at ambient conditions. The effect of different combinations of turbulence and near‐wall models was evaluated.

The RSM gave predictions slightly closer to the experimental data than the other models, although the RNG k‐ε model predicted nearly as accurately as the RSM. They both improved errors by about 3 per cent compared to the standard k‐ε model but took a long time for convergence. The modelling of complex flows depends not only on the turbulence model but also on the near‐wall treatments and computational economy. In this study a good combination was the RSM, the two layer wall model and the higher order discretization scheme, which improved accuracy by more than 10 per cent compared to the standard k‐ε model, the standard wall function and first order upwind.

The results of this paper are valid for the global pressure drop flow rate. It should be desirable to compare some local information with the experiment.

This paper provides insight into the maximum through‐flow operation within the eight‐port STuVA to understand the relation between its design parameters and flow characteristics and study the performance of turbulence and near wall models.

In this paper new cubic v‐splines monotonic one‐dimensional profiles are presented, for the finite volume solution of convection‐diffusion problems. By studying the profile in normalized variables, some weight functions have been determined for the profile. Being free of the requirement that the volumes be equal, the volume size can be reduced where needed. Numerical properties of the proposed method were formally analysed and are confirmed by numerical examples included here.