@@ -146,7 +146,7 @@ function ctmrg_iteration(
146146 corner′, projector, info = c4v_projector! (enlarged_corner, alg. projector_alg)
147147 edge′ = c4v_renormalize_edge (network, env, projector)
148148 info = (;
149- contraction_metrics = (; info. truncation_error, info . condition_number ),
149+ contraction_metrics = (; info. truncation_error),
150150 info. D, info. V,
151151 )
152152 return CTMRGEnv (corner′, edge′), info
@@ -196,11 +196,6 @@ function c4v_projector!(enlarged_corner, alg::C4vEighProjector)
196196
197197 D, V, truncation_error = eigh_trunc! (enlarged_corner, eigh_alg)
198198
199- # get some decomposition info
200- condition_number = ignore_derivatives () do
201- return cond (D)
202- end
203-
204199 # Check for degenerate eigenvalues
205200 Zygote. isderiving () && ignore_derivatives () do
206201 if alg. verbosity > 0 && is_degenerate_spectrum (D)
@@ -209,7 +204,7 @@ function c4v_projector!(enlarged_corner, alg::C4vEighProjector)
209204 end
210205 end
211206
212- return D / norm (D), V, (; D, V, truncation_error, condition_number )
207+ return D / norm (D), V, (; D, V, truncation_error)
213208end
214209"""
215210 c4v_projector!(enlarged_corner, alg::C4vQRProjector)
@@ -225,7 +220,7 @@ Compute the C₄ᵥ projector by decomposing the column-enlarged corner with `le
225220function c4v_projector! (enlarged_corner, alg:: C4vQRProjector )
226221 Q, R = left_orth! (enlarged_corner, decomposition_algorithm (alg))
227222 # TODO : what's a meaningful way to compute a truncation error/condition number in this scheme?
228- return Q, (; Q, R, truncation_error = zero (scalartype (Q)), condition_number = 0 )
223+ return Q, (; Q, R, truncation_error = zero (scalartype (Q)))
229224end
230225
231226"""
0 commit comments