|
About 3307 results. 1294 free access solutions
| № |
Condition |
free/or 0.5$ |
| m55307 | Repeat Exercise 1, using instead the triangles
T1: (0, 0.75), (0, 1), (0.25, 0.75);
T2: (0.25, 0.5), (0.25, 0.75), (0.5, 0.5);
T3: (0, 0.5), (0, 0.75), (0.25, 0.75);
T4: (0, 0.5), (0.25, 0.5), (0.25, 0.75).
Repeat exercise 1 |
buy |
| m55308 | Repeat Exercise 1 using Simpson s rule.
In Exercise 1 |
buy |
| m55309 | Repeat Exercise 1 using Taylor s method of order four.
In Exercise 1
a. y = te3t − 2y, 0≤ t ≤ 1, y(0) = 0, with h = 0.5
b. y = 1 + (t − y)2, 2≤ t ≤ 3, y(2) = 1, with h = 0.5
c. y = 1 + y/t, 1≤ t ≤ 2, y(1) = 2, with h = 0.25
d. y = cos 2t + sin 3t, 0≤ t ≤ 1, y(0) = 1, with h = 0.25 |
buy |
| m55310 | Repeat Exercise 1 using the Adams fourth-order predictor-corrector method.
In Exercise 1 |
buy |
| m55311 | Repeat Exercise 1 using the algorithm developed in Exercise 5.
In Exercise 1
a. u 1 = 3u1 + 2u2 − (2t2 + 1)e2t , u1(0) = 1;
u 2 = 4u1 + u2 + (t2 + 2t − 4)e2t , u2(0) = 1; 0 ≤ t ≤ 1; h = 0.2; |
buy |
| m55312 | Repeat Exercise 1 using the Crank-Nicolson Algorithm.
Repeat exercise 1 |
buy |
| m55313 | Repeat Exercise 1 using the Gauss-Seidel method.
In Exercise 1
a. 3x1 − x2 + x3 = 1,
3x1 + 6x2 + 2x3 = 0,
3x1 + 3x2 + 7x3 = 4.
b. 10x1 − x2 = 9,
−x1 + 10x2 − 2x3 = 7,
− 2x2 + 10x3 = 6.
c. 10x1 + 5x2 = 6,
5x1 + 10x2 − 4x3 = 25,
− 4x2 + 8x3 − x4 = −11,
− x3 + 5x4 = −11.
d. 4x1 + x2 + x3 + x5 = 6,
−x1 − 3x2 + x3 + x4 = 6,
2x1 + x2 + 5x3 − x4 − x5 = 6,
−x1 − x2 − x3 + 4x4 = 6,
2x2 − x3 + x4 + 4x5 = 6 |
buy |
| m55314 | Repeat Exercise 1 using the Inverse Power method.
In exercise
Find the first three iterations obtained by the Power method applied to the following matrices.
a.
Use x(0) = (1,−1, 2)t.
b.
Use x(0) = (−1, 0, 1)t.
c.
Use x(0) = (−1, 2, 1)t.
d.
Use x(0) = (1,−2, 0, 3)t. |
buy |
| m55315 | Repeat Exercise 1 using the Midpoint method.
In Exercise 1 |
buy |
| m55316 | Repeat Exercise 1 using the Midpoint rule.
In Exercise 1 |
buy |
| m55317 | Repeat Exercise 1 using the modified Newton s method described in Eq. (2.13). Is there an improvement in speed or accuracy over Exercise 1? |
buy |
| m55318 | Repeat Exercise 1 using the results of Exercise 7.
In Exercise 1
a. f (x) = x2 + 3x + 2, [0, 1];
b. f (x) = x3, [0, 2];
c. f (x) = 1/x, [1, 3];
d. f (x) = ex , [0, 2];
e. f (x) = 1/2 cos x + 1/3 sin 2x, [0, 1];
f. f (x) = x ln x, [1, 3]. |
buy |
| m55319 | Repeat Exercise 1 using the Runge-Kutta fourth-order method.
In Exercise 1 |
buy |
| m55320 | Repeat Exercise 1 using the Runge-Kutta method of order four with N = 1.
Repeat exercise
The nonlinear system
f1(x1, x2) = x21 − x22 + 2x2 = 0, f2(x1, x2) = 2x1 + x22− 6 = 0 |
buy |
| m55321 | Repeat Exercise 1 using the Runge-Kutta method of order four.
In Exercise 1 |
buy |
| m55322 | Repeat Exercise 1 using the Trapezoidal Algorithm with TOL = 10−5.
In Exercise 1 |
buy |
| m55323 | Repeat Exercise 10 using Algorithm 6.1 in Maple with Digits:= 10.
In Exercise 10
a. 58.9x1 + 0.03x2 = 59.2,
−6.10x1 + 5.31x2 = 47.0 |
buy |
| m55324 | Repeat Exercise 10 using Algorithm 6.2 in Maple with Digits:= 10.
In Exercise 10
a. 58.9x1 + 0.03x2 = 59.2,
−6.10x1 + 5.31x2 = 47.0 |
buy |
| m55325 | Repeat Exercise 10 using Algorithm 6.3 in Maple with Digits:= 10.
In Exercise 10
a. 58.9x1 + 0.03x2 = 59.2,
−6.10x1 + 5.31x2 = 47.0 |
buy |
| m55326 | Repeat Exercise 10 using Gaussian elimination with complete pivoting and three-digit rounding arithmetic.
In Exercise 10
a. 58.9x1 + 0.03x2 = 59.2,
−6.10x1 + 5.31x2 = 47.0 |
buy |
|