complex op• 資料種類:cpoints × cpoints → table
• 呼叫: import fullseye as fs; fs.ledger.cplx_laurent_coeffs(z, fz, kmin=-1, kmax=4, method='exact')(要直接呼叫實作,import mathops; mathops.cplx_laurent_coeffs(z, fz, kmin=-1, kmax=4, method='exact');從台帳取用則 opsmath.get("cplx_laurent_coeffs"))
均勻取樣圓周上的 Laurent(以及 Taylor)係數 —— 含留數。
> 以下的詳細說明為原文 —— 摘要與標題已翻譯。
For f holomorphic on an annulus around c, f(z) = sum_k c_k (z - c)^k with c_k = 1/(2*pi*i) ∮ f(zeta)/(zeta - c)^(k+1) dzeta. On a circle of radius r sampled at n equally spaced angles this becomes a discrete Fourier sum, c_k = (1/(n r^k)) sum_j f_j exp(-i k theta_j) — the trapezoidal rule in the angle, where it converges geometrically rather than as O(n^-2) (Trefethen & Weideman 2014, "The exponentially convergent trapezoidal rule").
c_-1 is the residue at c (when c is the only singularity inside), c_k for k >= 0 are the Taylor coefficients f^(k)(c)/k!, and a non-zero c_-m for m > 1 reveals a pole of order m. Measured on the unit circle with f = 1/(z - 0.5), n = 64: c_-1 = 1 and c_-2 = 0.5 to 1e-16 (machine precision).
method="exact" (default) preserves the direct Fourier sum. method="fast" uses an FFT only when angular gaps agree within 64 * float64 epsilon; otherwise it routes to the exact sum. On 4,096 samples and 201 orders the fast path measured over 15 times faster, while differing from the direct sum by less than 1e-12.
Returns a dict: k (int64 orders, kmin..kmax) · c (complex128 coefficients) · center · radius. The centre is the sample mean, which is exact for a uniformly sampled circle.
Orientation, and how it differs from the rest of the family: the sum runs over the sample *set*, not the sample *order*, so this op always returns the coefficients of the positively oriented circle — the standard definition — whatever order the points arrive in. Feed a clockwise circle and c_-1 still comes back + the residue, while cplx_contour_integral / (2*pi*i) on the same points returns - it (verified). Both are right; they answer different questions (the intrinsic coefficient vs the integral along *this* traversal). Do not cross-check one against the other without fixing the orientation first.
Honest limitation — aliasing: the discrete sum cannot distinguish c_k from c_{k+n}, so a coefficient carries the alias sum sum_m c_{k+m n} r^{m n}. That is negligible for a rapidly converging series (the 0.5^64 term above) and ruinous near the annulus boundary. Requesting more than n coefficients is refused for the same reason.
Raises ValueError: the samples are not a uniformly spaced circle (unequal radii or unequal angular gaps beyond 1e-8 relative — this op is *not* valid on an arbitrary contour, and silently pretending otherwise would return numbers that mean nothing), kmin > kmax, more than n coefficients requested, non-integer orders, and a coefficient that overflowed (r^-k for a small radius and a large negative order).
HALCON: no operator.
mathops 的每個運算子都先檢驗輸入再計算(不讓任何東西無聲通過):
• complex 輸入一律 ValueError —— 強制轉成 float64 會無聲丟掉虛部(numpy 只發一個 ComplexWarning,然後回傳一個「看似合理卻是錯的」實數)。請明確寫出 .real/.imag/abs(),或改用支援複數的 complexops。
• 含被遮罩元素的 masked array 一律 ValueError —— 拒絕「剝掉遮罩直接使用下面原值」的隱式轉換。請明確選擇填補還是丟棄。
• 所有輸入中的 NaN/Inf 一律 ValueError(明確給出個數後拒絕 —— 它會汙染整個結果)。
• 形狀嚴格:不對 1-D 與 2-D 做隱式提升或廣播(向量槽位收到矩陣、矩陣槽位收到向量都是 ValueError;請明確 reshape)。
• 尺寸上限:接受矩陣的運算子與 stat_histogram 的 bins,超過 mathops.MAX_ELEMENTS(2^26 ≈ 6700 萬個元素)即 ValueError。
• 範例資料目錄(下載 URL / 授權) —— 2-D 用 skimage.data(BSD/公有領域)加合成圖,3-D 給出真實資料源(Stanford/PDS 等)的下載 URL。
• 運算子來歷與參考文獻 —— 該運算子族所依據的研究/方法出處。
• 演算法的正典(作者、年份)與用途見上面的族使用指南。
• math_complex — py -3.11 examples/math_complex.py
table 作為輸入)dynsys_poincare_section · dwt_inverse · chebyshev_eval_nd
complex)cplx_contour_circle · cplx_poly_eval · cplx_contour_integral · cplx_winding_number · cplx_cauchy_value · cplx_argument_principle · cplx_joukowski · cplx_mobius
*Provenance: mathops.py — MATH 運算子登記表。本條目由 tools/opdocs.py md 自動產生(請勿手動編輯)。*
© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.