refactor: precompute indices

---
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: aayush0325

lib/node_modules/@stdlib/lapack/base/dgttrf/lib/base.js

@@ -78,8 +78,12 @@ function dgttrf( N, DL, sdl, odl, D, sd, od, DU, sdu, odu, DU2, sdu2, odu2, IPIV
 	var idu2;
 	var idu;
 	var idl;
+	var dli;
+	var dui;
 	var id;
 	var ip;
+	var di;
+	var ii;
 	var i;
 
 	// Quick return if possible
@@ -100,51 +104,61 @@ function dgttrf( N, DL, sdl, odl, D, sd, od, DU, sdu, odu, DU2, sdu2, odu2, IPIV
 
 	// Initialise ith element of DU2 as 0
 	for ( i = 0; i < N-2; i++ ) {
-		DU2[ idu + (sdu*i) ] = 0;
+		DU2[ idu + dui ] = 0;
 	}
 
 	for ( i = 0; i < N-2; i++ ) {
-		if ( abs( D[ id + (sd*i) ] ) >= abs( DL[ idl + (sdl*i) ] ) ) { // No row interchange required, eleminate ith element of DL
+		di = sd * i;
+		dli = sdl * i;
+		ii = si * i;
+		dui = sdu * i;
+
+		if ( abs( D[ id + di ] ) >= abs( DL[ idl + dli ] ) ) { // No row interchange required, eleminate ith element of DL
 			if ( D[ id ] !== 0.0 ) {
-				fact = DL[ idl + (sdl*i) ] / D[ id + (sd*i) ];
-				DL[ idl + (sdl*i) ] = fact;
-				D[ id + (sd*(i+1)) ] = D[ id + (sd*(i+1)) ] - ( fact*DU[ idu + (sdu*i) ] ); // eslint-disable-line max-len
+				fact = DL[ idl + dli ] / D[ id + di ];
+				DL[ idl + dli ] = fact;
+				D[ id + di + sd ] = D[ id + di + sd ] - ( fact*DU[ idu + dui ] ); // eslint-disable-line max-len
 			}
 		} else { // Interchange the ith and (i+1)th rows and eliminate ith element of DL
-			fact = D[ id+(sd*i) ] / DL[ idl+(sdl*i) ];
-			D[ id+(sd*i) ] = DL[ idl+(sdl*i) ];
-			DL[ idl+(sdl*i) ] = fact;
-			temp = DU[ idu+(sdu*i) ];
-			DU[ idu+(sdu*i) ] = D[ id + (sd*(i+1)) ];
-			D[ id+(sd*(i+1)) ] = temp - ( fact*D[ id+(sd*(i+1)) ] );
-			DU2[ idu2+(sdu2*i) ] = DU[ idu+(sdu*(i+1)) ];
-			DU[ idu+(sdu*(i+1)) ] = -fact*DU[ idu+(sdu*(i+1)) ];
-			IPIV[ ip+(si*i) ] = i + 1;
+			fact = D[ id + di ] / DL[ idl + dli ];
+			D[ id + di ] = DL[ idl + dli ];
+			DL[ idl + dli ] = fact;
+			temp = DU[ idu + dui ];
+			DU[ idu + dui ] = D[ id + di + sd ];
+			D[ id + di + sd ] = temp - ( fact * D[ id + di + sd ] );
+			DU2[ idu2 + ( sdu2 * i ) ] = DU[ idu + dui + sdu ];
+			DU[ idu + dui + sdu ] = -fact * DU[ idu + dui + sdu ];
+			IPIV[ ip + ii ] = i + 1;
 		}
 	}
 
 	if ( N > 1 ) {
 		i = N - 2;
-		if ( abs( D[ id + (sd*i) ] ) >= abs( DL[ idl + (sdl*i) ] ) ) {
-			if ( D[ id + (sd*i) ] !== 0 ) {
-				fact = DL[ idl + (sdl*i) ] / D[ id + (sd*i) ];
-				DL[ idl + (sdl*i) ] = fact;
-				D[ id + (sd*(i+1)) ] = D[ id + (sd*(i+1)) ] - (fact*DU[ idu + (sdu*i) ]); // eslint-disable-line max-len
+		di = sd * i;
+		dli = sdl * i;
+		ii = si * i;
+		dui = sdu * i;
+
+		if ( abs( D[ id + di ] ) >= abs( DL[ idl + dli ] ) ) {
+			if ( D[ id + di ] !== 0 ) {
+				fact = DL[ idl + dli ] / D[ id + di ];
+				DL[ idl + dli ] = fact;
+				D[ id + di + sd ] = D[ id + di + sd ] - (fact*DU[ idu + dui ]);
 			}
 		} else {
-			fact = D[ id+(sd*i) ] / DL[ idl+(sdl*i) ];
-			D[ id+(sd*i) ] = DL[ idl+(sdl*i) ];
-			DL[ idl+(sdl*i) ] = fact;
-			temp = DU[ idu+(sdu*i) ];
-			DU[ idu+(sdu*i) ] = D[ id + (sd*(i+1)) ];
-			D[ id+(sd*(i+1)) ] = temp - ( fact*D[ id+(sd*(i+1)) ] );
-			IPIV[ ip+(si*i) ] = i + 1;
+			fact = D[ id + di ] / DL[ idl + dli ];
+			D[ id + di ] = DL[ idl + dli ];
+			DL[ idl + dli ] = fact;
+			temp = DU[ idu + dui ];
+			DU[ idu + dui ] = D[ id + di + sd ];
+			D[ id + di + sd ] = temp - ( fact * D[ id + di + sd ] );
+			IPIV[ ip + ii ] = i + 1;
 		}
 	}
 
 	// Check for a 0 on the diagonal of U
 	for ( i = 0; i < N; i++ ) {
-		if ( D[ id+(sd*i) ] === 0.0 ) {
+		if ( D[ sd * i ] === 0.0 ) {
 			return i;
 		}
 	}