Web-Projects/blog-static
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Compare commits

base: Web-Projects:db852cab689052bd410e3531d5e846cf61fc8e3f
Branches Tags
Web-Projects:master
Web-Projects:donations
Web-Projects:search
Web-Projects:localization
Web-Projects:colors
Web-Projects:table-of-contents
Web-Projects:margin-rework
Web-Projects:sidenotes
...
compare: Web-Projects:b091bbacad693504ee0a03778c012611ac46ff88
Branches Tags
Web-Projects:master
Web-Projects:donations
Web-Projects:search
Web-Projects:localization
Web-Projects:colors
Web-Projects:table-of-contents
Web-Projects:margin-rework
Web-Projects:sidenotes

2 Commits
db852cab68 ... b091bbacad

Author SHA1 Message Date
Danila Fedorin
b091bbacad Update theme 2022-10-18 18:24:33 -07:00
Danila Fedorin
d9ac5bd150 Try to switch to a more KaTeX compatible command 2022-10-18 18:20:52 -07:00
2 changed files with 3 additions and 3 deletions
Show Stats Expand all files Collapse all files

4
content/blog/linear_multistep.md
View File

@ -74,12 +74,12 @@ t_n = t_0 + nh
{{< /latex >}} {{< /latex >}}
We can get the formula for \\(y_n\\) by looking at our aproximation steps above. We can get the formula for \\(y_n\\) by looking at our aproximation steps above.
{{< latex >}} {{< latex >}}
\begin{gather*} \begin{gather}
y_1 = y_0 + hf(t_0,y_0) \\ y_1 = y_0 + hf(t_0,y_0) \\
y_2 = y_1 + hf(t_1,y_1) \\ y_2 = y_1 + hf(t_1,y_1) \\
... \\ ... \\
y_{n+1} = y_n + hf(t_n,y_n) y_{n+1} = y_n + hf(t_n,y_n)
\end{gather*} \end{gather}
{{< /latex >}} {{< /latex >}}
What we have arrived at is [Euler's method](https://mathworld.wolfram.com/EulerForwardMethod.html). What we have arrived at is [Euler's method](https://mathworld.wolfram.com/EulerForwardMethod.html).

2
themes/vanilla

@ -1 +1 @@
Subproject commit 869f9d12c84ebf38fe8f21611af9d3bf7ff5ea0d Subproject commit 67e2150f75d2afee6dbd491fbf900d36c422d6c6