0% found this document useful (0 votes)
10 views2 pages

Unit 2 CFD

UNIT -03 FOR FLUID DYNMAICS
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views2 pages

Unit 2 CFD

UNIT -03 FOR FLUID DYNMAICS
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

2 (A) The most common boundary conditions used in

computational fluid dynamics are

1. Intake conditions.
2. Symmetry conditions.
3. Physical boundary conditions.
4. Cyclic conditions.
5. Pressure conditions.
6. Exit conditions.

2 (B) The finite-element method starts with a variational


statement of the problem and introduces piecewise definitions of
the functions defined by a set of mesh point values.

The finite-difference method starts with a differential statement


of the problem and proceeds to replace the derivatives with their
discrete analogs. In dynamics problems, finite-element equations
are invariably integrated forward in time with finite-difference
techniques rather than using a time dimension on an element
and using the integration scheme that yields results.

The finite-difference method has found the variational


approach of the finite-element method useful in producing
symmetric difference equations, the discrete analog of a system
of self-adjoint differential equations, and something that has
eluded finite-difference approximations for some time. The object
in the finite-element method is to construct a family of
functions with piecewise definitions over regions, in this case,
intervals that are sufficiently general in character and in which
the actual solution may be approximated as closely as desired.
A finite difference method discretization is based upon the differential form of the PDE to be
solved. Each derivative is replaced with an approximate difference formula. The computational
domain is usually divided into hexahedral cells and the solution will be obtained at each nodal
point.The discretization results in a system of equation of the variable at nodal points, and once a
solution is found, then we have a discrete representation of the solution.

Finite element method is a numerical technique for finding approximate solutions to boundary
value problems for partial differential equations.Capable of handling extremely complicated, time-
dependent geometries and two-phase flow.The computational domain is divided up into smaller
domains (finite elements) and the solution in each element is constructed from the basis
functions. The actual equations that are solved are typically obtained by restating the
conservation equation in weak form: the field variables are written in terms of the basis functions,
the equation is multiplied by appropriate test functions, and then integrated over an element.
2 (C) Explicit methods calculate the state of a system at a later time from the state of the system
at the current time, while implicit methods find a solution by solving an equation involving both
the current state of the system and the later one.

The explicit method is fast and inexpensive computationally. However errors


accumulate and the answer will diverge over time form the answer you are
trying to model Also there can be a tendency to stimulate high frequency
components of the model which are often artifacts of the modeling process
and numerical procedure, not the physics.

Implicit methods are more computationally intensive, but tend to have


reduced errors as the simulation progresses. Implicit methods, however, can
introduce an artificial phase shift: the model responds more slowly to forcing
functions than the actual physical system.

In the explicit solution, parameters are calculated based on previous levels *(e.g.time
level):
x(n+1) = x(n)+ z(n)
In the implicit scheme, parameters are dependent on each other at the same time
level:
x(n+1) = x(n)+z(n+1)
Implicit methods are more complicated to use but usually much more stable. And so
larger time steps can be implemented.
Good thing about Implicit Schemes is that they don’t have to satisfy any stability conditions.
They are unconditionally stable. But they are computationally expensive as you need more
storage space for [K] matrix and need sophisticated algorithms to solve.

This is an explicit scheme called FTCS (Forward differencing in Time and Central differencing
in Space at time level n) for solving a 1-D heat equation. Explicit Schemes have to satisfy
stability conditions in order for solution to converge

You might also like