|
About 3307 results. 1294 free access solutions
| № |
Condition |
free/or 0.5$ |
| m55347 | Repeat Exercise 18 using the results of Exercise 8.
In Exercise 18
a. y(0.54) and y(0.94)
b. y(1.25) and y(1.93)
c. y(1.3) and y(2.93)
d. y(0.54) and y(0.94) |
buy |
| m55349 | Repeat Exercise 2 using ω = 1.3.
In Exercise 2
a. 4x1 + x2 − x3 = 5,
−x1 + 3x2 + x3 = −4,
2x1 + 2x2 + 5x3 = 1.
b. −2x1+ x2 + 1/2 x3 = 4,
x1−2x2 - 1/2 x3 = −4,
x2 + 2x3 = 0.
c. 4x1 + x2 − x3 + x4 = −2,
x1 + 4x2 − x3 − x4 = −1,
−x1 − x2 + 5x3 + x4 = 0,
x1 − x2 + x3 + 3x4 = 1.
d. 4x1 − x2 = 0,
−x1 + 4x2 − x3 = 5,
− x2 + 4x3 = 0,
+ 4x4 − x5 = 6,
− x4 + 4x5 − x6 = −2,
− x5 + 4x6 = 6. |
buy |
| m55350 | Repeat Exercise 2 using Algorithm 6.2.
In Exercise 2
a. 13x1 + 17x2 + x3 = 5,
x2 + 19x3 = 1,
12x2 − x3 = 0
b. x1 + x2 − x3 = 0,
12x2 − x3 = 4,
2x1 + x2 + x3 = 5
c. 5x1 + x2 − 6x3 = 7,
2x1 + x2 − x3 = 8,
6x1 + 12x2 + x3 = 9
d. x1 − x2 + x3 = 5,
7x1 + 5x2 − x3 = 8,
2x1 + x2 + x3 = 7 |
buy |
| m55351 | Repeat Exercise 2 using complete pivoting.
In Exercise 2
a. 13x1 + 17x2 + x3 = 5,
x2 + 19x3 = 1,
12x2 − x3 = 0
b. x1 + x2 − x3 = 0,
12x2 − x3 = 4,
2x1 + x2 + x3 = 5
c. 5x1 + x2 − 6x3 = 7,
2x1 + x2 − x3 = 8,
6x1 + 12x2 + x3 = 9
d. x1 − x2 + x3 = 5,
7x1 + 5x2 − x3 = 8,
2x1 + x2 + x3 = 7 |
buy |
| m55352 | Repeat Exercise 2 using four-digit rounding arithmetic.
In Exercise 2
a. f (x) = ln x, x0 = 1.0, h = 0.4
b. f (x) = x + ex , x0 = 0.0, h = 0.4
c. f (x) = 2x sin x, x0 = 1.05, h = 0.4
d. f (x) = x3 cos x, x0 = 2.3, h = 0.4 |
buy |
| m55353 | Repeat Exercise 2 using Heun s method.
In Exercise 2 |
buy |
| m55354 | Repeat Exercise 2 using Simpson s rule.
In Exercise 2 |
buy |
| m55355 | Repeat Exercise 2 using Taylor s method of order four.
In Exercise 2
a. y = et−y, 0≤ t ≤ 1, y(0) = 1, with h = 0.5
b. y = (1 + t)/(1 + y), 1≤ t ≤ 2, y(1) = 2, with h = 0.5
c. y = −y + ty1/2, 2≤ t ≤ 3, y(2) = 2, with h = 0.25
d. y = t−2(sin 2t − 2ty), 1≤ t ≤ 2, y(1) = 2, with h = 0.25 |
buy |
| m55356 | Repeat Exercise 2 using the Adams fourth-order predictor-corrector method.
In Exercise 2 |
buy |
| m55357 | Repeat Exercise 2 using the algorithm developed in Exercise 5.
In Exercise 2
a. u 1 = u1 − u2 + 2, u1(0) = −1;
u 2 = −u1 + u2 + 4t, u2(0) = 0; 0 ≤ t ≤ 1; h = 0.1; |
buy |
| m55358 | Repeat Exercise 2 using the Crank-Nicolson Algorithm.
Repeat exercise 2 |
buy |
| m55359 | Repeat Exercise 2 using the Gauss-Seidel method.
In Exercise 2
a. 4x1 + x2 − x3 = 5,
−x1 + 3x2 + x3 = −4,
2x1 + 2x2 + 5x3 = 1.
b. −2x1+ x2 + 1/2 x3 = 4,
x1−2x2 - 1/2 x3 = −4,
x2 + 2x3 = 0.
c. 4x1 + x2 − x3 + x4 = −2,
x1 + 4x2 − x3 − x4 = −1,
−x1 − x2 + 5x3 + x4 = 0,
x1 − x2 + x3 + 3x4 = 1.
d. 4x1 − x2 − x4 = 0,
−x1 + 4x2 − x3 − x5 = 5,
− x2 + 4x3 − x6 = 0,
−x1 + 4x4 − x5 = 6,
− x2 − x4 + 4x5 − x6 = −2,
− x3 − x5 + 4x6 = 6. |
buy |
| m55360 | Repeat Exercise 2 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, 2, 1)t.
b.
Use x(0) = (1, 1, 0, 1)t.
c.
Use x(0) = (1, 1, 0,−3)t.
d.
Use x(0) = (0, 0, 0, 1)t. |
buy |
| m55361 | Repeat Exercise 2 using the Midpoint method.
In Exercise 2 |
buy |
| m55362 | Repeat Exercise 2 using the Midpoint rule.
In Exercise 2 |
buy |
| m55363 | Repeat Exercise 2 using the modified Newton s method described in Eq. (2.13). Is there an improvement in speed or accuracy over Exercise 2? |
buy |
| m55364 | Repeat Exercise 2 using the Runge-Kutta fourth-order method.
In Exercise 2 |
buy |
| m55365 | Repeat Exercise 2 using the Runge-Kutta method of order four.
In Exercise 2 |
buy |
| m55366 | Repeat Exercise 2 using the Trapezoidal Algorithm with TOL = 10−5.
In Exercise 2 |
buy |
| m55367 | Repeat Exercise 3 using Heun s method.
In Exercise 3 |
buy |
|