aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authorNao Pross <np@0hm.ch>2021-07-23 18:51:24 +0200
committerNao Pross <np@0hm.ch>2021-07-23 18:51:24 +0200
commit4424d556286300ac5063ef9e9eb72e0373ac3e52 (patch)
treee6602430d3fff0cd71791846307b4606daff2e4e
parentUpdate gitignore and add pdf (diff)
downloadFuVar-4424d556286300ac5063ef9e9eb72e0373ac3e52.tar.gz
FuVar-4424d556286300ac5063ef9e9eb72e0373ac3e52.zip
Typo
-rw-r--r--FuVar.tex7
-rw-r--r--build/FuVar.pdfbin80848 -> 81374 bytes
2 files changed, 5 insertions, 2 deletions
diff --git a/FuVar.tex b/FuVar.tex
index dba65b3..5843d02 100644
--- a/FuVar.tex
+++ b/FuVar.tex
@@ -155,7 +155,7 @@ typesetting may trick you into thinking it is rigorous, but really, it is not.
The gradient vector always points towards \emph{the direction of steepest ascent}.
\end{theorem}
-\subsection{Methods for maximization and minimization problems}
+\section{Methods for maximization and minimization problems}
\begin{method}[Find stationary points]
Given a function \(f: D \subseteq \mathbb{R}^m \to \mathbb{R}\), to
@@ -288,7 +288,7 @@ typesetting may trick you into thinking it is rigorous, but really, it is not.
\item Points that solve the system of \(m+k\) equations
\[
\begin{dcases}
- \grad f(\vec{u}) = \sum_{i = 1}^k \lambda_k \grad n_i(\vec{u})
+ \grad f(\vec{u}) = \sum_{i = 1}^k \lambda_i \grad n_i(\vec{u})
& (m\text{-dimensional}) \\
n_i(\vec{u}) = 0 & \text{ for } 1 \leq i \leq k
\end{dcases}
@@ -297,6 +297,9 @@ typesetting may trick you into thinking it is rigorous, but really, it is not.
\end{itemize}
\end{method}
+\section{Integration}
+
+
\section*{License}
\doclicenseText
diff --git a/build/FuVar.pdf b/build/FuVar.pdf
index af1a29e..7d8740f 100644
--- a/build/FuVar.pdf
+++ b/build/FuVar.pdf
Binary files differ