... | ... | @@ -32,7 +32,7 @@ Given an initial guess $`\mathbf{x}_0`$, Newton's method consists in computing |
|
|
the successive iterates
|
|
|
```math
|
|
|
\mathbf{x}_{k+1} = \mathbf{x}_k - \mathbf{J}^{-1}(\mathbf{x}_k) \mathbf{F}(\mathbf{x}_k),
|
|
|
\quad k = 1, 2, ...
|
|
|
\quad k = 0, 1, 2, ...
|
|
|
```
|
|
|
where
|
|
|
```math
|
... | ... | @@ -78,7 +78,7 @@ with $`\mathbf{J}(\mathbf{x})_{ij} = \frac{\partial(\mathbf{A}(\mathbf{x})\mathb |
|
|
The Picard method is a simple fixed method applied on the nonlinear function $`\mathbf{F}(\mathbf{x}) := \mathbf{A}(\mathbf{x}) \mathbf{x} - \mathbf{b}`$. Given an initial guess $`\mathbf{x}_0`$, Picard's method consists in computing the successive iterates $`\mathbf{x}_{k+1}`$ such that
|
|
|
```math
|
|
|
\mathbf{A}(\mathbf{x}_{k}) \mathbf{x}_{k+1} = \mathbf{b},
|
|
|
\quad k = 1, 2, ...
|
|
|
\quad k = 0, 1, 2, ...
|
|
|
```
|
|
|
|
|
|
<!--
|
... | ... | |