FYS3150/Project-1
3
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Remove loose subsection

Browse Source
This commit is contained in:
Cory Balaton
2023-09-10 12:50:18 +02:00
parent 5cc45d0d02
commit b4325ec185
1 changed files with 0 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
latex/problems/problem9.tex
View File

@@ -53,6 +53,3 @@ For every iteration of i in forward sweep we have 2 division, and 2 additions, r
For backward sweep we have 1 division, and for every iteration of i we have 1 addition, and 1 division, resulting in $2(n-1)+1$ FLOPs. For backward sweep we have 1 division, and for every iteration of i we have 1 addition, and 1 division, resulting in $2(n-1)+1$ FLOPs.
Total FLOPs for the special algorithm is $6(n-1)+1$. Total FLOPs for the special algorithm is $6(n-1)+1$.
\subsection*{)}
% Code