Compare commits

...

1 Commits

Author SHA1 Message Date
42f85c1eb7
Wrote a rough draft of problem 5 2023-09-02 15:50:13 +02:00

View File

@ -136,8 +136,16 @@ Using the values that we found for $c_1$ and $c_2$, we get
\subsection*{a)}
% Phrase it better
$n = m - 2$, since $\textbf{A}$ is used to solve for all of the points in
between the end-points $0$ and $1$. For the complete solution, we need to add
$u(0)$ and $u(1)$.
\subsection*{b)}
When solving for $\vec{v}$, we find the approximate solutions for $u(x)$
that are in between the end-points, but not the end-points themselves.
\section*{Problem 6}
\subsection*{a)}
@ -148,9 +156,7 @@ Using the values that we found for $c_1$ and $c_2$, we get
% Figure it out
\section*{Problem 7}
% Link to relevant files on gh and possibly add some comments
% Linelevant files on gh and possibly add some comments
\section*{Problem 8}
@ -158,7 +164,7 @@ Using the values that we found for $c_1$ and $c_2$, we get
\section*{Problem 9}
% Show the algorithm, then calculate FLOPs, then link to relevant files
% Shon*{Proalgorithm, then calculate FLOPs, then link to relevant files
\section*{Problem 10}