docs: add eqn divs

---
type: pre_commit_static_analysis_report
description: Results of running static analysis checks when committing changes.
report:
  - task: lint_filenames
    status: passed
  - task: lint_editorconfig
    status: passed
  - task: lint_markdown
    status: passed
  - task: lint_package_json
    status: na
  - task: lint_repl_help
    status: na
  - task: lint_javascript_src
    status: na
  - task: lint_javascript_cli
    status: na
  - task: lint_javascript_examples
    status: na
  - task: lint_javascript_tests
    status: na
  - task: lint_javascript_benchmarks
    status: na
  - task: lint_python
    status: na
  - task: lint_r
    status: na
  - task: lint_c_src
    status: na
  - task: lint_c_examples
    status: na
  - task: lint_c_benchmarks
    status: na
  - task: lint_c_tests_fixtures
    status: na
  - task: lint_shell
    status: na
  - task: lint_typescript_declarations
    status: na
  - task: lint_typescript_tests
    status: na
  - task: lint_license_headers
    status: passed
---

Author: aayush0325

lib/node_modules/@stdlib/lapack/base/dgttrf/README.md

@@ -26,14 +26,28 @@ limitations under the License.
 
 The `dgttrf` routine computes an LU factorization of a real n-by-n tridiagonal matrix A using elimination with partial pivoting and row interchanges. The factorization has the form:
 
+<!-- <equation class="equation" label="eq:lu_decomposition" align="center" raw="A = L U" alt="Equation for LU factorization."> -->
+
 ```math
 A = L U
 ```
 
+<!-- <div class="equation" align="center" data-raw-text="A = L U" data-equation="eq:lu_decomposition"></div> -->
+
+<!-- </equation> -->
+
 where L is a product of permutation and unit lower bidiagonal matrices and U is upper triangular with nonzeros in only the main diagonal and first two superdiagonals.
 
 For a tridiagonal matrix A, its elements are stored in three arrays:
 
+<!-- <equation class="equation" label="eq:matrix_a" align="center" raw="A = \begin{bmatrix}
+    d_1    & du_1   & 0      & \cdots & 0      \\
+    dl_1   & d_2    & du_2   & \cdots & 0      \\
+    0      & dl_2   & d_3    & \ddots & \vdots \\
+    \vdots & \ddots & \ddots & \ddots & du_{n-1}\\
+    0      & \cdots & 0      & dl_{n-1} & d_n
+\end{bmatrix}" alt="Representation of matrix A."> -->
+
 ```math
 A = \begin{bmatrix}
     d_1    & du_1   & 0      & \cdots & 0      \\
@@ -44,6 +58,16 @@ A = \begin{bmatrix}
 \end{bmatrix}
 ```
 
+<!-- <div class="equation" align="center" data-raw-text="A = \begin{bmatrix}
+    d_1    & du_1   & 0      & \cdots & 0      \\
+    dl_1   & d_2    & du_2   & \cdots & 0      \\
+    0      & dl_2   & d_3    & \ddots & \vdots \\
+    \vdots & \ddots & \ddots & \ddots & du_{n-1}\\
+    0      & \cdots & 0      & dl_{n-1} & d_n
+\end{bmatrix}" data-equation="eq:matrix_a"></div> -->
+
+<!-- </equation> -->
+
 where:
 
 -   `dl` contains the subdiagonal elements
@@ -58,6 +82,14 @@ After factorization, the elements of L and U overwrite the input arrays, where:
 
 The resulting L and U matrices have the following structure:
 
+<!-- <equation class="equation" label="eq:matrix_l" align="center" raw="L = \begin{bmatrix}
+    1      & 0      & 0      & \cdots & 0      \\
+    l_1    & 1      & 0      & \cdots & 0      \\
+    0      & l_2    & 1      & \ddots & \vdots \\
+    \vdots & \ddots & \ddots & \ddots & 0      \\
+    0      & \cdots & 0      & l_{n-1} & 1
+\end{bmatrix}" alt="Representation of matrix L as derived from DL."> -->
+
 ```math
 L = \begin{bmatrix}
     1      & 0      & 0      & \cdots & 0      \\
@@ -68,6 +100,24 @@ L = \begin{bmatrix}
 \end{bmatrix}
 ```
 
+<!-- <div class="equation" align="center" data-raw-text="L = \begin{bmatrix}
+    1      & 0      & 0      & \cdots & 0      \\
+    l_1    & 1      & 0      & \cdots & 0      \\
+    0      & l_2    & 1      & \ddots & \vdots \\
+    \vdots & \ddots & \ddots & \ddots & 0      \\
+    0      & \cdots & 0      & l_{n-1} & 1
+\end{bmatrix}" data-equation="eq:matrix_l"></div> -->
+
+<!-- </equation> -->
+
+<!-- <equation class="equation" label="eq:matrix_u" align="center" raw="U = \begin{bmatrix}
+    u_{1,1} & u_{1,2} & u_{1,3} & \cdots & 0      \\
+    0       & u_{2,2} & u_{2,3} & u_{2,4} & 0      \\
+    0       & 0       & u_{3,3} & \ddots & \ddots \\
+    \vdots  & \vdots  & \ddots & \ddots & u_{n-1,n}\\
+    0       & 0       & \cdots & 0      & u_{n,n}
+\end{bmatrix}" alt="Representation of matrix U as derived from D, DU, DU2."> -->
+
 ```math
 U = \begin{bmatrix}
     u_{1,1} & u_{1,2} & u_{1,3} & \cdots & 0      \\
@@ -78,6 +128,14 @@ U = \begin{bmatrix}
 \end{bmatrix}
 ```
 
+<!-- <div class="equation" align="center" data-raw-text="U = \begin{bmatrix}
+    u_{1,1} & u_{1,2} & u_{1,3} & \cdots & 0      \\
+    0       & u_{2,2} & u_{2,3} & u_{2,4} & 0      \\
+    0       & 0       & u_{3,3} & \ddots & \ddots \\
+    \vdots  & \vdots  & \ddots & \ddots & u_{n-1,n}\\
+    0       & 0       & \cdots & 0      & u_{n,n}
+\end{bmatrix}" data-equation="eq:matrix_u"></div> -->
+
 <!-- </equation> -->
 
 where the `l_i` values are stored in `dl`, the diagonal elements `u_{i,i}` are stored in `d`, and the superdiagonal elements `u_{i,i+1}` and `u_{i,i+2}` are stored in `du` and `du2` respectively.