In this article, an improved reduced order modelling approach, based on the proper orthogonal decomposition (POD) method, is presented. After projecting the governing equations of flow dynamics along the POD modes, a dynamical system was obtained. Normally, the classical reduced order models do not predict accurate time variations of flow variables due to some reasons. The response of the dynam...

‎This paper obtains the exact solutions of the wave equation as a second-order partial differential equation (PDE)‎. ‎We are going to calculate polynomial and non-polynomial exact solutions by using Lie point symmetry‎. ‎We demonstrate the generation of such polynomial through the medium of the group theoretical properties of the equation‎. ‎A generalized procedure for polynomial solution is pr...

This study concerns numerical simulation, modeling and optimization of aerodynamic stall control using a synthetic jet actuator. Thenumerical simulation was carried out by a large-eddy simulation that employs a RNG-based model as the subgrid-scale model. The flow around a NACA0015 airfoil, including a synthetic jet located at 10 % of the chord, is studied under Reynolds number Re = 12.7 × 106 a...

An extension L/K of skew fields is called a leftpolynomialextension with polynomial generator 0 if it has a left basis of the form 1, i3, ti’, , Bnm’ for some n. This notion of left polynomial extension is a generalisation of the notion of pseudo-linear extension, known from literature. In this paper we show that any polynomial which is the minimal polynomial over K of some element in an extens...

Fujishige proposed a polynomial-time maximum flow algorithm using maximum adjacency (MA) orderings. Computational results by Fujishige and Isotani showed that the algorithm was slower in practice than Goldberg and Tarjan’s algorithm. In this paper we propose an improved version of Fujishige’s algorithm using preflows. Our computational results show that the improved version is much faster than ...

Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed keeping the structure of vision based flow graphs in mind are more efficient than known strongly polynomial time max-flow algorithms based on preflow push or shortest augmenting path paradigms [1]. We present here a new algorithm ...