/**
 * Perform QR factorization in-place.
 * Subfunction that analyzes eigenvalues by QR decomposition.
 *
 * Single-shift Wilkinson iteration with LAPACK-style exceptional shifts:
 * deflates the trailing subdiagonal one row at a time as it converges. A
 * complex eigenvalue pair leaves a 2×2 trailing block whose inner subdiagonal
 * does not vanish — only safe today for matrices with all-real eigenvalues.
 * If convergence fails within 30·n sweeps (LAPACK convention), the routine
 * throws rather than spinning.
 *
 * @see http://www-in.aut.ac.jp/~minemura/pub/Csimu/C/QRmethod.html
 * @param {number[]|Float64Array} a Square matrix, column-major flat layout (a[j*n + i] = row i, col j); modified in place (R is left on the upper triangle)
 * @param {number} n size of the matrix in single dimension
 */
export function matrix_qr_in_place(a: number[] | Float64Array, n: number): void;
//# sourceMappingURL=matrix_qr_in_place.d.ts.map