Consider the pendulum equation (w = 1 case),0 = v, v = – sin (0). There are "two" ways of implementing the forward Euler method: An+1 vn+1 = An+1 vn +1 = = = θη + Δt.vn vn - At sin (en) or if we use the most up-to-date value of the angle for the second equation, 1 θη + Δt. vn vn_ At sin (n+¹). Code each method and plot (t) and H (0 (t), v (t)) =v² - co t = [0, 10], and for an appropriate At. 1 What are your conclusions? 2 Try to show that the second approach guarantees that the discrete Hamil- tonian, Hn is bounded Vtn = n. At. cos (6), for 3 Using the second approach, write a code that "draws numerically" the phase portrait for the pendulum equation (e.g. figure 6.7.3 in the book).

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Consider the pendulum equation (w = 1 case),Ỏ = v, v = − sin (0). There are
"two" ways of implementing the forward Euler method:
An+1
vn +1
An+1
vn +1
=
=
or if we use the most up-to-date value of the angle for the second equation,
=
θη + Δt · υπ
vn At sin (n)
1
= θη + Δt.·υη
vn
At sin (0+¹).
Code each method and plot 0 (t) and H (0 (t), v (t)) = ¼½v² -
t = [0, 10], and for an appropriate At.
1 What are your conclusions?
2 Try to show that the second approach guarantees that the discrete Hamil-
tonian, Hn is bounded Vtn = n. At.
cos (0), for
3 Using the second approach, write a code that "draws numerically" the
phase portrait for the pendulum equation (e.g. figure 6.7.3 in the book).
Transcribed Image Text:Consider the pendulum equation (w = 1 case),Ỏ = v, v = − sin (0). There are "two" ways of implementing the forward Euler method: An+1 vn +1 An+1 vn +1 = = or if we use the most up-to-date value of the angle for the second equation, = θη + Δt · υπ vn At sin (n) 1 = θη + Δt.·υη vn At sin (0+¹). Code each method and plot 0 (t) and H (0 (t), v (t)) = ¼½v² - t = [0, 10], and for an appropriate At. 1 What are your conclusions? 2 Try to show that the second approach guarantees that the discrete Hamil- tonian, Hn is bounded Vtn = n. At. cos (0), for 3 Using the second approach, write a code that "draws numerically" the phase portrait for the pendulum equation (e.g. figure 6.7.3 in the book).
Expert Solution
steps

Step by step

Solved in 4 steps with 6 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY