Search or add a thesis

Advanced Search (Beta)
Home > Numerical Simulation of Some Boundary Layer Flow Problems

Numerical Simulation of Some Boundary Layer Flow Problems

Thesis Info

Access Option

External Link

Author

Kashif Ali

Program

PhD

Institute

Bahauddin Zakariya University

City

Multan

Province

KPK

Country

Pakistan

Thesis Completing Year

2016

Thesis Completion Status

Completed

Subject

Mathemaics

Language

English

Link

http://prr.hec.gov.pk/jspui/bitstream/123456789/9829/1/Kashif%20Ali_BZU_2016.pdf

Added

2021-02-17 19:49:13

Modified

2024-03-24 20:25:49

ARI ID

1676726777811

Similar


The purpose of this thesis is to present the numerical study of some boundary layer flow and heat transfer problems related to the channel with stretching/shrinking walls, orthogonally moving disks, stretching cylinder, vertical square duct, the stagnation point flow and the pulsatile flow. The study includes the self-similar problems and also the ones for which no similarity solution exists. For the problems of first type, a similarity transformation is used to convert the governing Navier-Stokes equations into a set of nonlinear third or fourth order ODEs. The ones of third order are solved by using the order-reduction technique whereas the later are solved by employing quasi-linearization or pseudo transient approach in which the time plays the role of an iteration parameter until the convergence is reached. In case of second type problems, we have used the three step explicit Runge-Kutta method for the numerical study of the unsteady pulsatile flow of a biofluid in the channel, whereas the numerical simulation in a vertical duct has been carried out by employing the Spectral method and the finite difference method. We have studied the flow and thermal properties of not only the Newtonian fluid but also the biofluid (blood), micropolar and Nano fluids as well. The effects of the governing parameters on different aspects of the problems are discussed through tables and figures.
Loading...
Loading...

Similar Books

Loading...

Similar Chapters

Loading...

Similar News

Loading...

Similar Articles

Loading...

Similar Article Headings

Loading...

صفی ؔ

جناب صفیؔ
افسوس ہے کہ ہماری پرانی بزمِ شعروسخن کی یادگاریں ایک ایک کر کے اٹھتی جاتی ہیں ابھی چند مہینے ہوئے جناب صفی ہم سے جدا ہوئے تھے کہ گذشتہ مہینہ جناب آرزو نے الوداع کہا، یہ دونوں اپنے فن کے باکمال اساتذہ اور اردوزبان کے بڑے خدمت گذار تھے، صفی نے لکھنو کے قدیم رنگِ تغزل کی اصلاح کے ساتھ قومی و ملی نظموں کا مذاق پیدا کیا جو لکھنو کے شعراء میں بہت کم بلکہ نہ ہونے کے برابر تھا، ان کی بعض پرانی نظمیں اتنی مقبول ہوئیں کہ ان کے اشعار اب تک لوگوں کی زبانوں پر ہیں۔
(شاہ معین الدین ندوی،مئی ۱۹۵۱ء)

موجودہ معاشرتی اضطراب اور اس کا حل: سیرت طیبہﷺ کی روشنی میں

Social anxiety is the fear of interaction with other people that brings on self-consciousness, feelings of being negatively judged and evaluated, and, as a result, leads to avoidance. Social anxiety is the fear of being judged and evaluated negatively by other people, leading to feelings of inadequacy, inferiority, embarrassment, humiliation, and depression. The major causes of Social anxiety are Rights abuses, Provocation, corruption, murder, Law-lessens, nepotism, Prejudices, grouping, Propaganda and carelessness. All of these things are causes of the destruction of a prosperous society. Because of these each individual of society remains restive and society become victims of violence. In this paper the social anxiety conditions and its solution will be described in detail in the light of seerah.

Improving Resource Allocation in Desktop Grid Systems Through Group Based Scheduling and Predictive Analytics

Desktop grid systems are one of the largest paradigms of distributed computing in the world. The idea is to use the idle and underutilized processing cycles and memory of the desktop machines to support large scale computation. The design issues in desktop grid systems are much more complex as compared to traditional grid environment because the hosts (desktop machines) participating in the computation do not work under one administrative control and can become unavailable at any point in time. The heterogeneity and volatility of computing resources, for example, diversity of memory, processors, and hardware architectures also play its role. To get fruitful results from such hostile environment, scheduling tasks to better hosts become one of the most important issues. The thesis focuses on the issue of task scheduling and resource allocation in desktop grid systems and presents concrete contributions in two separate areas. The first contribution of the thesis is about minimizing the applications turnaround time on desktop grid systems that can only be achieved through knowledgeable task scheduling mechanism. A Group based Fault Tolerant Scheduling and Replication Mechanism (labeled as GFTSRM) is proposed that uses collective impact of CPU and RAM, task completion history and spot checking to populate available hosts in relevant groups to perform group based task scheduling. It is shown that grouping the hosts on the basis of computing strength and behavior is necessary for better performance. Relevant replication strategies are appended to each group in order to reduce the wastage of processing cycles. Simulations are performed by using GFTSRM, FCFS (First Come First Serve) and PRI-CR-Excl (host exclusion based on the fixed threshold of clock rate). GFTSRM is compared with FCFS because it is the most commonly used task scheduling mechanism. PRI-CR-Excl is used for comparison with the proposed group based scheduling mechanism that takes into account “collective impact of CPU and RAM” while on the contrary PRI-CR-Excl excludes hosts on the fixed threshold of clock rate. The simulation results show that GFTSRM reduces the application turnaround time by more than 35% as compared to FCFS. The proposed group based scheduling mechanism also depicted improvement of more than 20% on application completion time as compared to PRI-CR-Excl. The second contribution of the thesis is about predicting the host availability in desktop grid systems by using Predictive Analytics (PA) that can help in scheduling tasks to highly available hosts. A comprehensive, high-level evaluation of standard PA techniques to predict host availability in desktop grids is presented with the aim to determine the relatively better algorithms. This work goes a step-ahead than related work in which researchers have applied a single PA approach to a standard desktop grid setting. The work addressed both PA perspectives, i.e., classification and regression and used the following standard classification algorithms: k-Nearest Neighbour (k-NN) for Lazy Learning technique, Naïve Bayes for Bayesian learning technique, LibSVM library for Support Vector Modeling (SVM) technique, Random Forest for Tree Induction technique, and Multi-Layer Perceptron (MLP) for Neural Network technique. It is found that the level of selected threshold for availability is critical for acquiring accurate predictions, and k-NN gives the best accuracy across all thresholds. Also, precision-wise, SVM gives perfect performance (100%) across all thresholds followed closely by Neural Networks. Multiple Linear Regression (MLR), Polynomial Regression (PR) and MLP are used for regression, and it is found that MLP gives the best performance, followed by PR and MLR.