Skip to content

Commit

Permalink
减少换行,确保不超过2页
Browse files Browse the repository at this point in the history
  • Loading branch information
CJL196 committed Jun 2, 2024
1 parent c91a368 commit b97d06d
Show file tree
Hide file tree
Showing 2 changed files with 2 additions and 8 deletions.
4 changes: 1 addition & 3 deletions 5/index.md
Original file line number Diff line number Diff line change
Expand Up @@ -65,9 +65,7 @@ Cholesky 分解后,类似 LU 分解的过程得到最终解

- **无穷范数**:又称行范数,每一行中元素的绝对值之和的最大值 $\Vert \mathbf{A}\Vert_{\infin}=\displaystyle \max_{1\leqslant i\leqslant n}\left\{\sum_{j=1}^n|a_{ij}|\right\}$

其他种类的范数:

- **F-范数**:$\Vert \mathbf{A}\Vert_F=\displaystyle \sqrt{\sum_{i=1}^n\sum_{j=1}^n a_{ij}^2}$
其他种类的范数: **F-范数**:$\Vert \mathbf{A}\Vert_F=\displaystyle \sqrt{\sum_{i=1}^n\sum_{j=1}^n a_{ij}^2}$

**谱半径** $\rho(\mathbf{A})=\max|\lambda_i|$,其中 $\lambda_i$ 是 $\mathbf{A}$ 的特征值

Expand Down
6 changes: 1 addition & 5 deletions 7/index.md
Original file line number Diff line number Diff line change
Expand Up @@ -30,11 +30,7 @@ $|x_k-x^*|\leqslant\displaystyle \frac{L^k}{1-L}| x_1-x_0 | $ 或 $|x_{k}-x^{*}|

如果迭代函数在不动点 $x^*$ 附近有 $p$ 阶连续导数且 $\phi^{\prime}(x^*)=\phi^{\prime\prime}(x^*)=\cdots=\phi^{(p-1)}(x^*)=0,\quad\phi^{(p)}(x^*)\neq0$ ,那么迭代过程在 $x^*$ 附近 $p$ 阶收敛

**斯特芬森迭代法**

$$
x_{k+1}=\psi(x_k),\psi(x)=x-\frac{[\phi(x)-x]^2}{\phi(\phi(x))-2\phi(x)+x}
$$
**斯特芬森迭代法**: $x_{k+1}=\psi(x_k),\psi(x)=x-\frac{[\phi(x)-x]^2}{\phi(\phi(x))-2\phi(x)+x}$

**牛顿法**: $x_{k+1}=\displaystyle x_k-\frac{f(x_k)}{f'(x_k)}$

Expand Down

0 comments on commit b97d06d

Please sign in to comment.