@@ -378,7 +378,7 @@ function decompress!(
378
378
) where {R<: Real }
379
379
@compat (; S, color, star_set) = result
380
380
@compat (; star, hub, spokes) = star_set
381
- check_same_pattern (A, S)
381
+ uplo == :F && check_same_pattern (A, S)
382
382
A .= zero (R)
383
383
for i in axes (A, 1 )
384
384
if ! iszero (S[i, i])
@@ -409,7 +409,7 @@ function decompress_single_color!(
409
409
) where {R<: Real }
410
410
@compat (; S, color, group, star_set) = result
411
411
@compat (; hub, spokes) = star_set
412
- check_same_pattern (A, S)
412
+ uplo == :F && check_same_pattern (A, S)
413
413
for i in axes (A, 1 )
414
414
if ! iszero (S[i, i]) && color[i] == c
415
415
A[i, i] = b[i]
@@ -447,7 +447,7 @@ function decompress!(
447
447
A:: SparseMatrixCSC{R} , B:: AbstractMatrix{R} , result:: StarSetColoringResult , uplo:: Symbol
448
448
) where {R<: Real }
449
449
@compat (; S, compressed_indices) = result
450
- check_same_pattern (A, S)
450
+ uplo == :F && check_same_pattern (A, S)
451
451
rvA = rowvals (A)
452
452
nzA = nonzeros (A)
453
453
for j in axes (S, 2 )
@@ -472,7 +472,7 @@ function decompress!(
472
472
uplo:: Symbol = :F ,
473
473
) where {R<: Real }
474
474
@compat (; S, color, vertices_by_tree, reverse_bfs_orders, buffer) = result
475
- check_same_pattern (A, S)
475
+ uplo == :F && check_same_pattern (A, S)
476
476
A .= zero (R)
477
477
478
478
if eltype (buffer) == R
@@ -519,7 +519,7 @@ function decompress!(
519
519
@compat (;
520
520
S, color, strict_upper_nonzero_inds, T_factorization, strict_upper_nonzeros_A
521
521
) = result
522
- check_same_pattern (A, S)
522
+ uplo == :F && check_same_pattern (A, S)
523
523
524
524
# TODO : for some reason I cannot use ldiv! with a sparse QR
525
525
strict_upper_nonzeros_A = T_factorization \ vec (B)
0 commit comments