Minimax separation of the Cauchy kernel

Abstract

We prove and apply an optimal low-rank approximation of the Cauchy kernel over separated real domains. A skeleton decomposition is the minimum over real-valued functions of the maximum relative pointwise error. We present an algorithm to optimize its parameters, demonstrate suboptimal but effective heuristic approximations, and identify numerically stable forms.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…