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

Define maintaining data on a per client basis, Define Maintaining Data on a...

Define Maintaining Data on a Per Client Basis Perhaps the most dramatic syntactical programming change for the application developer of client – server applications is maintain

What is scheduler, What is scheduler? A process migrates among the vari...

What is scheduler? A process migrates among the various scheduling queues throughout its life time. The OS must choose processes from these queues in some fashion. This selecti

Hi, is the operating system windows sometimes interupts

is the operating system windows sometimes interupts

What are the advantages of linked allocation, What are the advantages of Li...

What are the advantages of Linked allocation? The benefits are a. No external fragmentation b. Size of the file does not require to be declared

Explain lru second chance algorithm, Second chance Algorithm When the p...

Second chance Algorithm When the page is chosen the reference bit is checked to see whether it has been referenced before. If that is the case after that it is given a second c

What is demand paging, What is Demand paging? Virtual memory is commonl...

What is Demand paging? Virtual memory is commonly executed by demand paging. In demand paging, the pager brings only those essential pages into memory instead of swapping in a

How does communication takes place in a distributed system?, How does commu...

How does communication takes place in a distributed system? Distributed systems depend on the networking for their functionality. A network is a communication path among two

Explain additional-reference-bits algorithm, Additional-reference-bits algo...

Additional-reference-bits algorithm We can keep an 8-bit byte for every page in a table in memory. The operating system shifts the reference bits right 1 bit, discarding the lo

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