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

Fix spelling

Browse Source
This commit is contained in:
Cory Balaton 2023-09-10 12:51:46 +02:00
parent b4325ec185
commit ca774e434f
No known key found for this signature in database
GPG Key ID: 3E5FCEBFD80F432B
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
latex/problems/problem9.tex
View File

@ -49,7 +49,7 @@ Calculating the first values to see a pattern
\subsection*{b)} \subsection*{b)}
% Find FLOPs % Find FLOPs
For every iteration of i in forward sweep we have 2 division, and 2 additions, resulting in $4(n-1)$ FLOPs. For every iteration of i in forward sweep we have 2 divisions, and 2 additions, resulting in $4(n-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. 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$.