We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

# GDB solution of mth603 last date July 09, 2012 to July 11, 2012

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

Views: 1067

### Replies to This Discussion

idea solution

Predictor–corrector method is an algorithm thatproceeds in two steps. First, the prediction step calculates a roughapproximation of the desired quantity. Second, the corrector step refines theinitial approximation using another means. A predictor­­–corrector methodtypically uses an explicit method for the predictor step and animplicit method for the corrector step. A simple predictor–corrector method canbe constructed from the Eulermethod (an explicit method) and the trapezoidal rule (an implicit method).
Effectivenessand Characteristics

The idea behind the predictor-corrector methods is to use asuitable combination of an explicit and an implicit technique to obtain amethod with better convergence characteristics Runge Kutta method Euler Method, Trapezoidal Rule arepredictor corrector methods

dua gee..*_*  gud keep it up

thanks tariq bhiaaa

welcm sis

ji bayata ji

Nabila ch hmm gud

Predictor–corrector method is an algorithm thatproceeds in two steps. First, the prediction step calculates a roughapproximation of the desired quantity. Second, the corrector step refines theinitial approximation using another means. A predictor­­–corrector methodtypically uses an explicit method for the predictor step and animplicit method for the corrector step. A simple predictor–corrector method canbe constructed from the Eulermethod (an explicit method) and the trapezoidal rule (an implicit method).

1. The P-C methods may provide both high accuracy and the capability of error monitoring,all at a potentially lower computational cost than RK-Fehlberg or RK-Merson methods.For example, the Adams-Moulton method (3.34) has the error of the same (fourth) orderas the aforementioned RK methods, while requiring k + 1 function evaluations, where kis the number of times one has to iterate the corrector equation. If k < 4, then Adam-Moulton requires fewer function evaluations than either RK-Merson or RK-Fehlberg
2. The adjustment of the step size in P-C methods is awkward (as it is in all multistepmethods); see the end of Sec. 3.1 and Remark 3 above.
3. One may ask, why not just halve the step size of the Adams-Bashforth method (whichwould reduce the global error by a factor of 24 = 16, i.e. a lot) and then use it alonewithout the Adams-Moulton corrector formula? The answer is this. First, one willthen lose the ability to monitor the error. Second, the Adams-Bashforth may sometimesproduce a numerical solution which has nothing to do with the exact solution, whilethe P-C Adams-Moulton's solution will stay close to the exact one.

## Latest Activity

1 minute ago
3 minutes ago
Muhammad Azeem, Muhammad Yaseen, Sumblina Tanvir and 16 more joined Virtual University of Pakistan
4 minutes ago
5 minutes ago
8 minutes ago
21 minutes ago
24 minutes ago
25 minutes ago
26 minutes ago
27 minutes ago
28 minutes ago
+M.Tariq Malik added a discussion to the group MGT522 Introduction to Public Policy

28 minutes ago

1

2

3