Accuracy and stability of computing high-order derivatives of analytic functions by Cauchy integrals
DOI10.1007/s10208-010-9075-zzbMath1213.65039arXiv0910.1841OpenAlexW3100091305MaRDI QIDQ626444
Publication date: 18 February 2011
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.1841
algorithmstabilityCauchy integralaccuracycondition numbernumerical differentiationHardy spacesnumerical stabilityFredholm determinantanalytic functionsround-off errorsentire functions of perfectly and completely regular growthoptimal radiusrandom matrix ensemble
Integration, integrals of Cauchy type, integral representations of analytic functions in the complex plane (30E20) Roundoff error (65G50) General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical differentiation (65D25) Special classes of entire functions of one complex variable and growth estimates (30D15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetric functions and P-recursiveness
- On the condition number of Lagrangian numerical differentiation
- Approximation of entire functions over bounded domains
- A Fredholm determinant formula for Toeplitz determinants
- On a Toeplitz determinant identity of Borodin and Okounkov
- Bulk universality for Wigner Hermite matrices with subexponential decay
- The special functions and their approximations. Vol. I, II
- Optimal quadrature problem on Hardy-Sobolev classes
- Accelerated polynomial approximation of finite order entire functions by growth reduction
- A Generalisation of Stirling's Formula.
- On the numerical evaluation of Fredholm determinants
- Numerical Differentiation of Analytic Functions
- The Local Growth of Power Series: A Survey of the Wiman-Valiron Method
- Accuracy and Stability of Numerical Algorithms
- Numerical Methods for Special Functions
- Is Gauss Quadrature Better than Clenshaw–Curtis?
- On multipliers preserving convergence of trigonometric series almost everywhere
- New Proofs of Some Theorems of Hardy by Banach Space Methods
- A Fredholm determinant identity and the convergence of moments for random Young tableaux