Krylov-Newton algorithm
BifurcationKit
is built upon the newton algorithm for solving (large-dimensional) nonlinear equations
\[F(x)=0\in\mathbb R^n,\quad x\in\mathbb R^n.\]
Writing $J(x)\in\mathcal L(\mathbb R^n)$ the jacobian, the algorithm reads
\[x_{n+1} = x_n - J(x_n)^{-1}F(x_n)\]
with initial guess $x_0$.
The crux of the algorithm is to solve the linear system in $y$:
\[J(x_n)\cdot y = F(x_n).\]
To this end, we never form $J^{-1}$ like with pinv(J)
but solve the linear system directly.
Space of solutions
For the algorithm to be defined, a certain number of operations on x
need to be available. If you pass x::AbstractArray
, you should not have any problem. Otherwise, your x
must comply with the requirements listed in Requested methods for Custom State.
Different Jacobians
There are basically two ways to specify the jacobian:
- Matrix based
- Matrix-free.
In case you pass a matrix (in effect an AbstractMatrix
like a sparse one,...), you can use the default linear solver from LinearAlgebra
termed the backslash operator \
. This is a direct method. This is the case 1 above.
Another possibility is to pass a function J(dx)
and to use iterative linear solvers. In this case, this is termed a Krylov-Newton method. This is the case 2 above. In comparison to the Matrix-based case, there is no restriction to the number of unknowns $n$.
The available linear solvers are explained in the section Linear solvers (LS).
One can find a full description of the Krylov-Newton method in the API.
Simple example
Here is a quick example to show how the basics work. In particular, the problem generates a matrix based jacobian using automatic differentiation.
using BifurcationKit
F(x, p) = x.^3 .- 1
x0 = rand(10)
prob = BifurcationProblem(F, x0, nothing)
sol = BifurcationKit.solve(prob, Newton(), NewtonPar(verbose = true))
NonLinearSolution{Vector{Float64}, BifurcationProblem{BifFunction{typeof(Main.F), BifurcationKit.var"#104#122"{typeof(Main.F)}, BifurcationKit.var"#108#126", Nothing, BifurcationKit.var"#105#123", Nothing, BifurcationKit.var"#107#125"{BifurcationKit.var"#105#123"}, BifurcationKit.var"#111#130"{BifurcationKit.var"#d1Fad#128"}, BifurcationKit.var"#113#132", BifurcationKit.var"#115#134", BifurcationKit.var"#117#136", Bool, Float64, BifurcationKit.Jet{Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing, Nothing}}, Vector{Float64}, Nothing, typeof(identity), typeof(BifurcationKit.plot_default), typeof(BifurcationKit.record_sol_default), typeof(BifurcationKit.save_solution_default)}, Vector{Float64}, Int64}([1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0, 1.0000000000000515, 1.0], ┌─ Bifurcation Problem with uType Vector{Float64}
├─ Inplace: false
├─ Symmetric: false
└─ Parameter: p, [2.7447602904902824, 50432.190494400624, 14942.558032075862, 4427.11147671701, 1311.4238893711113, 388.2580235495061, 114.72984336893731, 33.69151711748539, 9.69721972389905, 2.6206311761086014, 0.5794532218187302, 0.0679546149505945, 0.0014311407265595467, 6.816373330220671e-7, 1.545430450278218e-13], true, 14, 14)
Example
The (basic) tutorial Temperature model presents all cases (direct and iterative ones).