diff options
Diffstat (limited to 'src/lib/netlist/solver')
| -rw-r--r-- | src/lib/netlist/solver/nld_matrix_solver.h | 2 | ||||
| -rw-r--r-- | src/lib/netlist/solver/nld_ms_sm.h | 4 | ||||
| -rw-r--r-- | src/lib/netlist/solver/nld_ms_w.h | 2 |
3 files changed, 4 insertions, 4 deletions
diff --git a/src/lib/netlist/solver/nld_matrix_solver.h b/src/lib/netlist/solver/nld_matrix_solver.h index ab6364cb2d3..93d01c962f2 100644 --- a/src/lib/netlist/solver/nld_matrix_solver.h +++ b/src/lib/netlist/solver/nld_matrix_solver.h @@ -87,7 +87,7 @@ public: matrix_solver_t(netlist_t &anetlist, const pstring &name, const eSortType sort, const solver_parameters_t *params) : device_t(anetlist, name), - m_stat_calculations(0), + m_stat_calculations(0), m_stat_newton_raphson(0), m_stat_vsolver_calls(0), m_iterative_fail(0), diff --git a/src/lib/netlist/solver/nld_ms_sm.h b/src/lib/netlist/solver/nld_ms_sm.h index 1a3c50b4a27..c5d0e1105b6 100644 --- a/src/lib/netlist/solver/nld_ms_sm.h +++ b/src/lib/netlist/solver/nld_ms_sm.h @@ -13,9 +13,9 @@ * In this specific implementation, u is a unit vector specifying the row which * changed. Thus v contains the changed column. * - * Than z = A⁻¹ u , w = transpose(A⁻¹) v , lambda = v z + * Than z = A^-1 u , w = transpose(A^-1) v , lambda = v z * - * A⁻¹ <- 1.0 / (1.0 + lambda) * (z x w) + * A^-1 <- 1.0 / (1.0 + lambda) * (z x w) * * The approach is iterative and applied for each row changed. * diff --git a/src/lib/netlist/solver/nld_ms_w.h b/src/lib/netlist/solver/nld_ms_w.h index f61c2b1b616..e976fcf3184 100644 --- a/src/lib/netlist/solver/nld_ms_w.h +++ b/src/lib/netlist/solver/nld_ms_w.h @@ -15,7 +15,7 @@ * Whilst the book proposes to invert the matrix R=(I+transpose(V)*Z) we define * * w = transpose(V)*y - * a = R⁻¹ * w + * a = R^-1 * w * * and consequently * |
