docs: update extended comment

---
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: na
  - task: lint_package_json
    status: na
  - task: lint_repl_help
    status: na
  - task: lint_javascript_src
    status: passed
  - 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: kgryte

lib/node_modules/@stdlib/blas/base/dger/lib/base.js

@@ -30,7 +30,52 @@ var isRowMajor = require( '@stdlib/ndarray/base/assert/is-row-major' );
 *
 * ## Notes
 *
-* -   To help motivate the use of loop interchange below, we first recognize that a matrix stored in row-major order is equivalent to storing the matrix's transpose in column-major order. Hence, we can interpret an `M` by `N` row-major matrix `B` as the matrix `A^T` stored in column-major. In which case, we can derive an update equation for `B` as follows:
+* -   To help motivate the use of loop interchange below, we first recognize that a matrix stored in row-major order is equivalent to storing the matrix's transpose in column-major order. For example, consider the following 2-by-3 matrix `A`
+*
+*     ```tex
+*     A = \begin{bmatrix}
+*         1 & 2 & 3 \\
+*         4 & 5 & 6
+*         \end{bmatrix}
+*     ```
+*
+*     When stored in a linear buffer in column-major order, `A` becomes
+*
+*     ```text
+*     [ 1 4 2 5 3 6]
+*     ```
+*
+*     When stored in a linear buffer in row-major order, `A` becomes
+*
+*     ```text
+*     [ 1 2 3 4 5 6]
+*     ```
+*
+*     Now consider the transpose of `A`
+*
+*     ```tex
+*     A^T = \begin{bmatrix}
+*         1 & 4 \\
+*         2 & 5 \\
+*         3 & 6
+*         \end{bmatrix}
+*     ```
+*
+*     When the transpose is stored in a linear buffer in column-major order, the transpose becomes
+*
+*     ```text
+*     [ 1 2 3 4 5 6 ]
+*     ```
+*
+*     Similarly, when stored in row-major order, the transpose becomes
+*
+*     ```text
+*     [ 1 4 2 5 3 6 ]
+*     ```
+*
+*     As may be observed, `A` stored in column-major order is equivalent to storing the transpose of `A` in row-major order, and storing `A` in row-major order is equivalent to storing the transpose of `A` in column-major order, and vice versa.
+*
+*     Hence, we can interpret an `M` by `N` row-major matrix `B` as the matrix `A^T` stored in column-major. In which case, we can derive an update equation for `B` as follows:
 *
 *     ```tex
 *     \begin{align*}