freealg 0.7.17__py3-none-any.whl → 0.7.18__py3-none-any.whl

freealg/_algebraic_form/_decompress_new_2.py

@@ -64,14 +64,14 @@ def build_time_grid(sizes, n0, min_n_times=0):
 # eval P partials
 # ===============
 
-def eval_P_partials(z, m, a_coeffs):
+def eval_P_partials(z, m, coeffs):
     """
     Evaluate P(z,m) and its partial derivatives dP/dz and dP/dm.
 
-    This assumes P is represented by `a_coeffs` in the monomial basis
+    This assumes P is represented by `coeffs` in the monomial basis
 
         P(z, m) = sum_{j=0..s} a_j(z) * m^j,
-        a_j(z) = sum_{i=0..deg_z} a_coeffs[i, j] * z^i.
+        a_j(z) = sum_{i=0..deg_z} coeffs[i, j] * z^i.
 
     The function returns P, dP/dz, dP/dm with broadcasting over z and m.
 
@@ -81,7 +81,7 @@ def eval_P_partials(z, m, a_coeffs):
         First argument to P.
     m : complex or array_like of complex
         Second argument to P. Must be broadcast-compatible with `z`.
-    a_coeffs : ndarray, shape (deg_z+1, s+1)
+    coeffs : ndarray, shape (deg_z+1, s+1)
         Coefficient matrix for P in the monomial basis.
 
     Returns
@@ -103,14 +103,14 @@ def eval_P_partials(z, m, a_coeffs):
     --------
     .. code-block:: python
 
-        P, Pz, Pm = eval_P_partials(1.0 + 1j, 0.2 + 0.3j, a_coeffs)
+        P, Pz, Pm = eval_P_partials(1.0 + 1j, 0.2 + 0.3j, coeffs)
     """
 
     z = numpy.asarray(z, dtype=complex)
     m = numpy.asarray(m, dtype=complex)
 
-    deg_z = int(a_coeffs.shape[0] - 1)
-    s = int(a_coeffs.shape[1] - 1)
+    deg_z = int(coeffs.shape[0] - 1)
+    s = int(coeffs.shape[1] - 1)
 
     if (z.ndim == 0) and (m.ndim == 0):
         zz = complex(z)
@@ -120,7 +120,7 @@ def eval_P_partials(z, m, a_coeffs):
         ap = numpy.empty(s + 1, dtype=complex)
 
         for j in range(s + 1):
-            c = a_coeffs[:, j]
+            c = coeffs[:, j]
 
             val = 0.0 + 0.0j
             for i in range(deg_z, -1, -1):
@@ -160,10 +160,10 @@ def eval_P_partials(z, m, a_coeffs):
     Pm = numpy.zeros(zz.size, dtype=complex)
 
     for j in range(s + 1):
-        aj = zp @ a_coeffs[:, j]
+        aj = zp @ coeffs[:, j]
         P += aj * mp[:, j]
 
-        ajp = dzp @ a_coeffs[:, j]
+        ajp = dzp @ coeffs[:, j]
         Pz += ajp * mp[:, j]
 
         if j >= 1:
@@ -176,7 +176,7 @@ def eval_P_partials(z, m, a_coeffs):
 # fd solve w
 # ==========
 
-# def fd_solve_w(z, t, a_coeffs, w_init, max_iter=50, tol=1e-12,
+# def fd_solve_w(z, t, coeffs, w_init, max_iter=50, tol=1e-12,
 #                armijo=1e-4, min_lam=1e-6, w_min=1e-14):
 #     """
 #     Solve for w = m(t,z) from the implicit FD equation using damped Newton.
@@ -197,7 +197,7 @@ def eval_P_partials(z, m, a_coeffs):
 #         Query point in the complex plane.
 #     t : float
 #         Time parameter (tau = exp(t)).
-#     a_coeffs : ndarray
+#     coeffs : ndarray
 #         Coefficients defining P(zeta,y) in the monomial basis.
 #     w_init : complex
 #         Initial guess for w.
@@ -231,7 +231,7 @@ def eval_P_partials(z, m, a_coeffs):
 #     .. code-block:: python
 #
 #         w, ok = fd_solve_w(
-#             z=0.5 + 1e-6j, t=2.0, a_coeffs=a_coeffs, w_init=m1_fn(0.5 + 1e-6j),
+#             z=0.5 + 1e-6j, t=2.0, coeffs=coeffs, w_init=m1_fn(0.5 + 1e-6j),
 #             max_iter=50, tol=1e-12
 #         )
 #     """
