diff options
| author | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2022-07-13 13:19:37 +0200 |
|---|---|---|
| committer | Jaron Kent-Dobias <jaron@kent-dobias.com> | 2022-07-13 13:19:37 +0200 |
| commit | 44441d3e9cf0f0d20bc7814004a6234a708753fa (patch) | |
| tree | 6e30b4822d518c2d0cf633f3a22a3d98b8935f57 | |
| parent | 4f03a48fc19933764b67a59a0e48547d8720e9ec (diff) | |
| download | PRE_107_064111-44441d3e9cf0f0d20bc7814004a6234a708753fa.tar.gz PRE_107_064111-44441d3e9cf0f0d20bc7814004a6234a708753fa.tar.bz2 PRE_107_064111-44441d3e9cf0f0d20bc7814004a6234a708753fa.zip | |
Don't need to justify myself here.
| -rw-r--r-- | frsb_kac-rice.tex | 4 |
1 files changed, 1 insertions, 3 deletions
diff --git a/frsb_kac-rice.tex b/frsb_kac-rice.tex index 10552b6..e53a522 100644 --- a/frsb_kac-rice.tex +++ b/frsb_kac-rice.tex @@ -570,9 +570,7 @@ To these conditions must be added the addition condition that $\Sigma$ is extrem \begin{equation} \label{eq:cond.x} 0=\frac{\partial\Sigma}{\partial x_i}\qquad 1\leq i\leq k \end{equation} -The stationary conditions for the $x$s are the most numerically taxing, because when the -formulas above are chained together and substituted into the complexity it -results in a complicated expression. +The stationary conditions for the $x$s are the most numerically taxing. In addition to these equations, we often want to maximize the complexity as a function of $\mu^*$, to find the most common type of stationary points. These |