aboutsummaryrefslogtreecommitdiff
path: root/aberth
diff options
context:
space:
mode:
Diffstat (limited to 'aberth')
-rw-r--r--aberth/aberth_kernel.fut2
-rw-r--r--aberth/host_aberth.cpp2
2 files changed, 2 insertions, 2 deletions
diff --git a/aberth/aberth_kernel.fut b/aberth/aberth_kernel.fut
index 79d7cfa..fd4d943 100644
--- a/aberth/aberth_kernel.fut
+++ b/aberth/aberth_kernel.fut
@@ -64,7 +64,7 @@ module aberth = {
let radius = max_root_norm p
in {p, deriv, bound, radius}
- -- Lagrange-style step where the new elements are computed in parallel from
+ -- Jacobi-style step where the new elements are computed in parallel from
-- the previous values
let step (ctx: context) (approx: *approx): *(bool, approx) =
let pvals = map (eval_c ctx.p) approx
diff --git a/aberth/host_aberth.cpp b/aberth/host_aberth.cpp
index c567f30..fcffebf 100644
--- a/aberth/host_aberth.cpp
+++ b/aberth/host_aberth.cpp
@@ -42,7 +42,7 @@ void AberthState::regenerate() {
}
}
-// Lagrange-style step where the new elements are computed in parallel from the previous values
+// Jacobi-style step where the new elements are computed in parallel from the previous values
bool AberthState::step() {
array<Com, N * N> pairs;
for (int i = 0; i < N - 1; i++) {