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

Multiprogramming, how response times are reduced by allowing time sharing o...

how response times are reduced by allowing time sharing on top of multiprogramming

Write a short note about the different states of a process, Write a short n...

Write a short note about the different STATES of a process. As a process implement it changes state. The state of a process is described in part by the current activity of that

Describe the state when you run an unlink operation, Describe when you run ...

Describe when you run an unlink() operation to remove a file on the ext3 file system. Be specific about what disk blocks have to be written where in what order. State your assumpti

Paging, what is the use of valid invalid bits in paging

what is the use of valid invalid bits in paging

Explain wait for graph, Explain Wait for Graph a. Use a resource alloca...

Explain Wait for Graph a. Use a resource allocation graph to derive a wait-for graph.  b. Wait-for graph acquired by making an edge from p 1 to p 2 iff p 1 is waiting for

Inter-process Communication !, My code it didn''t run properly ,i tried to ...

My code it didn''t run properly ,i tried to pass 2 parameter example : ./a.out ls -ll ,but it execute only the ls instead of the ls -ll ! plz help amd thank you ! #include #inclu

How relocation bits used by relocating loader are specified, Relocation bit...

Relocation bits employed by relocating loader are specified by Relocation bits employed by relocating loader are specified by Assembler or Translator

How the nested macro calls are expanded, How the Nested Macro calls are exp...

How the Nested Macro calls are expanded LIFO (Last in First out)

What is graceful degradation, What is graceful degradation? In multipro...

What is graceful degradation? In multiprocessor systems, failure of single processor will not halt the system, but only slow it down by sharing the work of failure system by ot

Binary and data representation, Computing uses three number bases:- Binary ...

Computing uses three number bases:- Binary (base 2), Octal (base 8) and Hexadecimal (base 16). Binary has been described before, although various catchphrases are used to describe

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