slight reorganization of supports_f

Author: lkdvos

ext/MatrixAlgebraKitAMDGPUExt/MatrixAlgebraKitAMDGPUExt.jl

@@ -30,6 +30,7 @@ end
 
 MatrixAlgebraKit.supports_svd(::ROCSOLVER, f::Symbol) = f in (:qr_iteration, :jacobi)
 MatrixAlgebraKit.supports_svd_full(::ROCSOLVER, f::Symbol) = f in (:qr_iteration, :jacobi)
+MatrixAlgebraKit.supports_eigh(::ROCSOLVER, f::Symbol) = f in (:jacobi, :divide_and_conquer, :qr_iteration, :bisection)
 
 function gesvd!(::ROCSOLVER, A::StridedROCMatrix, S::StridedROCVector, U::StridedROCMatrix, Vᴴ::StridedROCMatrix; kwargs...)
     m, n = size(A)

ext/MatrixAlgebraKitCUDAExt/MatrixAlgebraKitCUDAExt.jl

@@ -33,6 +33,8 @@ for f in (:geqrf!, :ungqr!, :unmqr!)
     @eval $f(::CUSOLVER, args...) = YACUSOLVER.$f(args...)
 end
 
+MatrixAlgebraKit.supports_eig(::CUSOLVER, f::Symbol) = f === :simple
+MatrixAlgebraKit.supports_eigh(::CUSOLVER, f::Symbol) = f in (:jacobi, :divide_and_conquer)
 MatrixAlgebraKit.supports_svd(::CUSOLVER, f::Symbol) = f in (:qr_iteration, :jacobi, :svd_polar)
 MatrixAlgebraKit.supports_svd_full(::CUSOLVER, f::Symbol) = f in (:qr_iteration, :jacobi, :svd_polar)
 

ext/MatrixAlgebraKitGenericLinearAlgebraExt.jl

@@ -11,6 +11,10 @@ const GlaFloat = Union{BigFloat, Complex{BigFloat}}
 const GlaStridedVecOrMatrix{T <: GlaFloat} = Union{StridedVector{T}, StridedMatrix{T}}
 MatrixAlgebraKit.default_driver(::Type{<:QRIteration}, ::Type{TA}) where {TA <: GlaStridedVecOrMatrix} = GLA()
 
+MatrixAlgebraKit.supports_eigh(::GLA, f::Symbol) = f === :qr_iteration
+MatrixAlgebraKit.supports_svd(::GLA, f::Symbol) = f === :qr_iteration
+MatrixAlgebraKit.supports_svd_full(::GLA, f::Symbol) = f === :qr_iteration
+
 function MatrixAlgebraKit.default_svd_algorithm(::Type{T}; kwargs...) where {T <: GlaStridedVecOrMatrix}
     return QRIteration(; kwargs...)
 end

ext/MatrixAlgebraKitGenericSchurExt.jl

@@ -14,7 +14,8 @@ end
 
 MatrixAlgebraKit.default_driver(::Type{<:Simple}, ::Type{TA}) where {TA <: StridedMatrix{<:GSFloat}} = GS()
 
-supports_schur(::GS, f::Symbol) = f === :simple
+MatrixAlgebraKit.supports_schur(::GS, f::Symbol) = f === :simple
+MatrixAlgebraKit.supports_eig(::GS, f::Symbol) = f === :simple
 
 function geev!(::GS, A::AbstractMatrix, Dd::AbstractVector, V::AbstractMatrix; kwargs...)
     D, Vmat = GenericSchur.eigen!(A)

src/implementations/eig.jl

@@ -101,8 +101,6 @@ end
 
 supports_eig(::Driver, ::Symbol) = false
 supports_eig(::LAPACK, f::Symbol) = f in (:simple, :expert)
-supports_eig(::CUSOLVER, f::Symbol) = f === :simple
-supports_eig(::GS, f::Symbol) = f === :simple
 
 for (f, f_lapack!, Alg) in (
         (:simple, :geev!, :Simple),

src/implementations/eigh.jl

@@ -110,9 +110,6 @@ end
 
 supports_eigh(::Driver, ::Symbol) = false
 supports_eigh(::LAPACK, f::Symbol) = f in (:mrrr, :divide_and_conquer, :qr_iteration, :bisection)
-supports_eigh(::GLA, f::Symbol) = f === :qr_iteration
-supports_eigh(::CUSOLVER, f::Symbol) = f in (:jacobi, :divide_and_conquer)
-supports_eigh(::ROCSOLVER, f::Symbol) = f in (:jacobi, :divide_and_conquer, :qr_iteration, :bisection)
 
 for (f, f_lapack!, Alg) in (
         (:mrrr, :heevr!, :MultipleRelativelyRobustRepresentations),

src/implementations/svd.jl

@@ -226,10 +226,8 @@ end
 
 supports_svd(::Driver, ::Symbol) = false
 supports_svd(::LAPACK, f::Symbol) = f in (:safe_divide_and_conquer, :divide_and_conquer, :qr_iteration, :bisection, :jacobi)
-supports_svd(::GLA, f::Symbol) = f === :qr_iteration
 supports_svd_full(::Driver, ::Symbol) = false
 supports_svd_full(::LAPACK, f::Symbol) = f in (:safe_divide_and_conquer, :divide_and_conquer, :qr_iteration)
-supports_svd_full(::GLA, f::Symbol) = f === :qr_iteration
 
 function svd_trunc_no_error!(A, USVᴴ, alg::TruncatedAlgorithm)
     U, S, Vᴴ = svd_compact!(A, USVᴴ, alg.alg)