diff --git a/src/MatrixFactorizations.jl b/src/MatrixFactorizations.jl
index b017912..34f9847 100644
--- a/src/MatrixFactorizations.jl
+++ b/src/MatrixFactorizations.jl
@@ -28,7 +28,7 @@ import ArrayLayouts: reflector!, reflectorApply!, materialize!, @_layoutlmul, @_
 
 
 
-export ul, ul!, ql, ql!, qrunblocked, qrunblocked!, UL, QL, choleskyinv!, choleskyinv
+export ul, ul!, ql, ql!, qrunblocked, qrunblocked!, UL, QL
 
 const AdjointQtype = isdefined(LinearAlgebra, :AdjointQ) ? LinearAlgebra.AdjointQ : Adjoint
 const AbstractQtype = AbstractQ <: AbstractMatrix ? AbstractMatrix : AbstractQ
@@ -136,7 +136,6 @@ include("ul.jl")
 include("qr.jl")
 include("ql.jl")
 include("rq.jl")
-include("choleskyinv.jl")
 include("polar.jl")
 
 end #module
diff --git a/test/runtests.jl b/test/runtests.jl
index b092d32..70dc8ef 100644
--- a/test/runtests.jl
+++ b/test/runtests.jl
@@ -439,33 +439,4 @@ end
 end
 
 include("test_rq.jl")
-
-# choleskyinv.jl
-@testset "choleskyinv" begin
-    etol = 1e-9
-    n = 20
-	# real matrices
-    A = randn(n, n)
-    P = A*A'
-    Pi = inv(P)
-    C = choleskyinv!(copy(Matrix(P)))
-	@test(norm(C.c.L*C.c.U-P)/√n < etol)
-	@test(norm(C.ci.U*C.ci.L-Pi)/√n < etol)
-    C = choleskyinv(P)
-	@test(norm(C.c.L*C.c.U-P)/√n < etol)
-	@test(norm(C.ci.U*C.ci.L-Pi)/√n < etol)
-    
-	# repeat the test for complex matrices
-    A=randn(ComplexF64, n, n)
-    P=A*A'
-    Pi=inv(P)
-	C=choleskyinv!(copy(Matrix(P)))
-	@test(norm(C.c.L*C.c.U-P)/√n < etol)
-	@test(norm(C.ci.U*C.ci.L-Pi)/√n < 4etol)
-    C = choleskyinv(P)
-	@test(norm(C.c.L*C.c.U-P)/√n < etol)
-	@test(norm(C.ci.U*C.ci.L-Pi)/√n < 4etol)
-end
-
-
 include("test_polar.jl")