Scribd
Upload
50 views2 pages

Assignment 2 - Due 9/22

The document provides instructions for Assignment 2, which is due on September 22nd. Students must submit one summary report for each programming project, which can be submitted in print or electronically by 11:30PM on the due date. The assignment consists of 5 problems related to numerical analysis and computing roots. Students are also asked to write a program implementing the bisection, Newton, or secant method to find all roots of the equation 1 - x tan x = 0 between 0 and 100.

Uploaded by

Harsh Vardhan Dubey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
50 views2 pages

Assignment 2 - Due 9/22

The document provides instructions for Assignment 2, which is due on September 22nd. Students must submit one summary report for each programming project, which can be submitted in print or electronically by 11:30PM on the due date. The assignment consists of 5 problems related to numerical analysis and computing roots. Students are also asked to write a program implementing the bisection, Newton, or secant method to find all roots of the equation 1 - x tan x = 0 between 0 and 100.

Uploaded by

Harsh Vardhan Dubey
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment 2 – Due 9/22

All written assignments are due in the class on the specified date. One summary report is re-
quired for each programming project. You may hand in a printed copy of your report in class
on the due day and email all of your source codes (with instruction on how to compile and run)
before 11:30PM of the same day. Or, you may email all of your source codes and the report in an
electronic format before 11:30PM on the due date.
Grading: Total is 100 points, with 40 for the programming assignment and 15 for each of the
regular problems.

1. A sequence {xn } is said to converge superlinearly to α if

|α − xn+1 | ≤ cn |α − xn |, n≥0

with cn → 0 as n → ∞. For a superlinearly convergent sequence {xn }, prove that

|α − xn |
lim =1
n→∞ |xn+1 − xn |
.
i.e., |α − xn | = |xn+1 − xn | is increasingly valid as n → ∞, if xn 6= α for any n.

2. Assuming x0 is sufficiently close to α, which of the following iterations converge to the


given fixed point α? Give the convergence order if it does converge, and give the rate of
convergence if it converges linearly.
12
a) xn+1 = −16 + 6xn + , α=2
xn
2 1 √
3
b) xn+1 = xn + 2 , α= 3
3 xn
12
c) xn+1 = , α=3
1 + xn
3. Assuming x0 is sufficiently close to α, show that

xn (x2n + 3a)
xn+1 = , n≥0
3x2n + a
√
is a third-order method for computing a. Compute
√
a − xn+1
lim √
n→∞ ( a − xn )3

4. Let α be the smallest positive root of

f (x) = 1 + cos x.

1
(a) What is the order of convergence of Newton’s method for α, if the initial guess x0 is
sufficiently close to α?
(b) To possibly accelerate convergence, we use a modified Newton’s method,

f (xn )
xn+1 = xn − C .
f 0 (xn )

Find the constant C for which this iteration converges fastest, and determine the order
of convergence.

5. Programming Assignment: Write a program to implement one of the three methods (bi-
section, Newton, secant) to compute all the roots in [0, 100] for equation 1 − x tan x = 0.
(Note that x tan x is a monotone function in each period of tan x.)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy