arXiv (All)
open access
Greedy Thiele continued-fraction approximation on continuum domains in the complex plane
We describe an adaptive greedy algorithm for Thiele continued-fraction (TCF) approximation of a function defined on a continuum domain in the complex plane. The algorithm iteratively selects interpolation nodes from an adaptively refined set of sample points on the domain boundary. We also present n
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Engineering a compact high-fidelity Staphylococcus aureus Cas9 variant with broader targeting range and mechanistic insights into its activation.#30513
- CAD algorithms for yield optimization of integrated circuits#334312
- Molecular Dynamics Simulations Demonstrate Reduced Antibiotic Affinity to Mirror Bacterial Targets.#653412
- Assessing Exhaustiveness of Stochastic Sampling for Integrative Modeling of Macromolecular Structures#996286
- Algorithmic exploration of the unit distance problem in the rational plane#926098
Record · ID 925823
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive