Vortex sheet simulation of a plane �canonical� mixing layer

Discrete vortex simulations of the mixing layer carried out in the past have usually involved large induced velocity fluctuations, and thus demanded rather long time-averaging to obtain satisfactory values of Reynolds stresses and third-order moments. This difficulty has been traced here, in part, to the use of discrete vortices to model what in actuality are continuous vortex sheets. We propose here a novel two-dimensional vortex sheet technique for computing mixing layer flow in the limit of infinite Reynolds number. The method divides the vortex sheet into constant-strength linear elements, whose motions are computed using the Biot-Savart law. The downstream far-field is modelled by a steady vorticity distribution derived by application of conical similarity from the solution obtained in a finite computational domain. The boundary condition on the splitter plate is satisfied rigorously using a doublet sheet. The computed large-scale roll-up of the vortex sheet is qualitatively similar to experimentally obtained shadow-graphs of the plane turbulent mixing layer. The mean streamwise velocity profile and the growth rate agree well with experimental data. The presently computed Reynolds stresses and third-order moments are comparable with experimental and previous vortex-dynamical results, without using any external parameter (such as the vortex core-size) of the kind often used in the latter. The computed autocorrelations are qualitatively similar to experimental results along the top and bottom edges of the mixing layer, and show a well-defined periodicity along the centreline. The accuracy of the present computation is independently established by demonstrating negligibly small changes in the five invariants (including the Hamiltonian) in vortex dynamics.

Generation of an eight node brick element using Papcovitch-Neuber functions

Some conventional finite elements suffer from drawbacks, such as shear locking, membrane locking, etc. To overcome them researchers have developed various techniques, termed as tricks by some and variational crimes by others. Many attempts have been made, but satisfactory explanations for why some of these techniques work have not been obtained, especially in the case of solid elements. This paper attempts a simple non-conforming solid element using assumed displacement fields which satisfy the Navier equation exactly. Its behaviour under simple loadings like bending, torsion and tension is examined and comparisons are made with existing elements.

Improving the convergence rate of the inverse iteration method

Solution of generalized eigenproblem, K phi = lambda M phi, by the classical inverse iteration method exhibits slow convergence for some eigenproblems. In this paper, a modified inverse iteration algorithm is presented for improving the convergence rate. At every iteration, an optimal linear combination of the latest and the preceding iteration vectors is used as the input vector for the next iteration. The effectiveness of the proposed algorithm is demonstrated for three typical eigenproblems, i.e. eigenproblems with distinct, close and repeated eigenvalues. The algorithm yields 29, 96 and 23% savings in computational time, respectively, for these problems. The algorithm is simple and easy to implement, and this renders the algorithm even more attractive.

Lamination-dependent shear deformation models for bending of angle-ply laminated plates

Lamination-dependent shear corrective terms in the analysis of bending of laminated plates are derived from a priori assumed linear thicknesswise distributions for gradients of transverse shear stresses by using CLPT inplane stresses in the two in-plane equilibrium equations of elasticity in each ply. In the development of a general model for angle-ply laminated plates, special cases like cylindrical bending of laminates in either direction, symmetric laminates, cross-ply laminates, antisymmetric angle-ply laminates, homogeneous plates are taken into consideration. Adding these corrective terms to the assumed displacements in (i) Classical Laminate Plate Theory (CLPT) and (ii) Classical Laminate Shear Deformation Theory (CLSDT), two new refined lamination-dependent shear deformation models are developed. Closed form solutions from these models are obtained for antisymmetric angle-ply laminates under sinusoidal load for a type of simply supported boundary conditions. Results obtained from the present models and also from Ren's model (1987) are compared with each other.

Lamination-dependent shear deformation models for cylindrical bending of angle-ply laminates

Lamination-dependent shear corrective terms in the analysis of flexure of laminates are derived from a priori assumed linear thicknesswise distributions for gradients of transverse shear stresses and using them in the two in-plane equilibrium equations of elasticity in each ply. Adding these corrective terms to (i) Classical Laminate Plate Theory (CLPT) displacements and (ii) Classical Laminate Shear Deformation Theory (CLSDT) displacements, four new refined lamination-dependent shear deformation models for angle-ply laminates are developed. Performance of these models is evaluated by comparing the results from these models with those from exact elasticity solutions for antisymmetric 2-ply laminates and for 4-ply [15/-15](s) laminates. In general, the model with shear corrective terms based on CLPT and added to CLSDT displacements is sufficient and predicts good estimates, both qualitatively and quantitatively, for all displacements and stresses.

Large deformation finite element analysis of laminated circular composite plates

A 48 d.o.f., four-noded quadrilateral laminated composite shell finite element is particularised to a sector finite element and is used for the large deformation analysis of circular composite laminated plates. The strain-displacement relationships for the sector element are obtained by reducing those of the quadrilateral shell finite element by substituting proper values for the geometric parameters. Subsequently, the linear and tangent stiffness matrices are formulated using conventional methods. The Newton-Raphson method is employed as the nonlinear solution technique. The computer code developed is validated by solving an isotropic case for which results are available in the literature. The method is then applied to solve problems of cylindrically orthotropic circular plates. Some of the results of cylindrically orthotropic case are compared with those available in the literature. Subsequently, application is made to the case of laminated composite circular plates having different lay-up schemes. The computer code can handle symmetric/unsymmetric lay-up schemes. The large displacement analysis is useful in estimating the damage in composite plates caused by low-velocity impact.

Petri net-based modeling of a class of complex digital systems

We present through the use of Petri Nets, modeling techniques for digital systems realizable using FPGAs. These Petri Net models are used for logic validation at the logic design phase. The technique is illustrated by modeling practical circuits. Further, the utility of the technique with respect to timing analysis of the modeled digital systems is considered. Copyright (C) 1997 Elsevier Science Ltd

Mapping adaptive resonance theory onto ring and mesh architectures

In recent years, parallel computers have been attracting attention for simulating artificial neural networks (ANN). This is due to the inherent parallelism in ANN. This work is aimed at studying ways of parallelizing adaptive resonance theory (ART), a popular neural network algorithm. The core computations of ART are separated and different strategies of parallelizing ART are discussed. We present mapping strategies for ART 2-A neural network onto ring and mesh architectures. The required parallel architecture is simulated using a parallel architectural simulator, PROTEUS and parallel programs are written using a superset of C for the algorithms presented. A simulation-based scalability study of the algorithm-architecture match is carried out. The various overheads are identified in order to suggest ways of improving the performance. Our main objective is to find out the performance of the ART2-A network on different parallel architectures. (C) 1999 Elsevier Science B.V. All rights reserved.

Nonlinear analysis of adhesively bonded lap joints considering viscoplasticity in adhesives

This paper presents nonlinear finite element analysis of adhesively bonded joints considering the elastoviscoplastic constitutive model of the adhesive material and the finite rotation of the joint. Though the adherends have been assumed to be linearly elastic, the yielding of the adhesive is represented by a pressure sensitive modified von Mises yield function. The stress-strain relation of the adhesive is represented by the Ramberg-Osgood relation. Geometric nonlinearity due to finite rotation in the joint is accounted for using the Green-Lagrange strain tensor and the second Piola-Kirchhoff stress tensor in a total Lagrangian formulation. Critical time steps have been calculated based on the eigenvalues of the transition matrices of the viscoplastic model of the adhesive. Stability of the viscoplastic solution and time dependent behaviour of the joints are examined. A parametric study has been carried out with particular reference to peel and shear stress along the interface. Critical zones for failure of joints have been identified. The study is of significance in the design of lap joints as well as on the characterization of adhesive strength. (C) 1999 Elsevier Science Ltd. All rights reserved.

Minimizing buffer requirements under rate-optimal schedule in regular dataflow networks

Large-grain synchronous dataflow graphs or multi-rate graphs have the distinct feature that the nodes of the dataflow graph fire at different rates. Such multi-rate large-grain dataflow graphs have been widely regarded as a powerful programming model for DSP applications. In this paper we propose a method to minimize buffer storage requirement in constructing rate-optimal compile-time (MBRO) schedules for multi-rate dataflow graphs. We demonstrate that the constraints to minimize buffer storage while executing at the optimal computation rate (i.e. the maximum possible computation rate without storage constraints) can be formulated as a unified linear programming problem in our framework. A novel feature of our method is that in constructing the rate-optimal schedule, it directly minimizes the memory requirement by choosing the schedule time of nodes appropriately. Lastly, a new circular-arc interval graph coloring algorithm has been proposed to further reduce the memory requirement by allowing buffer sharing among the arcs of the multi-rate dataflow graph. We have constructed an experimental testbed which implements our MBRO scheduling algorithm as well as (i) the widely used periodic admissible parallel schedules (also known as block schedules) proposed by Lee and Messerschmitt (IEEE Transactions on Computers, vol. 36, no. 1, 1987, pp. 24-35), (ii) the optimal scheduling buffer allocation (OSBA) algorithm of Ning and Gao (Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Charleston, SC, Jan. 10-13, 1993, pp. 29-42), and (iii) the multi-rate software pipelining (MRSP) algorithm (Govindarajan and Gao, in Proceedings of the 1993 International Conference on Application Specific Array Processors, Venice, Italy, Oct. 25-27, 1993, pp. 77-88). Schedules generated for a number of random dataflow graphs and for a set of DSP application programs using the different scheduling methods are compared. The experimental results have demonstrated a significant improvement (10-20%) in buffer requirements for the MBRO schedules compared to the schedules generated by the other three methods, without sacrificing the computation rate. The MBRO method also gives a 20% average improvement in computation rate compared to Lee's Block scheduling method.

A Tutorial on Integrating CDS/ISIS Databases with the World Wide Web

With the emergence of Internet, the global connectivity of computers has become a reality. Internet has progressed to provide many user-friendly tools like Gopher, WAIS, WWW etc. for information publishing and access. The WWW, which integrates all other access tools, also provides a very convenient means for publishing and accessing multimedia and hypertext linked documents stored in computers spread across the world. With the emergence of WWW technology, most of the information activities are becoming Web-centric. Once the information is published on the Web, a user can access this information from any part of the world. A Web browser like Netscape or Internet Explorer is used as a common user interface for accessing information/databases. This will greatly relieve a user from learning the search syntax of individual information systems. Libraries are taking advantage of these developments to provide access to their resources on the Web. CDS/ISIS is a very popular bibliographic information management software used in India. In this tutorial we present details of integrating CDS/ISIS with the WWW. A number of tools are now available for making CDS/ISIS database accessible on the Internet/Web. Some of these are 1) the WAIS_ISIS Server. 2) the WWWISIS Server 3) the IQUERY Server. In this tutorial, we have explained in detail the steps involved in providing Web access to an existing CDS/ISIS database using the freely available software, WWWISIS. This software is developed, maintained and distributed by BIREME, the Latin American & Caribbean Centre on Health Sciences Information. WWWISIS acts as a server for CDS/ISIS databases in a WWW client/server environment. It supports functions for searching, formatting and data entry operations over CDS/ISIS databases. WWWISIS is available for various operating systems. We have tested this software on Windows '95, Windows NT and Red Hat Linux release 5.2 (Appolo) Kernel 2. 0. 36 on an i686. The testing was carried out using IISc's main library's OPAC containing more than 80,000 records and Current Contents issues (bibliographic data) containing more than 25,000 records. WWWISIS is fully compatible with CDS/ISIS 3.07 file structure. However, on a system running Unix or its variant, there is no guarantee of this compatibility. It is therefore safe to recreate the master and the inverted files, using utilities provided by BIREME, under Unix environment.

An economical method for direct numerical simulation studies of transitional round jets

A pseudo-spectral method based on Fourier expansions in a Cartesian coordinate system is shown to be an economical method for direct numerical simulation studies of transitional round jets, Several characteristics of the solutions are presented to establish the validity of the solutions in spite of the unnatural choices. We show that neither periodicity, nor the use of a Cartesian system have adversely affected the simulations, Instead, there are benefits in terms of ease of computing and lack of the usual restrictions due to grid structure near the jet axis. By computing the simultaneous evolution of passive scalers, the process of reaction in round jet burners, between a fuel-laden jet and an ambient oxidizer, was also simulated. Some typical solutions are shown and then the results of analysis of these data are summarized. (C) 2001 Elsevier Science Ltd, All rights reserved.

Direct numerical simulation of turbulent spots

A group of high-order finite-difference schemes for incompressible flow was implemented to simulate the evolution of turbulent spots in channel flows. The long-time accuracy of these schemes was tested by comparing the evolution of small disturbances to a plane channel flow against the growth rate predicted by linear theory. When the perturbation is the unstable eigenfunction at a Reynolds number of 7500, the solution grows only if there are a comparatively large number of (equispaced) grid points across the channel. Fifth-order upwind biasing of convection terms is found to be worse than second-order central differencing. But, for a decaying mode at a Reynolds number of 1000, about a fourth of the points suffice to obtain the correct decay rate. We show that this is due to the comparatively high gradients in the unstable eigenfunction near the walls. So, high-wave-number dissipation of the high-order upwind biasing degrades the solution especially. But for a well-resolved calculation, the weak dissipation does not degrade solutions even over the very long times (O(100)) computed in these tests. Some new solutions of spot evolution in Couette flows with pressure gradients are presented. The approach to self-similarity at long times can be seen readily in contour plots.

Modified kinetic flux vector splitting (m-KFVS) method for compressible flows

To resolve many flow features accurately, like accurate capture of suction peak in subsonic flows and crisp shocks in flows with discontinuities, to minimise the loss in stagnation pressure in isentropic flows or even flow separation in viscous flows require an accurate and low dissipative numerical scheme. The first order kinetic flux vector splitting (KFVS) method has been found to be very robust but suffers from the problem of having much more numerical diffusion than required, resulting in inaccurate computation of the above flow features. However, numerical dissipation can be reduced by refining the grid or by using higher order kinetic schemes. In flows with strong shock waves, the higher order schemes require limiters, which reduce the local order of accuracy to first order, resulting in degradation of flow features in many cases. Further, these schemes require more points in the stencil and hence consume more computational time and memory. In this paper, we present a low dissipative modified KFVS (m-KFVS) method which leads to improved splitting of inviscid fluxes. The m-KFVS method captures the above flow features more accurately compared to first order KFVS and the results are comparable to second order accurate KFVS method, by still using the first order stencil. (C) 2011 Elsevier Ltd. All rights reserved.

A new parallel overlapped domain decomposition method for nonlinear dynamic finite element analysis

In this paper a new parallel algorithm for nonlinear transient dynamic analysis of large structures has been presented. An unconditionally stable Newmark-beta method (constant average acceleration technique) has been employed for time integration. The proposed parallel algorithm has been devised within the broad framework of domain decomposition techniques. However, unlike most of the existing parallel algorithms (devised for structural dynamic applications) which are basically derived using nonoverlapped domains, the proposed algorithm uses overlapped domains. The parallel overlapped domain decomposition algorithm proposed in this paper has been formulated by splitting the mass, damping and stiffness matrices arises out of finite element discretisation of a given structure. A predictor-corrector scheme has been formulated for iteratively improving the solution in each step. A computer program based on the proposed algorithm has been developed and implemented with message passing interface as software development environment. PARAM-10000 MIMD parallel computer has been used to evaluate the performances. Numerical experiments have been conducted to validate as well as to evaluate the performance of the proposed parallel algorithm. Comparisons have been made with the conventional nonoverlapped domain decomposition algorithms. Numerical studies indicate that the proposed algorithm is superior in performance to the conventional domain decomposition algorithms. (C) 2003 Elsevier Ltd. All rights reserved.