Browse Source

Interpolations-Idee aufgenommen

Martin Thoma 11 years ago
parent
commit
e284e13643

BIN
documents/math-minimal-distance-to-cubic-function/math-minimal-distance-to-cubic-function.pdf


+ 8 - 3
documents/math-minimal-distance-to-cubic-function/math-minimal-distance-to-cubic-function.tex

@@ -592,9 +592,14 @@ chose the cubic function $f$ and $P$.
 I'm also pretty sure that there is no polynomial (no matter what degree)
 I'm also pretty sure that there is no polynomial (no matter what degree)
 that has more than 3 solutions.}
 that has more than 3 solutions.}
 
 
-\section{Bisection method}
 
 
-\section{Newtons method}
+\section{Interpolation and approximation}
+\subsection{Quadratic spline interpolation}
+You could interpolate the cubic function by a quadratic spline.
+
+\subsection{Bisection method}
+
+\subsection{Newtons method}
 One way to find roots of functions is Newtons method. It gives an
 One way to find roots of functions is Newtons method. It gives an
 iterative computation procedure that can converge quadratically 
 iterative computation procedure that can converge quadratically 
 if some conditions are met:
 if some conditions are met:
@@ -625,7 +630,7 @@ The problem of this approach is choosing a starting value that is
 close enough to the root. So we have to have a \enquote{good}
 close enough to the root. So we have to have a \enquote{good}
 initial guess.
 initial guess.
 
 
-\section{Quadratic minimization}
+\subsection{Quadratic minimization}
 \todo[inline]{TODO}
 \todo[inline]{TODO}
 
 
 \section{Conclusion}
 \section{Conclusion}