refactor: improve notes in the description of the routine

prajjwalbajpai · prajjwalbajpai · commit 92532e242303 · 2026-02-28T19:10:33.000+05:30
---
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: 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: passed
  - task: lint_typescript_tests
    status: passed
  - task: lint_license_headers
    status: passed
---
diff --git a/lib/node_modules/@stdlib/lapack/base/dla-gbrpvgrw/README.md b/lib/node_modules/@stdlib/lapack/base/dla-gbrpvgrw/README.md
@@ -190,10 +190,16 @@ var out = dlagbrpvgrw.ndarray( 4, 1, 1, 4, AB, 4, 1, 1, AFB, 4, 1, 1 );
 
 ## Notes
 
--   Matrix `AB` is the matrix A in band storage, in rows 1 to KL+KU+1. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB(KU+1+i-j,j) = A(i,j)` for max(1,j-KU)<=i<=min(N,j+kl).
--   Matrix `AFB` stores the details of the LU factorization of the band matrix A, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 1 to `KL`+`KU`+1, and the multipliers used during the factorization are stored in rows `KL`+`KU`+2 to 2*`KL`+`KU`+1.
--   The leading dimension of `AB`, `LDAB` >= KL+KU+1.
--   The leading dimension of `AFB`, `LDAFB` >= 2*KL+KU+1.
+-   The norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix `A` could be poor. This also means that the solution `X`, estimated condition numbers, and error bounds could be unreliable.
+
+-   Matrix `AB` is the matrix A in band storage, in rows 0 to `KL+KU`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB( KU+i-j, j ) = A( i, j )` for `max( 0, j - KU ) <= i <= min( N - 1, j + KL )`.
+
+-   Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+1` to `2*KL+KU`.
+
+-   The leading dimension of `AB`, `LDAB` >= `KL+KU+1`.
+
+-   The leading dimension of `AFB`, `LDAFB` >= `2*KL+KU+1`.
+
 -   `dlagbrpvgrw()` corresponds to the [LAPACK][LAPACK] function [`dlagbrpvgrw`][lapack-dlagbrpvgrw].
 
 </section>
diff --git a/lib/node_modules/@stdlib/lapack/base/dla-gbrpvgrw/docs/types/index.d.ts b/lib/node_modules/@stdlib/lapack/base/dla-gbrpvgrw/docs/types/index.d.ts
@@ -31,10 +31,11 @@ interface Routine {
 	*
 	* ## Notes
 	*
-	* -   Matrix `AB` is the matrix A in band storage, in rows 1 to KL+KU+1. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB(KU+1+i-j,j) = A(i,j)` for max(1,j-KU)<=i<=min(N,j+kl).
-	* -   Matrix `AFB` stores the details of the LU factorization of the band matrix A, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 1 to `KL`+`KU`+1, and the multipliers used during the factorization are stored in rows `KL`+`KU`+2 to 2*`KL`+`KU`+1.
-	* -   The leading dimension of `AB`, `LDAB` >= KL+KU+1.
-	* -   The leading dimension of `AFB`, `LDAFB` >= 2*KL+KU+1.
+	* -   The norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix `A` could be poor. This also means that the solution `X`, estimated condition numbers, and error bounds could be unreliable.
+	* -   Matrix `AB` is the matrix A in band storage, in rows 0 to `KL+KU`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB( KU+i-j, j ) = A( i, j )` for `max( 0, j - KU ) <= i <= min( N - 1, j + KL )`.
+	* -   Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+1` to `2*KL+KU`.
+	* -   The leading dimension of `AB`, `LDAB` >= `KL+KU+1`.
+	* -   The leading dimension of `AFB`, `LDAFB` >= `2*KL+KU+1`.
 	*
 	* @param order - order of matrix `A`
 	* @param N - number of rows in matrix `A`
@@ -63,10 +64,11 @@ interface Routine {
 	*
 	* ## Notes
 	*
-	* -   Matrix `AB` is the matrix A in band storage, in rows 1 to KL+KU+1. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB(KU+1+i-j,j) = A(i,j)` for max(1,j-KU)<=i<=min(N,j+kl).
-	* -   Matrix `AFB` stores the details of the LU factorization of the band matrix A, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 1 to `KL`+`KU`+1, and the multipliers used during the factorization are stored in rows `KL`+`KU`+2 to 2*`KL`+`KU`+1.
-	* -   The leading dimension of `AB`, `LDAB` >= KL+KU+1.
-	* -   The leading dimension of `AFB`, `LDAFB` >= 2*KL+KU+1.
+	* -   The norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix `A` could be poor. This also means that the solution `X`, estimated condition numbers, and error bounds could be unreliable.
+	* -   Matrix `AB` is the matrix A in band storage, in rows 0 to `KL+KU`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB( KU+i-j, j ) = A( i, j )` for `max( 0, j - KU ) <= i <= min( N - 1, j + KL )`.
+	* -   Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+1` to `2*KL+KU`.
+	* -   The leading dimension of `AB`, `LDAB` >= `KL+KU+1`.
+	* -   The leading dimension of `AFB`, `LDAFB` >= `2*KL+KU+1`.
 	*
 	* @param N - number of rows in matrix `A`
 	* @param KL - number of subdiagonals within the band of matrix `A`
@@ -99,10 +101,11 @@ interface Routine {
 *
 * ## Notes
 *
-* -   Matrix `AB` is the matrix A in band storage, in rows 1 to KL+KU+1. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB(KU+1+i-j,j) = A(i,j)` for max(1,j-KU)<=i<=min(N,j+kl).
-* -   Matrix `AFB` stores the details of the LU factorization of the band matrix A, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 1 to `KL`+`KU`+1, and the multipliers used during the factorization are stored in rows `KL`+`KU`+2 to 2*`KL`+`KU`+1.
-* -   The leading dimension of `AB`, `LDAB` >= KL+KU+1.
-* -   The leading dimension of `AFB`, `LDAFB` >= 2*KL+KU+1.
+* -   The norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix `A` could be poor. This also means that the solution `X`, estimated condition numbers, and error bounds could be unreliable.
+* -   Matrix `AB` is the matrix A in band storage, in rows 0 to `KL+KU`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB( KU+i-j, j ) = A( i, j )` for `max( 0, j - KU ) <= i <= min( N - 1, j + KL )`.
+* -   Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+1` to `2*KL+KU`.
+* -   The leading dimension of `AB`, `LDAB` >= `KL+KU+1`.
+* -   The leading dimension of `AFB`, `LDAFB` >= `2*KL+KU+1`.
 *
 * @param order - order of matrix `A`
 * @param N - number of rows in matrix `A`
diff --git a/lib/node_modules/@stdlib/lapack/base/dla-gbrpvgrw/lib/base.js b/lib/node_modules/@stdlib/lapack/base/dla-gbrpvgrw/lib/base.js
@@ -32,10 +32,11 @@ var min = require( '@stdlib/math/base/special/min' );
 *
 * ## Notes
 *
-* -   Matrix `AB` is the matrix A in band storage, in rows 1 to KL+KU+1. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB(KU+1+i-j,j) = A(i,j)` for max(1,j-KU)<=i<=min(N,j+kl).
-* -   Matrix `AFB` stores the details of the LU factorization of the band matrix A, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 1 to `KL`+`KU`+1, and the multipliers used during the factorization are stored in rows `KL`+`KU`+2 to 2*`KL`+`KU`+1.
-* -   The leading dimension of `AB`, `LDAB` >= KL+KU+1.
-* -   The leading dimension of `AFB`, `LDAFB` >= 2*KL+KU+1.
+* -   The norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix `A` could be poor. This also means that the solution `X`, estimated condition numbers, and error bounds could be unreliable.
+* -   Matrix `AB` is the matrix A in band storage, in rows 0 to `KL+KU`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB( KU+i-j, j ) = A( i, j )` for `max( 0, j - KU ) <= i <= min( N - 1, j + KL )`.
+* -   Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+1` to `2*KL+KU`.
+* -   The leading dimension of `AB`, `LDAB` >= `KL+KU+1`.
+* -   The leading dimension of `AFB`, `LDAFB` >= `2*KL+KU+1`.
 *
 * @private
 * @param {NonNegativeInteger} N - number of rows in matrix `A`
diff --git a/lib/node_modules/@stdlib/lapack/base/dla-gbrpvgrw/lib/dlagbrpvgrw.js b/lib/node_modules/@stdlib/lapack/base/dla-gbrpvgrw/lib/dlagbrpvgrw.js
@@ -33,10 +33,11 @@ var base = require( './base.js' );
 *
 * ## Notes
 *
-* -   Matrix `AB` is the matrix A in band storage, in rows 1 to `KL+KU+1`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB(KU+1+i-j,j) = A(i,j)` for max(1,j-KU)<=i<=min(N,j+kl).
-* -   Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with `KL+KU` superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+2` to `2*KL+KU+1`.
-* -   The leading dimension of `AB`, `LDAB` >= KL+KU+1.
-* -   The leading dimension of `AFB`, `LDAFB` >= 2*KL+KU+1.
+* -   The norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix `A` could be poor. This also means that the solution `X`, estimated condition numbers, and error bounds could be unreliable.
+* -   Matrix `AB` is the matrix A in band storage, in rows 0 to `KL+KU`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB( KU+i-j, j ) = A( i, j )` for `max( 0, j - KU ) <= i <= min( N - 1, j + KL )`.
+* -   Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+1` to `2*KL+KU`.
+* -   The leading dimension of `AB`, `LDAB` >= `KL+KU+1`.
+* -   The leading dimension of `AFB`, `LDAFB` >= `2*KL+KU+1`.
 *
 * @param {string} order - order of matrix `A`
 * @param {NonNegativeInteger} N - number of rows in matrix `A`
diff --git a/lib/node_modules/@stdlib/lapack/base/dla-gbrpvgrw/lib/ndarray.js b/lib/node_modules/@stdlib/lapack/base/dla-gbrpvgrw/lib/ndarray.js
@@ -30,10 +30,11 @@ var base = require( './base.js' );
 *
 * ## Notes
 *
-* -   Matrix `AB` is the matrix A in band storage, in rows 1 to KL+KU+1. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB(KU+1+i-j,j) = A(i,j)` for max(1,j-KU)<=i<=min(N,j+kl).
-* -   Matrix `AFB` stores the details of the LU factorization of the band matrix A, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 1 to `KL`+`KU`+1, and the multipliers used during the factorization are stored in rows `KL`+`KU`+2 to 2*`KL`+`KU`+1.
-* -   The leading dimension of `AB`, `LDAB` >= KL+KU+1.
-* -   The leading dimension of `AFB`, `LDAFB` >= 2*KL+KU+1.
+* -   The norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix `A` could be poor. This also means that the solution `X`, estimated condition numbers, and error bounds could be unreliable.
+* -   Matrix `AB` is the matrix A in band storage, in rows 0 to `KL+KU`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB( KU+i-j, j ) = A( i, j )` for `max( 0, j - KU ) <= i <= min( N - 1, j + KL )`.
+* -   Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+1` to `2*KL+KU`.
+* -   The leading dimension of `AB`, `LDAB` >= `KL+KU+1`.
+* -   The leading dimension of `AFB`, `LDAFB` >= `2*KL+KU+1`.
 *
 * @param {NonNegativeInteger} N - number of rows in matrix `A`
 * @param {NonNegativeInteger} KL - number of subdiagonals within the band of matrix `A`

Original file line number	Diff line number	Diff line change
`@@ -31,10 +31,11 @@ interface Routine {`
`31`	`31`	`*`
`32`	`32`	`* ## Notes`
`33`	`33`	`*`
`34`		- * - Matrix `AB` is the matrix A in band storage, in rows 1 to KL+KU+1. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB(KU+1+i-j,j) = A(i,j)` for max(1,j-KU)<=i<=min(N,j+kl).
`35`		- * - Matrix `AFB` stores the details of the LU factorization of the band matrix A, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 1 to `KL`+`KU`+1, and the multipliers used during the factorization are stored in rows `KL`+`KU`+2 to 2*`KL`+`KU`+1.
`36`		- * - The leading dimension of `AB`, `LDAB` >= KL+KU+1.
`37`		- * - The leading dimension of `AFB`, `LDAFB` >= 2*KL+KU+1.
	`34`	+ * - The norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix `A` could be poor. This also means that the solution `X`, estimated condition numbers, and error bounds could be unreliable.
	`35`	+ * - Matrix `AB` is the matrix A in band storage, in rows 0 to `KL+KU`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB( KU+i-j, j ) = A( i, j )` for `max( 0, j - KU ) <= i <= min( N - 1, j + KL )`.
	`36`	+ * - Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+1` to `2*KL+KU`.
	`37`	+ * - The leading dimension of `AB`, `LDAB` >= `KL+KU+1`.
	`38`	+ * - The leading dimension of `AFB`, `LDAFB` >= `2*KL+KU+1`.
`38`	`39`	`*`
`39`	`40`	* @param order - order of matrix `A`
`40`	`41`	* @param N - number of rows in matrix `A`
`@@ -63,10 +64,11 @@ interface Routine {`
`63`	`64`	`*`
`64`	`65`	`* ## Notes`
`65`	`66`	`*`
`66`		- * - Matrix `AB` is the matrix A in band storage, in rows 1 to KL+KU+1. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB(KU+1+i-j,j) = A(i,j)` for max(1,j-KU)<=i<=min(N,j+kl).
`67`		- * - Matrix `AFB` stores the details of the LU factorization of the band matrix A, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 1 to `KL`+`KU`+1, and the multipliers used during the factorization are stored in rows `KL`+`KU`+2 to 2*`KL`+`KU`+1.
`68`		- * - The leading dimension of `AB`, `LDAB` >= KL+KU+1.
`69`		- * - The leading dimension of `AFB`, `LDAFB` >= 2*KL+KU+1.
	`67`	+ * - The norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix `A` could be poor. This also means that the solution `X`, estimated condition numbers, and error bounds could be unreliable.
	`68`	+ * - Matrix `AB` is the matrix A in band storage, in rows 0 to `KL+KU`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB( KU+i-j, j ) = A( i, j )` for `max( 0, j - KU ) <= i <= min( N - 1, j + KL )`.
	`69`	+ * - Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+1` to `2*KL+KU`.
	`70`	+ * - The leading dimension of `AB`, `LDAB` >= `KL+KU+1`.
	`71`	+ * - The leading dimension of `AFB`, `LDAFB` >= `2*KL+KU+1`.
`70`	`72`	`*`
`71`	`73`	* @param N - number of rows in matrix `A`
`72`	`74`	* @param KL - number of subdiagonals within the band of matrix `A`
`@@ -99,10 +101,11 @@ interface Routine {`
`99`	`101`	`*`
`100`	`102`	`* ## Notes`
`101`	`103`	`*`
`102`		-* - Matrix `AB` is the matrix A in band storage, in rows 1 to KL+KU+1. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB(KU+1+i-j,j) = A(i,j)` for max(1,j-KU)<=i<=min(N,j+kl).
`103`		-* - Matrix `AFB` stores the details of the LU factorization of the band matrix A, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 1 to `KL`+`KU`+1, and the multipliers used during the factorization are stored in rows `KL`+`KU`+2 to 2*`KL`+`KU`+1.
`104`		-* - The leading dimension of `AB`, `LDAB` >= KL+KU+1.
`105`		-* - The leading dimension of `AFB`, `LDAFB` >= 2*KL+KU+1.
	`104`	+* - The norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix `A` could be poor. This also means that the solution `X`, estimated condition numbers, and error bounds could be unreliable.
	`105`	+* - Matrix `AB` is the matrix A in band storage, in rows 0 to `KL+KU`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB( KU+i-j, j ) = A( i, j )` for `max( 0, j - KU ) <= i <= min( N - 1, j + KL )`.
	`106`	+* - Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+1` to `2*KL+KU`.
	`107`	+* - The leading dimension of `AB`, `LDAB` >= `KL+KU+1`.
	`108`	+* - The leading dimension of `AFB`, `LDAFB` >= `2*KL+KU+1`.
`106`	`109`	`*`
`107`	`110`	* @param order - order of matrix `A`
`108`	`111`	* @param N - number of rows in matrix `A`
Original file line number	Diff line number	Diff line change
`@@ -32,10 +32,11 @@ var min = require( '@stdlib/math/base/special/min' );`
`32`	`32`	`*`
`33`	`33`	`* ## Notes`
`34`	`34`	`*`
`35`		-* - Matrix `AB` is the matrix A in band storage, in rows 1 to KL+KU+1. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB(KU+1+i-j,j) = A(i,j)` for max(1,j-KU)<=i<=min(N,j+kl).
`36`		-* - Matrix `AFB` stores the details of the LU factorization of the band matrix A, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 1 to `KL`+`KU`+1, and the multipliers used during the factorization are stored in rows `KL`+`KU`+2 to 2*`KL`+`KU`+1.
`37`		-* - The leading dimension of `AB`, `LDAB` >= KL+KU+1.
`38`		-* - The leading dimension of `AFB`, `LDAFB` >= 2*KL+KU+1.
	`35`	+* - The norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix `A` could be poor. This also means that the solution `X`, estimated condition numbers, and error bounds could be unreliable.
	`36`	+* - Matrix `AB` is the matrix A in band storage, in rows 0 to `KL+KU`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB( KU+i-j, j ) = A( i, j )` for `max( 0, j - KU ) <= i <= min( N - 1, j + KL )`.
	`37`	+* - Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+1` to `2*KL+KU`.
	`38`	+* - The leading dimension of `AB`, `LDAB` >= `KL+KU+1`.
	`39`	+* - The leading dimension of `AFB`, `LDAFB` >= `2*KL+KU+1`.
`39`	`40`	`*`
`40`	`41`	`* @private`
`41`	`42`	* @param {NonNegativeInteger} N - number of rows in matrix `A`
Original file line number	Diff line number	Diff line change
`@@ -33,10 +33,11 @@ var base = require( './base.js' );`
`33`	`33`	`*`
`34`	`34`	`* ## Notes`
`35`	`35`	`*`
`36`		-* - Matrix `AB` is the matrix A in band storage, in rows 1 to `KL+KU+1`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB(KU+1+i-j,j) = A(i,j)` for max(1,j-KU)<=i<=min(N,j+kl).
`37`		-* - Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with `KL+KU` superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+2` to `2*KL+KU+1`.
`38`		-* - The leading dimension of `AB`, `LDAB` >= KL+KU+1.
`39`		-* - The leading dimension of `AFB`, `LDAFB` >= 2*KL+KU+1.
	`36`	+* - The norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix `A` could be poor. This also means that the solution `X`, estimated condition numbers, and error bounds could be unreliable.
	`37`	+* - Matrix `AB` is the matrix A in band storage, in rows 0 to `KL+KU`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB( KU+i-j, j ) = A( i, j )` for `max( 0, j - KU ) <= i <= min( N - 1, j + KL )`.
	`38`	+* - Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+1` to `2*KL+KU`.
	`39`	+* - The leading dimension of `AB`, `LDAB` >= `KL+KU+1`.
	`40`	+* - The leading dimension of `AFB`, `LDAFB` >= `2*KL+KU+1`.
`40`	`41`	`*`
`41`	`42`	* @param {string} order - order of matrix `A`
`42`	`43`	* @param {NonNegativeInteger} N - number of rows in matrix `A`
Original file line number	Diff line number	Diff line change
`@@ -30,10 +30,11 @@ var base = require( './base.js' );`
`30`	`30`	`*`
`31`	`31`	`* ## Notes`
`32`	`32`	`*`
`33`		-* - Matrix `AB` is the matrix A in band storage, in rows 1 to KL+KU+1. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB(KU+1+i-j,j) = A(i,j)` for max(1,j-KU)<=i<=min(N,j+kl).
`34`		-* - Matrix `AFB` stores the details of the LU factorization of the band matrix A, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 1 to `KL`+`KU`+1, and the multipliers used during the factorization are stored in rows `KL`+`KU`+2 to 2*`KL`+`KU`+1.
`35`		-* - The leading dimension of `AB`, `LDAB` >= KL+KU+1.
`36`		-* - The leading dimension of `AFB`, `LDAFB` >= 2*KL+KU+1.
	`33`	+* - The norm is used. If this is much less than 1, the stability of the LU factorization of the (equilibrated) matrix `A` could be poor. This also means that the solution `X`, estimated condition numbers, and error bounds could be unreliable.
	`34`	+* - Matrix `AB` is the matrix A in band storage, in rows 0 to `KL+KU`. The j-th column of A is stored in the j-th column of the matrix `AB` as `AB( KU+i-j, j ) = A( i, j )` for `max( 0, j - KU ) <= i <= min( N - 1, j + KL )`.
	`35`	+* - Matrix `AFB` stores the details of the LU factorization of the band matrix `A`, as computed by `DGBTRF`. `U` is stored as an upper triangular band matrix with KL+KU superdiagonals in rows 0 to `KL+KU+1`, and the multipliers used during the factorization are stored in rows `KL+KU+1` to `2*KL+KU`.
	`36`	+* - The leading dimension of `AB`, `LDAB` >= `KL+KU+1`.
	`37`	+* - The leading dimension of `AFB`, `LDAFB` >= `2*KL+KU+1`.
`37`	`38`	`*`
`38`	`39`	* @param {NonNegativeInteger} N - number of rows in matrix `A`
`39`	`40`	* @param {NonNegativeInteger} KL - number of subdiagonals within the band of matrix `A`