-
-
Notifications
You must be signed in to change notification settings - Fork 44
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
e805a6a
commit 46fade1
Showing
2 changed files
with
125 additions
and
0 deletions.
There are no files selected for viewing
122 changes: 122 additions & 0 deletions
122
lib/NonlinearSolveHomotopyContinuation/test/allroots.jl
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,122 @@ | ||
using NonlinearSolve | ||
using NonlinearSolveHomotopyContinuation | ||
using SciMLBase: NonlinearSolution | ||
|
||
alg = HomotopyContinuationJL{true}(; threading = false) | ||
|
||
@testset "scalar u" begin | ||
@testset "`NonlinearProblem`" begin | ||
prob = NonlinearProblem(1.0, 2.0) do u, p | ||
return u * u - 2p * u + p * p | ||
end | ||
sol = solve(prob, alg) | ||
|
||
@test sol isa EnsembleSolution | ||
@test length(sol) == 1 | ||
@test sol.u[1] isa NonlinearSolution | ||
@test sol.u[1][1] ≈ 2.0 | ||
|
||
@testset "no real solutions" begin | ||
prob = NonlinearProblem(1.0, 1.0) do u, p | ||
return u * u - p + p | ||
end | ||
sol = solve(prob, alg) | ||
@test length(sol) == 1 | ||
@test sol.u[1].retcode == SciMLBase.ReturnCode.ConvergenceFailure | ||
@test !sol.converged | ||
end | ||
end | ||
|
||
@testset "`HomotopyContinuationFunction`" begin | ||
denominator = function (u, p) | ||
return [u - 0.7] | ||
end | ||
polynomialize = function (u, p) | ||
return sin(u) | ||
end | ||
unpolynomialize = function (u, p) | ||
return [asin(u)] | ||
end | ||
fn = HomotopyNonlinearFunction(; denominator, polynomialize, unpolynomialize) do u, p | ||
return (u - p[1]) * (u - p[2]) | ||
end | ||
prob = NonlinearProblem(fn, 0.0, [0.5, 0.7]) | ||
|
||
sol = solve(prob, alg) | ||
@test length(sol) == 1 | ||
@test sin(sol.u[1][1]) ≈ 0.5 | ||
|
||
@testset "no valid solutions" begin | ||
prob2 = remake(prob; p = [0.7, 0.7]) | ||
sol2 = solve(prob2, alg) | ||
@test !sol2.converged | ||
@test length(sol2) == 1 | ||
@test sol2.u[1].retcode == SciMLBase.ReturnCode.Infeasible | ||
end | ||
|
||
@testset "multiple solutions" begin | ||
prob3 = remake(prob; p = [0.5, 0.6]) | ||
sol3 = solve(prob3, alg) | ||
@test length(sol3) == 2 | ||
@test sort(sin.([sol3.u[1][1], sol3.u[2][1]])) ≈ [0.5, 0.6] | ||
end | ||
end | ||
end | ||
|
||
function f!(du, u, p) | ||
du[1] = u[1] * u[1] - p[1] * u[2] + u[2] ^ 3 + 1 | ||
du[2] = u[2] ^ 3 + 2 * p[2] * u[1] * u[2] + u[2] | ||
end | ||
|
||
function f(u, p) | ||
[u[1] * u[1] - p[1] * u[2] + u[2] ^ 3 + 1, u[2] ^ 3 + 2 * p[2] * u[1] * u[2] + u[2]] | ||
end | ||
|
||
@testset "vector u - $iip" for (rhs, iip) in [(f, "oop"), (f!, "iip")] | ||
@testset "`NonlinearProblem`" begin | ||
prob = NonlinearProblem(rhs, [1.0, 2.0], [2.0, 3.0]) | ||
sol = solve(prob, alg) | ||
@test sol isa EnsembleSolution | ||
@test sol.converged | ||
for nlsol in sol.u | ||
@test SciMLBase.successful_retcode(nlsol) | ||
@test f(nlsol.u, prob.p) ≈ [0.0, 0.0] atol = 1e-10 | ||
end | ||
|
||
@testset "no real solutions" begin | ||
_prob = remake(prob; p = zeros(2)) | ||
_sol = solve(_prob, alg) | ||
@test !_sol.converged | ||
@test length(_sol) == 1 | ||
@test !SciMLBase.successful_retcode(_sol.u[1]) | ||
end | ||
end | ||
|
||
@testset "`HomotopyNonlinearFunction`" begin | ||
denominator = function (u, p) | ||
return [u[1] - p[3], u[2] - p[4]] | ||
end | ||
unpolynomialize = function (u, p) | ||
return [[cbrt(u[1]), sin(u[2] / 40)]] | ||
end | ||
polynomialize = function (u, p) | ||
return [u[1] ^ 3, 40asin(u[2])] | ||
end | ||
fn = HomotopyNonlinearFunction(rhs; denominator, polynomialize, unpolynomialize) | ||
prob = NonlinearProblem(fn, [1.0, 2.0], [2.0, 3.0, 4.0, 5.0]) | ||
sol2 = solve(prob, alg) | ||
@test sol2 isa EnsembleSolution | ||
@test sol2.converged | ||
@test length(sol.u) == length(sol2.u) | ||
display(sol.u) | ||
for nlsol2 in sol2.u | ||
@test any(nlsol -> isapprox(polynomialize(nlsol2.u, prob.p), nlsol.u; rtol = 1e-8), sol.u) | ||
end | ||
|
||
@testset "some invalid solutions" begin | ||
prob3 = remake(prob; p = [2.0, 3.0, polynomialize(sol2.u[1].u, prob.p)...]) | ||
sol3 = solve(prob3, alg) | ||
@test length(sol3.u) == length(sol2.u) - 1 | ||
end | ||
end | ||
end |
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