Make symtriUpper! rely on a QL style algorithm instead of a transposed LQ

This allows for working on columns instead of rows of the matrix
which is faster. Also, simplify the implementations to rely on
exsiting linear algebra routines. This also fixed a bug.

Remove the AbstractMatrix sybtyping of EigenQ in alignment with the
changes to LinearAlgebra.

Author: andreasnoack

src/eigenSelfAdjoint.jl

@@ -3,7 +3,7 @@ using LinearAlgebra
 using LinearAlgebra: givensAlgorithm
 
 ## EigenQ
-struct EigenQ{T} <: AbstractMatrix{T}
+struct EigenQ{T}
     uplo::Char
     factors::Matrix{T}
     τ::Vector{T}
@@ -23,35 +23,25 @@ end
 function LinearAlgebra.lmul!(Q::EigenQ, B::StridedVecOrMat)
     m, n = size(B)
     if size(Q, 1) != m
-        throw(DimensionMismatch(""))
+        throw(DimensionMismatch("first dimension of second argument matrix doesn't match the size of the first argument reflectors"))
     end
     if Q.uplo == 'L'
-        @inbounds for k = length(Q.τ):-1:1
-            for j = 1:size(B, 2)
-                vb = B[k+1, j]
-                for i = (k+2):m
-                    vb += Q.factors[i, k]'B[i, j]
-                end
-                τkvb = Q.τ[k]'vb
-                B[k+1, j] -= τkvb
-                for i = (k+2):m
-                    B[i, j] -= Q.factors[i, k] * τkvb
-                end
-            end
+        for k = length(Q.τ):-1:1
+            h = view(Q.factors, (k + 1):m, k)
+            τ = Q.τ[k]
+            tmp = h[1]
+            h[1] = 1
+            B[(k + 1):m, :] .-= h*τ*h'*view(B, (k + 1):m, :)
+            h[1] = tmp
         end
     elseif Q.uplo == 'U'
-        @inbounds for k = length(Q.τ):-1:1
-            for j = 1:size(B, 2)
-                vb = B[k+1, j]
-                for i = (k+2):m
-                    vb += Q.factors[k, i] * B[i, j]
-                end
-                τkvb = Q.τ[k]'vb
-                B[k+1, j] -= τkvb
-                for i = (k+2):m
-                    B[i, j] -= Q.factors[k, i]' * τkvb
-                end
-            end
+        for k = length(Q.τ):-1:1
+            h = view(Q.factors, 1:(m - k), m - k + 1)
+            τ = Q.τ[k]
+            tmp = h[end]
+            h[end] = 1
+            B[1:(n - k), :] .-= h*τ*h'*view(B, 1:(n - k), :)
+            h[end] = tmp
         end
     else
         throw(ArgumentError("Q.uplo is neither 'L' or 'U'. This should never happen."))
@@ -62,45 +52,33 @@ end
 function LinearAlgebra.rmul!(A::StridedMatrix, Q::EigenQ)
     m, n = size(A)
     if size(Q, 1) != n
-        throw(DimensionMismatch(""))
+        throw(DimensionMismatch("second dimension of first argument matrix doesn't match the size of the second argument reflectors"))
     end
     if Q.uplo == 'L'
         for k = 1:length(Q.τ)
-            for i = 1:size(A, 1)
-                a = view(A, i, :)
-                va = A[i, k+1]
-                for j = (k+2):n
-                    va += A[i, j] * Q.factors[j, k]
-                end
-                τkva = va * Q.τ[k]'
-                A[i, k+1] -= τkva
-                for j = (k+2):n
-                    A[i, j] -= τkva * Q.factors[j, k]'
-                end
-            end
+            h = view(Q.factors, (k + 1):n, k)
+            τ = Q.τ[k]
+            tmp = h[1]
+            h[1] = 1
+            A[:, (k + 1):n] .-= view(A, :, (k + 1):n)*h*τ*h'
+            h[1] = tmp
         end
-    elseif Q.uplo == 'U' # FixMe! Should consider reordering loops
+    elseif Q.uplo == 'U'
         for k = 1:length(Q.τ)
-            for i = 1:size(A, 1)
-                a = view(A, i, :)
-                va = A[i, k+1]
-                for j = (k+2):n
-                    va += A[i, j] * Q.factors[k, j]'
-                end
-                τkva = va * Q.τ[k]'
-                A[i, k+1] -= τkva
-                for j = (k+2):n
-                    A[i, j] -= τkva * Q.factors[k, j]
-                end
-            end
+            h = view(Q.factors, 1:(n - k), n - k + 1)
+            τ = Q.τ[k]
+            tmp = h[end]
+            h[end] = 1
+            A[:, 1:(n - k)] .-= view(A, :, 1:(n - k))*h*τ*h'
+            h[end] = tmp
         end
     else
         throw(ArgumentError("Q.uplo is neither 'L' or 'U'. This should never happen."))
     end
     return A
 end
 
-Base.Array(Q::EigenQ) = lmul!(Q, Matrix{eltype(Q)}(I, size(Q, 1), size(Q, 1)))
+Base.Array(Q::EigenQ{T}) where T = lmul!(Q, Matrix{T}(I, size(Q, 1), size(Q, 1)))
 
 
 ## SymmetricTridiagonalFactorization
@@ -463,49 +441,37 @@ function symtriLower!(
 
     @inbounds for k = 1:(n-2+!(T <: Real))
 
-        τk = LinearAlgebra.reflector!(view(AS, (k+1):n, k))
+        x = view(AS, (k + 1):n, k)
+
+        τk = LinearAlgebra.reflector!(x)
         τ[k] = τk
 
-        for i = (k+1):n
-            u[i] = AS[i, k+1]
-        end
-        for j = (k+2):n
-            ASjk = AS[j, k]
-            for i = j:n
-                u[i] += AS[i, j] * ASjk
-            end
-        end
-        for j = (k+1):(n-1)
-            tmp = zero(T)
-            for i = j+1:n
-                tmp += AS[i, j]'AS[i, k]
-            end
-            u[j] += tmp
-        end
+        # Temporarily store the implicit 1
+        tmp = x[1]
+        x[1] = 1
 
-        vcAv = u[k+1]
-        for i = (k+2):n
-            vcAv += AS[i, k]'u[i]
-        end
-        ξτ2 = real(vcAv) * abs2(τk) / 2
+        Ã = view(AS, (k + 1):n, (k + 1):n)
+        ũ = view(u, (k + 1):n)
 
-        u[k+1] = u[k+1] * τk - ξτ2
-        for i = (k+2):n
-            u[i] = u[i] * τk - ξτ2 * AS[i, k]
-        end
+        # Form Ãvτ
+        mul!(ũ, Hermitian(Ã, :L), x, τk, zero(τk))
 
-        AS[k+1, k+1] -= 2real(u[k+1])
-        for i = (k+2):n
-            AS[i, k+1] -= u[i] + AS[i, k] * u[k+1]'
-        end
-        for j = (k+2):n
-            ASjk = AS[j, k]
-            uj = u[j]
-            AS[j, j] -= 2real(uj * ASjk')
-            for i = (j+1):n
-                AS[i, j] -= u[i] * ASjk' + AS[i, k] * uj'
+        # Form τx'Ãvτ (which is real except for rounding)
+        ξ = real(τk'*(x'*ũ))
+
+        # Compute the rank up and down grade
+        # Ã = Ã + τx'Ãvτ - τx'Ã - Ãvτ
+        for j in 1:(n - k)
+            xⱼ = x[j]
+            ũⱼ = ũ[j]
+            ξxⱼ = ξ * xⱼ
+            for i in j:(n - k)
+                AS[k + i, k + j] += x[i] * ξxⱼ' - x[i] * ũⱼ' - ũ[i] * xⱼ'
             end
         end
+
+        # Restore element
+        x[1] = tmp
     end
     SymmetricTridiagonalFactorization(
         EigenQ(
@@ -531,37 +497,41 @@ function symtriUpper!(
     end
 
     @inbounds for k = 1:(n-2+!(T <: Real))
-        # This is a bit convoluted method to get the conjugated vector but conjugation is required for correctness of arrays of quaternions. Eventually, it should be sufficient to write vec(x') but it currently (July 10, 2018) hits a bug in LinearAlgebra
-        τk = LinearAlgebra.reflector!(vec(transpose(view(AS, k, (k+1):n)')))
-        τ[k] = τk'
-
-        for j = (k+1):n
-            tmp = AS[k+1, j]
-            for i = (k+2):j
-                tmp += AS[k, i] * AS[i, j]
-            end
-            for i = (j+1):n
-                tmp += AS[k, i] * AS[j, i]'
-            end
-            u[j] = τk' * tmp
-        end
+        # LAPACK allows the reflection element to be chosen freely whereas
+        # LinearAlgebra's reflector! assumes it is the first element in the vector
+        # Maybe we should implement a method similar to the LAPACK version
+        x = view(AS, 1:(n - k), n - k + 1)
+        xᵣ = view(AS, (n - k):-1:1, n - k + 1)
 
-        vcAv = u[k+1]
-        for i = (k+2):n
-            vcAv += u[i] * AS[k, i]'
-        end
-        ξ = real(vcAv * τk)
-
-        for j = (k+1):n
-            ujt = u[j]
-            hjt = j > (k + 1) ? AS[k, j] : one(ujt)
-            ξhjt = ξ * hjt
-            for i = (k+1):(j-1)
-                hit = i > (k + 1) ? AS[k, i] : one(ujt)
-                AS[i, j] -= hit' * ujt + u[i]' * hjt - hit' * ξhjt
+        τk = LinearAlgebra.reflector!(xᵣ)
+        τ[k] = τk
+
+        # Temporarily store the implicit 1
+        tmp = x[end]
+        x[end] = 1
+
+        Ã = view(AS, 1:(n - k), 1:(n - k))
+        ũ = view(u, 1:(n - k))
+
+        # Form Ãvτ
+        mul!(ũ, Hermitian(Ã, :U), x, τk, zero(τk))
+
+        # Form τx'Ãvτ (which is real except for rounding)
+        ξ = real(τk'*(x'*ũ))
+
+        # Compute the rank up and down grade
+        # Ã = Ã + τx'Ãvτ - τx'Ã - Ãvτ
+        for j in 1:(n - k)
+            xⱼ = x[j]
+            ũⱼ = ũ[j]
+            ξxⱼ = ξ * xⱼ
+            for i in 1:j
+                AS[i, j] += x[i] * ξxⱼ' - x[i] * ũⱼ' - ũ[i] * xⱼ'
             end
-            AS[j, j] -= 2 * real(hjt' * ujt) - abs2(hjt) * ξ
         end
+
+        # Restore element
+        x[end] = tmp
     end
     SymmetricTridiagonalFactorization(
         EigenQ(

test/eigenselfadjoint.jl

@@ -58,12 +58,17 @@ using Test, GenericLinearAlgebra, LinearAlgebra, Quaternions
         vals, vecs = eigen(A)
         @test issorted(vals)
 
+        @testset "symtri!" begin
+            T = GenericLinearAlgebra.symtri!(copy(A))
+            Q = Array(T.reflectors)
+            @test Q == lmul!(T.reflectors, Matrix{eltype(A)}(I, size(A)...))
+            @test Q ≈ rmul!(Matrix{eltype(A)}(I, size(A)...), T.reflectors)
+            @test Q'Q ≈ Q*Q' ≈ I
+            @test Q' * A * Q ≈ T.diagonals
+        end
+
         @testset "default" begin
-            if uplo == :L # FixMe! Probably an conjugation is off somewhere. Don't have time to check now.
-                @test_broken vecs' * A * vecs ≈ diagm(0 => vals)
-            else
-                @test vecs' * A * vecs ≈ diagm(0 => vals)
-            end
+            @test A * vecs ≈ vecs * Diagonal(vals)
             @test eigvals(A) ≈ vals
             @test vals ≈ λ rtol = 1e-13 * n
             @test vecs'vecs ≈ Matrix(I, n, n)