.sfcr_newton

Newton-Raphson solver implemented with <code>rootSolve::multiroot()</code>

internal

Routines to write, simulate, and validate stock-flow consistent (SFC) models. The accounting structure of SFC models are described in Godley and Lavoie (2007, ISBN:978-1-137-08599-3). The algorithms implemented to solve the models (Gauss-Seidel and Broyden) are described in Kinsella and O'Shea (2010) <doi:10.2139/ssrn.1729205> and Peressini and Sullivan (1988, ISBN:0-387-96614-5).

Joao Macalos

sfcr

Simulate Stock-Flow Consistent Models

.sfcr_newton function

<dl><dt>m</dt>
<dd>The initialized matrix obtained with <code>.make_matrix()</code>.</dd>
<dt>equations</dt>
<dd>Prepared equations with <code>.prep_equations()</code>.</dd>
<dt>periods</dt>
<dd>Total number of rows (periods) in the model.</dd>
<dt>max_ite</dt>
<dd>Maximum number of iterations allowed per block per period.</dd>
<dt>tol</dt>
<dd>Tolerance accepted to determine convergence.</dd>
<dt>...</dt>
<dd>Extra parameters to pass to <code>rootSolve::multiroot()</code>.</dd></dl>

Arguments

Author

Newton-Raphson solver implemented with rootSolve::multiroot() — .sfcr_newton

<dl>

<dt>m</dt>
<dd>The initialized matrix obtained with <code>.make_matrix()</code>.</dd>


<dt>equations</dt>
<dd>Prepared equations with <code>.prep_equations()</code>.</dd>


<dt>periods</dt>
<dd>Total number of rows (periods) in the model.</dd>


<dt>max_ite</dt>
<dd>Maximum number of iterations allowed per block per period.</dd>


<dt>tol</dt>
<dd>Tolerance accepted to determine convergence.</dd>


<dt>...</dt>
<dd>Extra parameters to pass to <code>rootSolve::multiroot()</code>.</dd>

</dl>

.sfcr_newton: Newton-Raphson solver implemented with `rootSolve::multiroot()`

Description

Usage

Arguments

Author

Details