-
-
Notifications
You must be signed in to change notification settings - Fork 58
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
3d12bd8
commit f336a16
Showing
4 changed files
with
171 additions
and
18 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,6 +1,6 @@ | ||
| MIT License | ||
|
|
||
| Copyright (c) 2021 Jonathan <[email protected]> and contributors | ||
| Copyright (c) 2021 SciML and contributors | ||
|
|
||
| Permission is hereby granted, free of charge, to any person obtaining a copy | ||
| of this software and associated documentation files (the "Software"), to deal | ||
|
|
@@ -19,3 +19,6 @@ AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER | |
| LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, | ||
| OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE | ||
| SOFTWARE. | ||
|
|
||
| SimpleLU.jl is derived from https://github.com/JuliaGNI/SimpleSolvers.jl under | ||
| an MIT license. | ||
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,132 @@ | ||
| ## From https://github.com/JuliaGNI/SimpleSolvers.jl/blob/master/src/linear/lu_solver.jl | ||
|
|
||
| mutable struct LUSolver{T} | ||
| n::Int | ||
| A::Matrix{T} | ||
| b::Vector{T} | ||
| x::Vector{T} | ||
| pivots::Vector{Int} | ||
| perms::Vector{Int} | ||
| info::Int | ||
|
|
||
| LUSolver{T}(n) where {T} = new(n, zeros(T, n, n), zeros(T, n), zeros(T, n), zeros(Int, n), zeros(Int, n), 0) | ||
| end | ||
|
|
||
| function LUSolver(A::Matrix{T}) where {T} | ||
| n = LinearAlgebra.checksquare(A) | ||
| lu = LUSolver{eltype(A)}(n) | ||
| lu.A .= A | ||
| lu | ||
| end | ||
|
|
||
| function LUSolver(A::Matrix{T}, b::Vector{T}) where {T} | ||
| n = LinearAlgebra.checksquare(A) | ||
| @assert n == length(b) | ||
| lu = LUSolver{eltype(A)}(n) | ||
| lu.A .= A | ||
| lu.b .= b | ||
| lu | ||
| end | ||
|
|
||
| function simplelu_factorize!(lu::LUSolver{T}, pivot=true) where {T} | ||
| A = lu.A | ||
|
|
||
| begin | ||
| @inbounds for i in eachindex(lu.perms) | ||
| lu.perms[i] = i | ||
| end | ||
|
|
||
| @inbounds for k = 1:lu.n | ||
| # find index max | ||
| kp = k | ||
| if pivot | ||
| amax = real(zero(T)) | ||
| for i = k:lu.n | ||
| absi = abs(A[i,k]) | ||
| if absi > amax | ||
| kp = i | ||
| amax = absi | ||
| end | ||
| end | ||
| end | ||
| lu.pivots[k] = kp | ||
| lu.perms[k], lu.perms[kp] = lu.perms[kp], lu.perms[k] | ||
|
|
||
| if A[kp,k] != 0 | ||
| if k != kp | ||
| # Interchange | ||
| for i = 1:lu.n | ||
| tmp = A[k,i] | ||
| A[k,i] = A[kp,i] | ||
| A[kp,i] = tmp | ||
| end | ||
| end | ||
| # Scale first column | ||
| Akkinv = inv(A[k,k]) | ||
| for i = k+1:lu.n | ||
| A[i,k] *= Akkinv | ||
| end | ||
| elseif lu.info == 0 | ||
| lu.info = k | ||
| end | ||
| # Update the rest | ||
| for j = k+1:lu.n | ||
| for i = k+1:lu.n | ||
| A[i,j] -= A[i,k]*A[k,j] | ||
| end | ||
| end | ||
| end | ||
|
|
||
| lu.info | ||
| end | ||
| end | ||
|
|
||
| function simplelu_solve!(lu::LUSolver{T}) where {T} | ||
| local s::T | ||
|
|
||
| @inbounds for i = 1:lu.n | ||
| lu.x[i] = lu.b[lu.perms[i]] | ||
| end | ||
|
|
||
| @inbounds for i = 2:lu.n | ||
| s = 0 | ||
| for j = 1:i-1 | ||
| s += lu.A[i,j] * lu.x[j] | ||
| end | ||
| lu.x[i] -= s | ||
| end | ||
|
|
||
| lu.x[lu.n] /= lu.A[lu.n,lu.n] | ||
| @inbounds for i = lu.n-1:-1:1 | ||
| s = 0 | ||
| for j = i+1:lu.n | ||
| s += lu.A[i,j] * lu.x[j] | ||
| end | ||
| lu.x[i] -= s | ||
| lu.x[i] /= lu.A[i,i] | ||
| end | ||
|
|
||
| lu.b .= lu.x | ||
|
|
||
| lu.x | ||
| end | ||
|
|
||
| ### Wrapper | ||
|
|
||
| struct SimpleLUFactorization <: AbstractFactorization | ||
| pivot::Bool | ||
| SimpleLUFactorization(pivot=true) = new(pivot) | ||
| end | ||
|
|
||
| function SciMLBase.solve(cache::LinearCache, alg::SimpleLUFactorization; kwargs...) | ||
| if cache.isfresh | ||
| cache.cacheval.A = cache.A | ||
| simplelu_factorize!(cache.cacheval, alg.pivot) | ||
| end | ||
| cache.cacheval.b = cache.b | ||
| cache.cacheval.x = cache.u | ||
| y = simplelu_solve!(cache.cacheval) | ||
| SciMLBase.build_linear_solution(alg,y,nothing,cache) | ||
| end | ||
|
|
||
| init_cacheval(alg::SimpleLUFactorization, A, b, u, Pl, Pr, maxiters, abstol, reltol, verbose) = LUSolver(convert(AbstractMatrix,A)) |