@@ -255,7 +255,7 @@ def eval_P_partials(z, m, a_coeffs):
 #         zeta = z + alpha / w
 #         y = tau * w
 #
-#         F, Pz, Py = eval_P_partials(zeta, y, a_coeffs)
+#         F, Pz, Py = eval_P_partials(zeta, y, coeffs)
 #         F = complex(F)
 #         Pz = complex(Pz)
 #         Py = complex(Py)
@@ -285,7 +285,7 @@ def eval_P_partials(z, m, a_coeffs):
 #             zeta_new = z + alpha / w_new
 #             y_new = tau * w_new
 #
-#             F_new = eval_P_partials(zeta_new, y_new, a_coeffs)[0]
+#             F_new = eval_P_partials(zeta_new, y_new, coeffs)[0]
 #             F_new = complex(F_new)
 #
 #             if abs(F_new) <= (1.0 - armijo * lam) * F_abs:
@@ -298,10 +298,10 @@ def eval_P_partials(z, m, a_coeffs):
 #         if not ok:
 #             return w, False
 #
-#     F_end = eval_P_partials(z + alpha / w, tau * w, a_coeffs)[0]
+#     F_end = eval_P_partials(z + alpha / w, tau * w, coeffs)[0]
 #     return w, (abs(F_end) <= 10.0 * tol)
 
-# def fd_solve_w(z, t, a_coeffs, w_init, max_iter=50, tol=1e-12,
+# def fd_solve_w(z, t, coeffs, w_init, max_iter=50, tol=1e-12,
 #                armijo=1e-4, min_lam=1e-6, w_min=1e-14):
 #     """
 #     Solve for w = m(t,z) from the implicit FD equation using damped Newton.
@@ -322,7 +322,7 @@ def eval_P_partials(z, m, a_coeffs):
 #         Query point in the complex plane.
 #     t : float
 #         Time parameter (tau = exp(t)).
-#     a_coeffs : ndarray
+#     coeffs : ndarray
 #         Coefficients defining P(zeta,y) in the monomial basis.
 #     w_init : complex
 #         Initial guess for w.
@@ -356,7 +356,7 @@ def eval_P_partials(z, m, a_coeffs):
 #     .. code-block:: python
 #
 #         w, ok = fd_solve_w(
-#             z=0.5 + 1e-6j, t=2.0, a_coeffs=a_coeffs, w_init=m1_fn(0.5 + 1e-6j),
+#             z=0.5 + 1e-6j, t=2.0, coeffs=coeffs, w_init=m1_fn(0.5 + 1e-6j),
 #             max_iter=50, tol=1e-12
 #         )
 #     """
@@ -383,7 +383,7 @@ def eval_P_partials(z, m, a_coeffs):
 #         # zeta = z + alpha / w
 #         # y = tau * w
 #         #
-#         # F, Pz, Py = eval_P_partials(zeta, y, a_coeffs)
+#         # F, Pz, Py = eval_P_partials(zeta, y, coeffs)
 #         # F = complex(F)
 #         # Pz = complex(Pz)
 #         # Py = complex(Py)
@@ -413,7 +413,7 @@ def eval_P_partials(z, m, a_coeffs):
 #         #     zeta_new = z + alpha / w_new
 #         #     y_new = tau * w_new
 #         #
-#         #     F_new = eval_P_partials(zeta_new, y_new, a_coeffs)[0]
+#         #     F_new = eval_P_partials(zeta_new, y_new, coeffs)[0]
 #         #     F_new = complex(F_new)
 #         #
 #         #     if abs(F_new) <= (1.0 - armijo * lam) * F_abs:
@@ -439,7 +439,7 @@ def eval_P_partials(z, m, a_coeffs):
 #         #     P(z + beta/y, y) = 0,  beta = tau - 1.
 #         # Multiply by y^deg_z to clear denominators and get a polynomial in y.
 #
-#         a = numpy.asarray(a_coeffs, dtype=numpy.complex128)
+#         a = numpy.asarray(coeffs, dtype=numpy.complex128)
 #         deg_z = a.shape[0] - 1
 #         deg_m = a.shape[1] - 1
 #
@@ -502,16 +502,16 @@ def eval_P_partials(z, m, a_coeffs):
 #         w = complex(best)
 #
 #         # final residual check
