foo

Author: ocots

.markdownlint.json

@@ -0,0 +1,5 @@
+{
+    "MD046": false,
+    "MD013": false,
+    "MD033": false
+}

docs/src/tutorial-goddard.md

@@ -366,7 +366,7 @@ The results found for by the two solvers are extremely close, so now, lets bench
 @benchmark solve(prob; abstol=1e-8, reltol=1e-8, show_trace=Val(false)) # NonlinearSolve
 ```
 
-According to the NonlinearSolve documentation, for small nonlinear systems, it could be faster to use the [`SimpleNewtonRaphson()` descent algorithm](https://docs.sciml.ai/NonlinearSolve/stable/tutorials/code_optimization/). 
+According to the NonlinearSolve documentation, for small nonlinear systems, it could be faster to use the [`SimpleNewtonRaphson()` descent algorithm](https://docs.sciml.ai/NonlinearSolve/stable/tutorials/code_optimization/).
 
 ```@example main-goddard
 @benchmark solve(prob, SimpleNewtonRaphson(); abstol=1e-8, reltol=1e-8, show_trace=Val(false)) # NonlinearSolve