这是一篇美国的关于数值分析的**python代写**

1. Show that if f(t,y)= g(t), the improved Euler method reduces to the simple trapezoidal rule quadrature and the classical fourth-oder RK method reduces to the simple Simpson’s rule quadrature.

2.Prove that all one-step methods are D-stable.

3. Consider the Leap Frog (also called midpoint) method

y”+1-y”-1=2△tf”.

(a) Show that it is D-stable and consistent, hence convergent.

(b) Show that the two roots of π（s，z）= p（ξ）- zo（≤）， Si and &must lie on the unit circle if z is in the A-stability region of this method and this occur only when z=ib, where b∈R and |b|<1. Therefore, the region of A-stability of the Leap Frog method is the open interval (一i,i). Hint: [Sill-a| =1 and each root is solution ofξ-1/5=2z.

**13.1 Introduction **

In this chapter we study numerical methods for the initial value problem(IVP)：

Here, *f *is a given function of the independent variable *t *and the unknown function *y*, and *α *is a constant. Often, *t *represents time but does not have

- Equation (13.2) is called the initial condition. Without loss of generality we will often take
*t*0 = 0.The time derivative is also frequently denoted with a dot (especially in physics) or an apostrophe

In (13.1)-(13.2), *y *and *f *may be vector-valued, in which case we have an IVP for a system of ordinary difffferential equations (ODEs).

**Example 13.1. **

*y**0 *(*t*) = *t*sin *y*(*t*)*, *0 *< t **≤ *2*π, *

*y*(0) = *α.*

**Example 13.2.**

*y’*1(*t*) = *y*1(*t*)*y*2(*t*) *− **y*21(*t*)*,*

*y’*2(*t*) = *−**y*2(*t*) + *t*2 cos*y*1(*t*)*, *0 *< t **≤ **T,*

*y*1(0) = *α*1*, y*2(0) = *α*2*. *

These two are examples of fifirst order ODEs. It is the type of IVP’s we will focus on. Higher order ODEs can be written as fifirst order systems by introducing new variables as we illustrate in the next two examples.

**Example 13.3. ***The Harmonic Oscillator.*

*y ”** *(*t*) + *k*2*y*(*t*) = 0*.*

*If we defifine*

*y*1 = *y, *

*y*2 = *y’**,*

*we get*

*y*1*0*(*t*) = *y*2(*t*)*,*

*y’*2(*t*) = *−**k*2*y*1(*t*)*.*

**Example 13.4. **

*y **000 *(*t*) + 2*y*(*t*)*y **00 *(*t*) + cos *y**0 *(*t*) + *e**t *= 0*. *

*Introducing **the variables*

*y*1 = *y, *

*y*2 = *y**‘ **, *

*y*3 = *y **” **,*

*we obtain the fifirst order system: *

*y*1*‘*(*t*) = *y*2(*t*)*, *

*y’*2(*t*) = *y*3(*t*)*, *

*y’*3(*t*) = *−*2*y*1(*t*)*y*3(*t*) *− *cos *y*2(*t*) *− **e**t*

If *f *does not depend explicitly on *t *we call the ODE (or the system of ODEs) **autonomous**. We can turn a non-autonomous system into an autonomous one by introducing *t *as a new variable.

**Example 13.5. ***Consider the ODE *

*y**‘*(*t*) = sin *t **− **y*2(*t*)*.*

*If we defifine*

*y*1 = *y, *

*y*2 = *t,*

*we can write this ODE as the autonomous system *

*y*1*0*(*t*) = sin *y*2(*t*) *− **y*21(*t*),

*y**‘*2(*t*) = 1*.*

Continuity of *f *guarantees *local *existence of solutions but not uniqueness.We need an extra assumption on *f *to ensure uniqueness of solutions.

**程序辅导定制C/C++/JAVA/安卓/PYTHON/留学生/PHP/APP开发/MATLAB**

本网站支持 Alipay WeChatPay PayPal等支付方式

**E-mail:** vipdue@outlook.com **微信号:**vipnxx

如果您使用手机请先保存二维码，微信识别。如果用电脑，直接掏出手机果断扫描。