-#         F_end = eval_P_partials(z + alpha / w, tau * w, a_coeffs)[0]
+#         F_end = eval_P_partials(z + alpha / w, tau * w, coeffs)[0]
 #         return w, (abs(F_end) <= 1e3 * tol)
 #
 #     # -------------------
 #
 #
-#     F_end = eval_P_partials(z + alpha / w, tau * w, a_coeffs)[0]
+#     F_end = eval_P_partials(z + alpha / w, tau * w, coeffs)[0]
 #     return w, (abs(F_end) <= 10.0 * tol)
 
-def fd_solve_w(z, t, a_coeffs, w_init, max_iter=50, tol=1e-12,
+def fd_solve_w(z, t, coeffs, w_init, max_iter=50, tol=1e-12,
                armijo=1e-4, min_lam=1e-6, w_min=1e-14):
     """
     Damped Newton solve for w from F_t(z,w)=P(z+alpha/w, tau*w)=0.
@@ -547,7 +547,7 @@ def fd_solve_w(z, t, a_coeffs, w_init, max_iter=50, tol=1e-12,
         zeta = z + alpha / w
         y = tau * w
 
-        F, Pz, Py = eval_P_partials(zeta, y, a_coeffs)
+        F, Pz, Py = eval_P_partials(zeta, y, coeffs)
         F = complex(F)
         Pz = complex(Pz)
         Py = complex(Py)
@@ -579,7 +579,7 @@ def fd_solve_w(z, t, a_coeffs, w_init, max_iter=50, tol=1e-12,
                 lam *= 0.5
                 continue
 
-            F_new = eval_P_partials(z + alpha / w_new, tau * w_new, a_coeffs)[0]
+            F_new = eval_P_partials(z + alpha / w_new, tau * w_new, coeffs)[0]
             F_new = complex(F_new)
 
             # Armijo-like sufficient decrease on residual norm
@@ -594,7 +594,7 @@ def fd_solve_w(z, t, a_coeffs, w_init, max_iter=50, tol=1e-12,
             return w, False
 
     # if max_iter hit, accept only if residual is reasonably small
-    F_end = eval_P_partials(z + alpha / w, tau * w, a_coeffs)[0]
+    F_end = eval_P_partials(z + alpha / w, tau * w, coeffs)[0]
     F_end = complex(F_end)
     return w, (abs(F_end) <= 10.0 * tol)
 
@@ -604,7 +604,7 @@ def fd_solve_w(z, t, a_coeffs, w_init, max_iter=50, tol=1e-12,
 # NEW FUNCTION
 # ============
 
-def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
+def fd_candidates_w(z, t, coeffs, w_min=1e-14):
     """
     Return candidate roots w solving P(z + alpha/w, tau*w)=0 with Im(w)>0 (if Im(z)>0).
     """
@@ -613,7 +613,7 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
     alpha = 1.0 - 1.0 / tau
     want_pos_imag = (z.imag > 0.0)
 
-    a = numpy.asarray(a_coeffs, dtype=numpy.complex128)
+    a = numpy.asarray(coeffs, dtype=numpy.complex128)
     deg_z = a.shape[0] - 1
     deg_m = a.shape[1] - 1
 
@@ -651,7 +651,7 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
         # residual filter (optional but helps)
         # -------------
         # TEST
-        # F = eval_P_partials(z + alpha / w, tau * w, a_coeffs)[0]
+        # F = eval_P_partials(z + alpha / w, tau * w, coeffs)[0]
         # if abs(F) < 1e-6:
         #     cands.append(complex(w))
         # ---------------
@@ -666,7 +666,7 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
 # decompress newton old
 # =====================
 
-# def decompress_newton_old(z_list, t_grid, a_coeffs, w0_list=None,
+# def decompress_newton_old(z_list, t_grid, coeffs, w0_list=None,
 #                           dt_max=0.1, sweep=True, time_rel_tol=5.0,
 #                           max_iter=50, tol=1e-12, armijo=1e-4,
 #                           min_lam=1e-6, w_min=1e-14):
@@ -679,7 +679,7 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
 #         Query points z (typically x + 1j*eta with eta > 0).
 #     t_grid : array_like of float
 #         Strictly increasing time grid.
-#     a_coeffs : ndarray
+#     coeffs : ndarray
 #         Coefficients defining P(zeta,y) in the monomial basis used by eval_P.
 #     w0_list : array_like of complex
 #         Initial values at t_grid[0] (typically m0(z_list) on the physical
@@ -731,7 +731,7 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
 #
 #         t_grid = numpy.linspace(0.0, 4.0, 2)
 #         W, ok = fd_evolve_on_grid(
-#             z_query, t_grid, a_coeffs, w0_list=w0_list,
+#             z_query, t_grid, coeffs, w0_list=w0_list,
 #             dt_max=0.1, sweep=True, time_rel_tol=5.0,
 #             max_iter=50, tol=1e-12, armijo=1e-4, min_lam=1e-6, w_min=1e-14
 #         )
@@ -780,7 +780,7 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
 #                 # Independent solves: each point uses previous-time seed only.
 #                 for iz in range(nz):
 #                     w, success = fd_solve_w(
-#                         z_list[iz], t, a_coeffs, w_prev[iz],
+#                         z_list[iz], t, coeffs, w_prev[iz],
 #                         max_iter=max_iter, tol=tol, armijo=armijo,
 #                         min_lam=min_lam, w_min=w_min
 #                     )
@@ -794,7 +794,7 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
 #             i0 = int(numpy.argmax(numpy.abs(numpy.imag(w_prev))))
 #
 #             w0, ok0 = fd_solve_w(
-#                 z_list[i0], t, a_coeffs, w_prev[i0],
+#                 z_list[i0], t, coeffs, w_prev[i0],
 #                 max_iter=max_iter, tol=tol, armijo=armijo,
 #                 min_lam=min_lam, w_min=w_min
 #             )
@@ -808,14 +808,14 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
 #             def solve_with_choice(iz, w_neighbor):
 #                 # First try neighbor-seeded Newton (spatial continuity).
 #                 w_a, ok_a = fd_solve_w(
-#                     z_list[iz], t, a_coeffs, w_neighbor,
+#                     z_list[iz], t, coeffs, w_neighbor,
 #                     max_iter=max_iter, tol=tol, armijo=armijo,
 #                     min_lam=min_lam, w_min=w_min
 #                 )
 #
 #                 # Always keep a time-consistent fallback candidate.
 #                 w_b, ok_b = fd_solve_w(
-#                     z_list[iz], t, a_coeffs, w_prev[iz],
+#                     z_list[iz], t, coeffs, w_prev[iz],
 #                     max_iter=max_iter, tol=tol, armijo=armijo,
 #                     min_lam=min_lam, w_min=w_min
 #                 )
@@ -865,7 +865,7 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
 # decompress newton
 # =================
 
-# def decompress_newton(z_list, t_grid, a_coeffs, w0_list=None,
+# def decompress_newton(z_list, t_grid, coeffs, w0_list=None,
 #                       dt_max=0.1, sweep=True, time_rel_tol=5.0,
 #                       active_imag_eps=None, sweep_pad=20,
 #                       max_iter=50, tol=1e-12, armijo=1e-4,
@@ -879,7 +879,7 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
 #         Query points z (typically x + 1j*eta with eta > 0), ordered along x.
 #     t_grid : array_like of float
 #         Strictly increasing time grid.
-#     a_coeffs : ndarray
+#     coeffs : ndarray
 #         Coefficients defining P(zeta,y) in the monomial basis.
 #     w0_list : array_like of complex
 #         Initial values at t_grid[0] (typically m0(z_list) on the physical
@@ -945,14 +945,14 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
 #     # def solve_with_choice(iz, w_seed):
 #     #     # Neighbor-seeded candidate (spatial continuity)
 #     #     w_a, ok_a = fd_solve_w(
-#     #         z_list[iz], t, a_coeffs, w_seed,
+#     #         z_list[iz], t, coeffs, w_seed,
 #     #         max_iter=max_iter, tol=tol, armijo=armijo,
 #     #         min_lam=min_lam, w_min=w_min
 #     #     )
 #     #
 #     #     # Time-seeded candidate (time continuation)
 #     #     w_b, ok_b = fd_solve_w(
-#     #         z_list[iz], t, a_coeffs, w_prev[iz],
+#     #         z_list[iz], t, coeffs, w_prev[iz],
 #     #         max_iter=max_iter, tol=tol, armijo=armijo,
 #     #         min_lam=min_lam, w_min=w_min
 #     #     )
@@ -981,7 +981,7 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
 #     # TEST
 #     # def solve_with_choice(iz, w_seed):
 #     #     # candidate roots at this (t,z)
-#     #     cands = fd_candidates_w(z_list[iz], t, a_coeffs, w_min=w_min)
+#     #     cands = fd_candidates_w(z_list[iz], t, coeffs, w_min=w_min)
 #     #
 #     #     # ---------------------
 #     #     # TEST
@@ -996,7 +996,7 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
 #     #     if len(cands) == 0:
 #     #         # fallback to your existing single-root solver
 #     #         w, success = fd_solve_w(
-#     #             z_list[iz], t, a_coeffs, w_prev[iz],
+#     #             z_list[iz], t, coeffs, w_prev[iz],
 #     #             max_iter=max_iter, tol=tol, armijo=armijo,
 #     #             min_lam=min_lam, w_min=w_min
 #     #         )
@@ -1026,14 +1026,14 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
 #     def solve_with_choice(iz, w_neighbor):
 #         # Neighbor-seeded Newton (spatial continuity).
 #         w_a, ok_a = fd_solve_w(
-#             z_list[iz], t, a_coeffs, w_neighbor,
+#             z_list[iz], t, coeffs, w_neighbor,
 #             max_iter=max_iter, tol=tol, armijo=armijo,
 #             min_lam=min_lam, w_min=w_min
 #         )
 #
 #         # Time-seeded Newton (time continuity).
 #         w_b, ok_b = fd_solve_w(
-#             z_list[iz], t, a_coeffs, w_prev[iz],
+#             z_list[iz], t, coeffs, w_prev[iz],
 #             max_iter=max_iter, tol=tol, armijo=armijo,
 #             min_lam=min_lam, w_min=w_min
 #         )
@@ -1092,7 +1092,7 @@ def fd_candidates_w(z, t, a_coeffs, w_min=1e-14):
 #                 # problems.
 #                 for iz in range(nz):
 #                     w, success = fd_solve_w(
-#                         z_list[iz], t, a_coeffs, w_prev[iz],
+#                         z_list[iz], t, coeffs, w_prev[iz],
 #                         max_iter=max_iter, tol=tol, armijo=armijo,
 #                         min_lam=min_lam, w_min=w_min
 #                     )
@@ -1286,7 +1286,7 @@ def eval_row_by_z_homotopy(
     z_targets,
     w_seed_targets,
     R,
-    a_coeffs,
+    coeffs,
     w_anchor,
     *,
     steps=80,
@@ -1353,13 +1353,13 @@ def eval_row_by_z_homotopy(
             z = z0 + s * (zA - z0)
 
             w_new, ok_new = fd_solve_w(
-                z, t, a_coeffs, w,
+                z, t, coeffs, w,
                 max_iter=max_iter, tol=tol, armijo=armijo,
                 min_lam=min_lam, w_min=w_min
             )
 
             if not ok_new:
-                cands = fd_candidates_w(z, t, a_coeffs, w_min=w_min)
+                cands = fd_candidates_w(z, t, coeffs, w_min=w_min)
                 if cands:
                     w_new = _pick(cands, z, w)
                     ok_new = (w_new is not None)
@@ -1376,13 +1376,13 @@ def eval_row_by_z_homotopy(
                 z = zA + s * (zB - zA)
 
                 w_new, ok_new = fd_solve_w(
-                    z, t, a_coeffs, w,
+                    z, t, coeffs, w,
                     max_iter=max_iter, tol=tol, armijo=armijo,
                     min_lam=min_lam, w_min=w_min
                 )
 
                 if not ok_new:
-                    cands = fd_candidates_w(z, t, a_coeffs, w_min=w_min)
+                    cands = fd_candidates_w(z, t, coeffs, w_min=w_min)
                     if cands:
                         w_new = _pick(cands, z, w)
                         ok_new = (w_new is not None)
@@ -1396,7 +1396,7 @@ def eval_row_by_z_homotopy(
 
         if not ok:
             # fallback at zT: prefer continuity to the provided per-z time seed
-            cands = fd_candidates_w(zT, t, a_coeffs, w_min=w_min)
+            cands = fd_candidates_w(zT, t, coeffs, w_min=w_min)
             if cands:
                 w_out[k] = _pick(cands, zT, w_seed_targets[k])
                 ok_out[k] = (w_out[k] is not None)
@@ -1412,7 +1412,7 @@ def eval_row_by_z_homotopy(
 def decompress_newton(
     z_list,
     t_grid,
-    a_coeffs,
+    coeffs,
     w0_list=None,
     *,
     R=400.0,
@@ -1474,7 +1474,7 @@ def decompress_newton(
 
             zeta = z + alpha / w
             y = tau * w
-            F, Pz, Py = eval_P_partials(zeta, y, a_coeffs)
+            F, Pz, Py = eval_P_partials(zeta, y, coeffs)
             F = complex(F)
             if abs(F) <= tol:
                 return w, True
@@ -1502,7 +1502,7 @@ def decompress_newton(
 
                 zeta_new = z + alpha / w_new
                 y_new = tau * w_new
-                F_new = complex(eval_P_partials(zeta_new, y_new, a_coeffs)[0])
+                F_new = complex(eval_P_partials(zeta_new, y_new, coeffs)[0])
 
                 if abs(F_new) <= (1.0 - armijo * lam) * F_abs:
                     w = w_new
@@ -1516,7 +1516,7 @@ def decompress_newton(
         # accept if residual not crazy
         zeta = z + alpha / w
         y = tau * w
-        F_end = complex(eval_P_partials(zeta, y, a_coeffs)[0])
+        F_end = complex(eval_P_partials(zeta, y, coeffs)[0])
         return w, (abs(F_end) <= 1e3 * tol)
 
     # -----------------------

freealg/_algebraic_form/_decompress_util.py

@@ -64,14 +64,14 @@ def build_time_grid(sizes, n0, min_n_times=0):
 # eval P partials
 # ===============
 
-def eval_P_partials(z, m, a_coeffs):
+def eval_P_partials(z, m, coeffs):
     """
     Evaluate P(z,m) and its partial derivatives dP/dz and dP/dm.
 
-    This assumes P is represented by `a_coeffs` in the monomial basis
+    This assumes P is represented by `coeffs` in the monomial basis
 
         P(z, m) = sum_{j=0..s} a_j(z) * m^j,
-        a_j(z) = sum_{i=0..deg_z} a_coeffs[i, j] * z^i.
+        a_j(z) = sum_{i=0..deg_z} coeffs[i, j] * z^i.
 
     The function returns P, dP/dz, dP/dm with broadcasting over z and m.
 
@@ -81,7 +81,7 @@ def eval_P_partials(z, m, a_coeffs):
         First argument to P.
     m : complex or array_like of complex
         Second argument to P. Must be broadcast-compatible with `z`.
-    a_coeffs : ndarray, shape (deg_z+1, s+1)
+    coeffs : ndarray, shape (deg_z+1, s+1)
         Coefficient matrix for P in the monomial basis.
 
     Returns
@@ -103,14 +103,14 @@ def eval_P_partials(z, m, a_coeffs):
     --------
     .. code-block:: python
 
-        P, Pz, Pm = eval_P_partials(1.0 + 1j, 0.2 + 0.3j, a_coeffs)
+        P, Pz, Pm = eval_P_partials(1.0 + 1j, 0.2 + 0.3j, coeffs)
     """
 
     z = numpy.asarray(z, dtype=complex)
     m = numpy.asarray(m, dtype=complex)
 
-    deg_z = int(a_coeffs.shape[0] - 1)
-    s = int(a_coeffs.shape[1] - 1)
+    deg_z = int(coeffs.shape[0] - 1)
+    s = int(coeffs.shape[1] - 1)
 
     if (z.ndim == 0) and (m.ndim == 0):
         zz = complex(z)
@@ -120,7 +120,7 @@ def eval_P_partials(z, m, a_coeffs):
         ap = numpy.empty(s + 1, dtype=complex)
 
         for j in range(s + 1):
-            c = a_coeffs[:, j]
+            c = coeffs[:, j]
 
             val = 0.0 + 0.0j
             for i in range(deg_z, -1, -1):
@@ -160,10 +160,10 @@ def eval_P_partials(z, m, a_coeffs):
     Pm = numpy.zeros(zz.size, dtype=complex)
 
     for j in range(s + 1):
-        aj = zp @ a_coeffs[:, j]
+        aj = zp @ coeffs[:, j]
         P += aj * mp[:, j]
 
-        ajp = dzp @ a_coeffs[:, j]
+        ajp = dzp @ coeffs[:, j]
         Pz += ajp * mp[:, j]
 
         if j >= 1: