Guessing singular dependencies
Given a complex function \(f(z)=\sum_k f_k z^k\), it is first shown how to compute its radius of convergence, its analytic continuation, the nearest singularity, and, possibly, to explore the Riemann surface beyond the singularity. When \(f\) is meromorphic, the methods can be simplified and alternatives are provided. These algorithms are needed in the main topic of the paper, which is the detection of analytic dependencies. If \(f\) (analytic in a closed disk except for a finite number of singularities) is algebraic at \(\sigma\), i.e., \(\sum_{k=0}^d P_k f^k=0\) with \(P_k\) analytic at \(\sigma\), an algorithm is provided to compute the \(\{P_k\}\). If \(f\) is Fuchsian, meaning that it satisfies a differential equation with polynomial coefficients \(L_k\) such that \(\sum_{k=0}^d L_k f^{(k)}=0\), again an algorithm to find the \(L_k\) is given. Alternatively, when analytic continuation is not an option, a numerical method is proposed for the following dependency problem. Given \(d\) formal power series \(f_k\) with radius of convergence at least \(r\), the problem is to find power series \(g_k\) and \(h\) such that \(\sum_{k=1}^d g_k f_k=h\). This is solved by truncating all power series after \(n\) terms, letting \(n\to\infty\) and solving the corresponding systen in a least squares sense. Numerical examples illustrate the methods.
- A note on algebraic independence of logarithmic and exponential constants
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Decision problems for differential equations
- Effective analytic functions
- Extrapolation methods theory and practice
- Factoring polynomials with rational coefficients
- Fast Algorithms for Manipulating Formal Power Series
- Fast evaluation of holonomic functions
- Gaussian elimination is not optimal
- GFUN
- How to multiply matrices faster
- How to recognize zero?
- scientific article; zbMATH DE number 4171064 (Why is no real title available?)
- scientific article; zbMATH DE number 1254251 (Why is no real title available?)
- scientific article; zbMATH DE number 1254271 (Why is no real title available?)
- scientific article; zbMATH DE number 729555 (Why is no real title available?)
- scientific article; zbMATH DE number 1460545 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- scientific article; zbMATH DE number 3270885 (Why is no real title available?)
- scientific article; zbMATH DE number 3281219 (Why is no real title available?)
- Multiplying matrices faster than coppersmith-winograd
- Numerical recipes. The art of scientific computing.
- On asymptotic extrapolation
- On effective analytic continuation
- Relax, but don't be too lazy
- Ten Problems in Experimental Mathematics
- The computer as crucible. An introduction to experimental mathematics. With illustrations by Karl H. Hofmann
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Transcendental numbers and diophantine approximations
- Zero tests for constants in simple scientific computation
This page was built for publication: Guessing singular dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437325)