diff --git a/src/factorization.jl b/src/factorization.jl
index 98c431d9e..3911e5d8e 100644
--- a/src/factorization.jl
+++ b/src/factorization.jl
@@ -723,22 +723,39 @@ end
 
 ################################## Factorizations which require solve! overloads
 
+# Default control array of 20 elements from Umfpack
+
+#!!!ATTENTION
+#These array could change and whenever there will be a change in the SparseArrays package this array must be changed
+const default_control=SparseArrays.UMFPACK.get_umfpack_control(Float64,Int64)
+
 """
-`UMFPACKFactorization(;reuse_symbolic=true, check_pattern=true)`
+`UMFPACKFactorization(;reuse_symbolic=true, check_pattern=true, control=Vector{Float64}(20))`
 
 A fast sparse multithreaded LU-factorization which specializes on sparsity
 patterns with “more structure”.
 
+## Fields
+
+* `reuse_symbolic`: Whether the symbolic factorization is reused between calls. This requires that the sparsity pattern is
+  preserved. Defaults to true.
+* `check_pattern`: Whether the sparsity pattern is checked for changes to allow for symbolic factorization caching. 
+  The default is true.
+* `control`: A control vector for more options to pass to UMFPACK. See the UMFPACK documentation for more details.
+
 !!! note
 
     By default, the SparseArrays.jl are implemented for efficiency by caching the
     symbolic factorization. I.e., if `set_A` is used, it is expected that the new
     `A` has the same sparsity pattern as the previous `A`. If this algorithm is to
     be used in a context where that assumption does not hold, set `reuse_symbolic=false`.
+
 """
-Base.@kwdef struct UMFPACKFactorization <: AbstractFactorization
+
+Base.@kwdef struct UMFPACKFactorization{T <: Union{Nothing, Vector{Float64}}} <: AbstractFactorization
     reuse_symbolic::Bool = true
     check_pattern::Bool = true # Check factorization re-use
+    control::T=nothing
 end
 
 const PREALLOCATED_UMFPACK = SparseArrays.UMFPACK.UmfpackLU(SparseMatrixCSC(0, 0, [1],
@@ -771,6 +788,7 @@ end
 function SciMLBase.solve!(cache::LinearCache, alg::UMFPACKFactorization; kwargs...)
     A = cache.A
     A = convert(AbstractMatrix, A)
+    isnothing(alg.control) ? control=default_control : control=alg.control
     if cache.isfresh
         cacheval = @get_cacheval(cache, :UMFPACKFactorization)
         if alg.reuse_symbolic
@@ -782,15 +800,15 @@ function SciMLBase.solve!(cache::LinearCache, alg::UMFPACKFactorization; kwargs.
                 fact = lu(
                     SparseMatrixCSC(size(A)..., getcolptr(A), rowvals(A),
                         nonzeros(A)),
-                    check = false)
+                    check = false, control=control)
             else
                 fact = lu!(cacheval,
                     SparseMatrixCSC(size(A)..., getcolptr(A), rowvals(A),
-                        nonzeros(A)), check = false)
+                        nonzeros(A)), check = false, control=control)
             end
         else
             fact = lu(SparseMatrixCSC(size(A)..., getcolptr(A), rowvals(A), nonzeros(A)),
-                check = false)
+                check = false, control=control)
         end
         cache.cacheval = fact
         cache.isfresh = false
diff --git a/test/controlvectortest.jl b/test/controlvectortest.jl
new file mode 100644
index 000000000..7dccdceff
--- /dev/null
+++ b/test/controlvectortest.jl
@@ -0,0 +1,12 @@
+using SparseArrays, LinearSolve
+
+A = sparse(rand(3,3));
+b=rand(3);
+prob = LinearProblem(A, b);
+
+#check without control Vector
+u=solve(prob,UMFPACKFactorization()).u
+
+#check plugging in a control vector
+controlv=SparseArrays.UMFPACK.get_umfpack_control(Float64,Int64)
+u=solve(prob,UMFPACKFactorization(control=controlv)).u
\ No newline at end of file