@@ -6743,7 +6743,7 @@ Define *Green's function*
67436743 \end{cases}
67446744\end{equation*}
67456745Then
6746- \[\B y_V (x) = \int _a^b G (x, y ) \B{b} (z) d z \]
6746+ \[\B y_V (x) = \int _a^b G (x, z ) \B{b} (z) d z \]
67476747solves (V).
67486748#+LATEX: \end{hidden}
67496749
@@ -6935,7 +6935,7 @@ Why is this problematic?\medskip
69356935
69366936*Idea:* Don't factorize, iterate.
69376937
6938- \demolink{pdes}{Sparse Matrix Factorizations and `` Fill-In'' }\medskip
6938+ \demolink{pdes}{Sparse Matrix Factorizations and Fill-In}\medskip
69396939
69406940*** `Stationary' Iterative Methods
69416941#+LATEX: \contentid{sparse_stationary}{Stationary iterative methods}{11.5.1}
@@ -6946,7 +6946,10 @@ where \(M\) is the part that we are actually inverting. Convergence?
69466946#+LATEX: \begin{tcolorbox}
69476947\vspace{-3ex}
69486948\begin{eqnarray*}
6949- A \B{x} & = & \B{b}\\M \B{x} & = & N \B{x} + \B{b}\\M \B{x}_{k + 1} & = & N \B{x}_k + \B{b}\\\B{x}_{k + 1} & = & M^{- 1} (N \B{x}_k + \B{b})
6949+ A \B{x} & = & \B{b}\\
6950+ M \B{x} & = & N \B{x} + \B{b}\\
6951+ M \B{x}_{k + 1} & = & N \B{x}_k + \B{b}\\
6952+ \B{x}_{k + 1} & = & M^{- 1} (N \B{x}_k + \B{b})
69506953\end{eqnarray*}
69516954
69526955- These methods are called /stationary/ because they do the same
@@ -6974,7 +6977,7 @@ What could we choose for \(M\) (so that it's easy to invert)?
69746977where \(L\) is the below-diagonal part of \(A\), and \(U\) the above-diagonal.
69756978#+LATEX: \end{tcolorbox}
69766979
6977- \demolink{pdes}{Stationary Methods}
6980+ \demolink{pdes}{Stationary Iterative Methods}
69786981
69796982*** Conjugate Gradient Method
69806983#+LATEX: \contentid{sparse_cg}{Conjugate gradient for sparse linear systems}{11.5.5}
0 commit comments