updated function header

tamaskis · Jul 6, 2022 · c3bdcf8 · c3bdcf8
1 parent d2e5886
commit c3bdcf8
Show file tree

Hide file tree

Showing 4 changed files with 4 additions and 4 deletions.
diff --git a/EXAMPLES.mlx b/EXAMPLES.mlx
diff --git a/README.md b/README.md
@@ -33,4 +33,4 @@ Newton's method for finding the root of a differentiable, multivariate, vector-v
 ## Examples and Additional Documentation
 
    - See "EXAMPLES.mlx" or the "Examples" tab on the File Exchange page for examples. 
-   - See ["Root_Finding_Methods.pdf"](https://tamaskis.github.io/documentation/Root_Finding_Methods.pdf) (also included with download) for the technical documentation.
+   - See ["Root_Finding_Methods.pdf"](https://tamaskis.github.io/files/Root_Finding_Methods.pdf) (also included with download) for the technical documentation.
diff --git a/Root_Finding_Methods.pdf b/Root_Finding_Methods.pdf
diff --git a/newtons_method_n.m b/newtons_method_n.m
@@ -11,12 +11,12 @@
 % See also fsolve.
 %
 % Copyright © 2021 Tamas Kis
-% Last Update: 2022-04-20
+% Last Update: 2022-07-06
 % Website: https://tamaskis.github.io
 % Contact: tamas.a.kis@outlook.com
 %
 % TECHNICAL DOCUMENTATION:
-% https://tamaskis.github.io/documentation/Root_Finding_Methods.pdf
+% https://tamaskis.github.io/files/Root_Finding_Methods.pdf
 %
 %--------------------------------------------------------------------------
 %
@@ -27,7 +27,7 @@
 %             f(x) (f : ℝⁿ → ℝⁿ)
 %   J       - (1×1 function_handle) Jacobian of f(x) (J : ℝⁿ → ℝⁿˣⁿ)
 %   x0      - (n×1 double) initial guess for root
-%   opts    - (1×1 struct) (OPTIONAL) solver options
+%   opts    - (OPTIONAL) (1×1 struct) solver options
 %       • k_max      - (1×1 double) maximimum number of iterations 
 %                      (defaults to 200)
 %       • return_all - (1×1 logical) returns estimates at all iterations if