@@ -288,7 +288,7 @@ private int findSmallSubDiagonalElement(final int startIdx, final double norm) {
288288 }
289289
290290 private void computeShift (final int idx , final int iteration ,
291- final ComplexShiftInfo shift ) {
291+ final ComplexShiftInfo shift ) {
292292 // If iterations are high, use ad-hoc (exceptional) shifts to break cycles.
293293 // We check iterations 10, 20, and 30 to inject shifts if convergence is stalling.
294294 if (iteration == 10 || iteration == 20 || iteration == 30 ) {
@@ -303,7 +303,7 @@ private void computeShift(final int idx, final int iteration,
303303
304304 // Vary the shift strategy to ensure we don't get stuck in a specific cycle.
305305 // - Iteration 10 & 20: Use the classic empirical shift factor 0.75
306- // - Iteration 30: Use 0.964, a heuristic value (from JAMA/EISPACK) known to break
306+ // - Iteration 30: Use 0.964, a heuristic value (from JAMA/EISPACK) known to break
307307 // cycles that are stable under 0.75.
308308 double alpha = (iteration == 30 ) ? 0.964 : 0.75 ;
309309
@@ -340,7 +340,7 @@ private void computeShift(final int idx, final int iteration,
340340 shift .x = root2 ;
341341 }
342342 }
343-
343+
344344 private void performQRStep (final int il , final int iu , final ComplexShiftInfo shift ) {
345345 Complex x = matrixT [il ][il ].subtract (shift .x );
346346 Complex y = matrixT [il + 1 ][il ];
0 commit comments