From 63f9a01f8c5d43b9cfe68c2d401a84647d19c10e Mon Sep 17 00:00:00 2001 From: Miodrag Milanovic Date: Wed, 29 Jun 2016 08:34:30 +0200 Subject: Cleanup and version bump --- src/lib/netlist/solver/nld_ms_sm.h | 4 ++-- src/lib/netlist/solver/nld_ms_w.h | 2 +- 2 files changed, 3 insertions(+), 3 deletions(-) (limited to 'src/lib/netlist/solver') diff --git a/src/lib/netlist/solver/nld_ms_sm.h b/src/lib/netlist/solver/nld_ms_sm.h index 9fa71810be7..8fae5243b42 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 f59086c0c83..986eabc16c5 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 * -- cgit v1.2.3