Commit 55c6089d by Sébastien Villemot

Reference manual: update solve_algo and stack_solve_algo options with new values

parent 39718c86
 ... ... @@ -1783,12 +1783,15 @@ periods 100; = INTEGER Determines the non-linear solver to use. Possible values for the option are: 0: uses MATLAB Optimization Toolbox FSOLVE 0: uses MATLAB Optimization Toolbox FSOLVE (not available under Octave) 1: uses Dynare's own nonlinear equation solver 2: splits the model into recursive blocks and solves each block in turn 3: Chris Sims' solver 4: similar to value 2, except that it deals differently with nearly singular Jacobian 5: Newton algorithm with a sparse Gaussian elimination (SPE) 5: Newton algorithm with a sparse Gaussian elimination (SPE) (requires option) 6: Newton algorithm with a sparse LU solver at each iteration (requires and/or option) 7: Newton algorithm with a Generalized Minimal Residual (GMRES) solver at each iteration (requires and/or option; not available under Octave)) 8: Newton algorithm with a Stabilized Bi-Conjugate Gradient (BICGSTAB) solver at each iteration (requires and/or option) Default value is 2. ... ... @@ -2096,12 +2099,12 @@ steady; = INTEGER Algorithm used for computing the solution. Possible values are: 0: Newton method to solve simultaneously all the equations for every period, see . (Default) 1: use a Newton algorithm with a sparse LU solver at each iteration. 2: use a Newton algorithm with a Generalized Minimal Residual (GMRES) solver at each iteration. This option is not available under Octave. 3: use a Newton algorithm with a Stabilized Bi-Conjugate Gradient (BICGSTAB) solver at each iteration. 4: use a Newton algorithm with a optimal path length at each iteration. 5: use a Newton algorithm with a sparse Gaussian elimination (SPE) solver at each iteration. 0: Newton method to solve simultaneously all the equations for every period, see (Default) 1: use a Newton algorithm with a sparse LU solver at each iteration (requires and/or option) 2: use a Newton algorithm with a Generalized Minimal Residual (GMRES) solver at each iteration (requires and/or option; not available under Octave) 3: use a Newton algorithm with a Stabilized Bi-Conjugate Gradient (BICGSTAB) solver at each iteration (requires and/or option) 4: use a Newton algorithm with a optimal path length at each iteration (requires and/or option) 5: use a Newton algorithm with a sparse Gaussian elimination (SPE) solver at each iteration (requires option) ... ...
Supports Markdown
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!