qr_r

std.linalg.qr_r · Level L4

The triangular factor R of A = Q·R, upper triangular with a positive diagonal.

A = Q·R, rᵢᵢ > 0

Signature

qr_r(A: f64[n+k, n]) → f64[n, n]

Structure

The function as NOVA stores it: one box per input, operation and output, and arrows that carry values. A double border marks another library function this one runs — called once, or by Scan once per element; select it to open that function.

Af64[n+k, n]QRTriangularRRf64[n, n]
  • input
  • operation
  • constant
  • call
  • output

Verification

  • Signature proven by NOVA’s shape solver, for every size.
  • Agrees with the reference np.linalg.qr(A)[1], signs fixed to 80 digits (100-digit arithmetic), on all 40 test cases.
  • All 894 float64 results inside the running error bound; the closest uses 3% of it.
  • Interpreter and NumPy backend return bit-identical results.
Accuracy in detail
correctly rounded (the float64 nearest the exact value)
61%
bit-equal to the NumPy formula in float64
100%
largest error, in units in the last place
58

Large ulp counts appear where a result is zero or tiny next to the numbers it is computed from (after cancellation, for example), so one unit in the last place is tiny too; the absolute error is still inside the bound.

Note

R's diagonal is made positive, which makes the factorization unique. The reference is Householder QR; the exact check reaches the same factors through the Cholesky factor of AᵀA, so two different algorithms have to agree.

Identity

Calls
—
Called by
—
sha256:8a1abc51e5e24eb3b01bb072c59087ed8e015ac0cf116006a38f072dfe16093a

The semantic hash of the graph. It changes when the program changes, and never when only its documentation does.