hw10 - y ( t ) on 0 t 1. Consider the 4 methods 1 Method 1...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Homework 10 Foundations of Computational Math 2 Spring 2011 Solutions will be posted Monday, 4/11/11 Problem 10.1 Consider the following linear multistep method: y n = - 4 y n 1 + 5 y n 2 + h (4 f n 1 + 2 f n 2 ) The method is not 0-stable. 10.1.a . Determine, p , the order of consistency of the method. 10.1.b . Determine the coeFcient, C p +1 , in the discretization error d n . 10.1.c . Consider the application of the method to y = 0 with y 0 = 0 and y 1 = ǫ , i.e., a perturbed initial condition. Show that | y n | → ∞ as n → ∞ , i.e., the numerical method is unstable. Problem 10.2 Consider the following linear multistep method: y n = y n 2 + h 3 ( f n + 4 f n 1 + f n 2 ) The method is 0-stable but it is weakly stable. 10.2.a . Determine the discretization error d n . 10.2.b . Consider the application of the method to y = λy . Write the recurrence that yields y n . 10.2.c . Show that | y n | → ∞ as n → ∞ , i.e., the numerical method is unstable. Problem 10.3 Recall, our model problem f = λ ( y - F ( t )) + F ( t ) y (0) = y 0 y ( t ) = ( y 0 - F (0)) e λt + F ( t ) Take F ( t ) = sin t and y (0) = 1 and consider
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: y ( t ) on 0 t 1. Consider the 4 methods 1 Method 1 y n =-4 y n 1 + 5 y n 2 + h (4 f n 1 + 2 f n 2 ) Method 2 explicit midpoint y n = y n 2 + 2 hf n 1 Method 3 Adams Bashforth two-step y n = y n 1 + h 2 (3 f n 1-f n 2 ) Method 4 BDF two-step y n = 4 3 y n 1-1 3 y n 2 + 2 3 hf n Apply the 4 methods to the model problem using exact initial conditions, i.e., y = y (0) and y 1 = y ( h ). Use h = 0 . 01 for = 10, =-10, and =-500. Explain your results. How would reducing the stepsize h aect the results? Note it is recommended you implement this as a simple piece of code in, e.g., MATLAB. You need not turn in your code. Simply present the solution values you observe for the required numerical integrations in support of you explanations. 2...
View Full Document

This note was uploaded on 11/10/2011 for the course MAD 5404 taught by Professor Gallivan during the Spring '11 term at FSU.

Page1 / 2

hw10 - y ( t ) on 0 t 1. Consider the 4 methods 1 Method 1...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online