You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Right now sparse Cholesky factorization checks for symmetry in contrast to dense Cholesky.
julia> A =speye(4);A[1,2] =eps();
julia>cholfact(A)
ERROR: ArgumentError: sparse matrix is not symmetric/Hermitian
in cholfact at sparse/cholmod.jl:980in cholfact at sparse/cholmod.jl:1055
julia>cholfact(full(A))
Base.LinAlg.Cholesky{Float64,Array{Float64,2},:U} with factor:4x4 Base.LinAlg.UpperTriangular{Float64,Array{Float64,2}}:1.02.22045e-160.00.00.01.00.00.00.00.01.00.00.00.00.01.0
It is an easy fix to make this consistent, but which solution is preferred. Right now I lean towards the sparse solution where the matrix is checked for symmetry. If the user wants to bypass the check, there should be cholfact(Symmetric) method defined which is already the case for cholfact(Sparse).
The text was updated successfully, but these errors were encountered:
andreasnoack
changed the title
Dense and sparse cholfact handles diviations from symmetry differently
Dense and sparse cholfact handles deviations from symmetry differently
Mar 15, 2015
Right now sparse Cholesky factorization checks for symmetry in contrast to dense Cholesky.
It is an easy fix to make this consistent, but which solution is preferred. Right now I lean towards the sparse solution where the matrix is checked for symmetry. If the user wants to bypass the check, there should be
cholfact(Symmetric)
method defined which is already the case forcholfact(Sparse)
.The text was updated successfully, but these errors were encountered: