Crank-nicolson timestepping schemes, Operating System

Assignment Help:

For the heat conduction problem, investigate the effects on the numerical solution of the following aspects:

1. non-uniform meshes with re?nement at both ends versus a uniform mesh;

2. fully implicit versus Crank-Nicolson timestepping schemes (compare accuracy and demonstrate any non-physical solution behaviour).For the contaminant transport problem, investigate the effects on the numerical solution of the following aspects:

1. fully implicit versus Crank-Nicolson timestepping schemes (compare accuracy and demonstrate any non-physical solution behaviour);

2. averaging versus upwinding advection schemes (compare accuracy and demonstrate any non-physical solution behaviour). For each investigation, you should compare the numerical solution to the exact solution and document your ?ndings in the report. You will be marked on the relevance and effectiveness of your presented results at investigating the above effects, and on your analysis of your results and how they relate to the theory covered in lectures.


Related Discussions:- Crank-nicolson timestepping schemes

Why global variables are unacceptable, Why Global variables are unacceptabl...

Why Global variables are unacceptable Global variable, for instance, are unacceptable because they break the rules of self - containment. If all procedural components are runni

Define file permission in unix, The permission function is used to calculat...

The permission function is used to calculate what, if any access each class or level of user has to each file on a Unix machine. The permission task is one of the data components s

Operating system, What criteria are important in choosing a file organisati...

What criteria are important in choosing a file organisation?

Illustrate example for segmentation, EXAMPLE FOR SEGMENTATION Consider ...

EXAMPLE FOR SEGMENTATION Consider an instance as given in the table and we have five segments numbered from 0 through 4 the segment is stock in the physical memory as shown. Th

How can deadlocks be represented?, How can deadlocks be represented? D...

How can deadlocks be represented? Deadlocks are able to be described in terms of a directed graph called as a system resource-allocation graph. This graph contains of the foll

What is low-level formatting, What is low-level formatting? Before a di...

What is low-level formatting? Before a disk can kept data, it must be required into sectors that the disk controller can read and write. This procedure is called low-level form

Explain hashed page table method, Hashed page table method A general ap...

Hashed page table method A general approach for managing address spaces larger than 32 bits is to use a hashed page table with the hash values being the virtual-page number.

What are threads?, What are threads? A thread is alike to sequential pr...

What are threads? A thread is alike to sequential programs. Single threads have a beginning, sequence and end. At any given point in time during the runtime of the thread there

Reference counting, The idea of reference counting is to maintain, for ever...

The idea of reference counting is to maintain, for every object, the total number of references to that object, i.e. the number of "incoming" pointers. Whenever the number of refer

Explain structure, Explain Structure The Grammar for programming langua...

Explain Structure The Grammar for programming language is a formal description of Structure

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd