refactor: reduce arithmetic operations

---
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: Shabareesh Shetty

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

@@ -164,10 +164,10 @@ function scal( uplo, N, beta, X, strideX1, strideX2, offsetX ) { // TODO: consid
 // MAIN //
 
 /**
-* Performs one of the symmetric rank `K` operations `C = α*A*A**T + β*C` or `C = α*A**T*A + β*C` where `α` and `β` are scalars, `C` is an `N` by `N` symmetric matrix and `A` is an `N` by `K` matrix in the first case and a `K` by `N` matrix in the second case.
+* Performs one of the symmetric rank `K` operations `C = α*A*A^T + β*C` or `C = α*A^T*A + β*C` where `α` and `β` are scalars, `C` is an `N` by `N` symmetric matrix and `A` is an `N` by `K` matrix in the first case and a `K` by `N` matrix in the second case.
 *
 * @private
-* @param {string} uplo - specifies whether the upper or lower triangular part of the symmetric matrix `C` is supplied
+* @param {string} uplo - specifies whether the upper or lower triangular part of the symmetric matrix `C` to be referenced
 * @param {string} trans - specifies whether `A` should be transposed, conjugate-transposed, or not transposed
 * @param {NonNegativeInteger} N - order of the matrix `C`
 * @param {NonNegativeInteger} K - number of columns or number of rows of the matrix `A`
@@ -206,6 +206,8 @@ function dsyrk( uplo, trans, N, K, alpha, A, strideA1, strideA2, offsetA, beta,
 	var i2;
 	var i1;
 	var i0;
+	var ia;
+	var ic;
 
 	isrma = isRowMajor( [ strideA1, strideA2 ] );
 
@@ -242,13 +244,15 @@ function dsyrk( uplo, trans, N, K, alpha, A, strideA1, strideA2, offsetA, beta,
 	) {
 		for ( i2 = 0; i2 < N; i2++ ) {
 			for ( i1 = i2; i1 < N; i1++ ) {
+				ic = offsetC + ( i1 * sc0 );
 				tmp = 0.0;
 				for ( i0 = 0; i0 < K; i0++ ) {
-					oa1 = oa + ( i2 * sa1 ) + ( i0 * sa0 );
-					oa2 = oa + ( i1 * sa1 ) + ( i0 * sa0 );
+					ia = oa + ( i0 * sa0 );
+					oa1 = ia + ( i2 * sa1 );
+					oa2 = ia + ( i1 * sa1 );
 					tmp += A[ oa1 ] * A[ oa2 ];
 				}
-				idx = offsetC + ( i2 * sc1 ) + ( i1 * sc0 );
+				idx = ic + ( i2 * sc1 );
 				C[ idx ] += alpha * tmp;
 			}
 		}
@@ -261,12 +265,14 @@ function dsyrk( uplo, trans, N, K, alpha, A, strideA1, strideA2, offsetA, beta,
 		for ( i2 = 0; i2 < N; i2++ ) {
 			for ( i1 = 0; i1 <= i2; i1++ ) {
 				tmp = 0.0;
+				ic = offsetC + ( i1 * sc0 );
 				for ( i0 = 0; i0 < K; i0++ ) {
-					oa1 = oa + ( i2 * sa1 ) + ( i0 * sa0 );
-					oa2 = oa + ( i1 * sa1 ) + ( i0 * sa0 );
+					ia = oa + ( i0 * sa0 );
+					oa1 = ia + ( i2 * sa1 );
+					oa2 = ia + ( i1 * sa1 );
 					tmp += A[ oa1 ] * A[ oa2 ];
 				}
-				idx = offsetC + ( i2 * sc1 ) + ( i1 * sc0 );
+				idx = ic + ( i2 * sc1 );
 				C[ idx ] += alpha * tmp;
 			}
 		}
@@ -278,13 +284,15 @@ function dsyrk( uplo, trans, N, K, alpha, A, strideA1, strideA2, offsetA, beta,
 	) {
 		for ( i2 = 0; i2 < N; i2++ ) {
 			for ( i1 = i2; i1 < N; i1++ ) {
+				ic = offsetC + ( i1 * sc0 );
 				tmp = 0.0;
 				for ( i0 = 0; i0 < K; i0++ ) {
-					oa1 = oa + ( i0 * sa1 ) + ( i2 * sa0 );
-					oa2 = oa + ( i0 * sa1 ) + ( i1 * sa0 );
+					ia = oa + ( i0 * sa1 );
+					oa1 = ia + ( i2 * sa0 );
+					oa2 = ia + ( i1 * sa0 );
 					tmp += A[ oa1 ] * A[ oa2 ];
 				}
-				idx = offsetC + ( i2 * sc1 ) + ( i1 * sc0 );
+				idx = ic + ( i2 * sc1 );
 				C[ idx ] += alpha * tmp;
 			}
 		}
@@ -293,13 +301,15 @@ function dsyrk( uplo, trans, N, K, alpha, A, strideA1, strideA2, offsetA, beta,
 	// ( isrma && trans !== 'no-transpose' && uplo === 'lower' ) || ( !isrma && trans === 'no-transpose' && uplo === 'upper' )
 	for ( i2 = 0; i2 < N; i2++ ) {
 		for ( i1 = 0; i1 <= i2; i1++ ) {
+			ic = offsetC + ( i1 * sc0 );
 			tmp = 0.0;
 			for ( i0 = 0; i0 < K; i0++ ) {
-				oa1 = oa + ( i0 * sa1 ) + ( i2 * sa0 );
-				oa2 = oa + ( i0 * sa1 ) + ( i1 * sa0 );
+				ia = oa + ( i0 * sa1 );
+				oa1 = ia + ( i2 * sa0 );
+				oa2 = ia + ( i1 * sa0 );
 				tmp += A[ oa1 ] * A[ oa2 ];
 			}
-			idx = offsetC + ( i2 * sc1 ) + ( i1 * sc0 );
+			idx = ic + ( i2 * sc1 );
 			C[ idx ] += alpha * tmp;
 		}
 	}