@@ -392,6 +392,7 @@ function Base.getproperty(F::BidiagonalFactorization, s::Symbol)
392
392
τl,
393
393
)
394
394
elseif s === :rightQ
395
+ # FIXME ! Can I get the LQPackedQ versino going to avoid the copy?
395
396
# return transpose(LinearAlgebra.LQPackedQ(R, τr)) # FixMe! check that this shouldn't be adjoint
396
397
LinearAlgebra. QRPackedQ (copy (transpose (R)), τr)
397
398
else
@@ -502,30 +503,32 @@ function rmul!(A::AbstractMatrix, adjQ::AdjointQtype{<:Any,<:LinearAlgebra.Hesse
502
503
return A
503
504
end
504
505
505
- function rmul! (A:: AbstractMatrix , Q:: LinearAlgebra.LQPackedQ )
506
-
507
- m, n = size (A)
508
-
509
- if n != size (Q, 1 )
510
- throw (DimensionMismatch (" " ))
511
- end
512
-
513
- for i = 1 : m
514
- for l = length (Q. τ): - 1 : 1
515
- τl = Q. τ[l]
516
- ṽ = view (Q. factors, l, (l+ 1 ): n)
517
- aᵀ = transpose (view (A, i, (l+ 1 ): n))
518
- aᵀv = A[i, l]
519
- if length (ṽ) > 0
520
- aᵀv += aᵀ * ṽ
521
- end
522
- A[i, l] -= aᵀv * τl
523
- aᵀ .- = aᵀv .* τl .* ṽ'
524
- end
525
- end
526
-
527
- return A
528
- end
506
+ # FIXME ! Commented out for now because we currently don't produce
507
+ # any LQPackedQ matrices.
508
+ # function rmul!(A::AbstractMatrix, Q::LinearAlgebra.LQPackedQ)
509
+
510
+ # m, n = size(A)
511
+
512
+ # if n != size(Q, 1)
513
+ # throw(DimensionMismatch(""))
514
+ # end
515
+
516
+ # for i = 1:m
517
+ # for l = length(Q.τ):-1:1
518
+ # τl = Q.τ[l]
519
+ # ṽ = view(Q.factors, l, (l+1):n)
520
+ # aᵀ = transpose(view(A, i, (l+1):n))
521
+ # aᵀv = A[i, l]
522
+ # if length(ṽ) > 0
523
+ # aᵀv += aᵀ * ṽ
524
+ # end
525
+ # A[i, l] -= aᵀv * τl
526
+ # aᵀ .-= aᵀv .* τl .* ṽ'
527
+ # end
528
+ # end
529
+
530
+ # return A
531
+ # end
529
532
530
533
# Overload LinearAlgebra methods
531
534
0 commit comments