Guessing singular dependencies (Q2437325): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q122178562, #quickstatements; #temporary_batch_1712186161777
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Ten Problems in Experimental Mathematics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Manipulating Formal Power Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extrapolation methods theory and practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on algebraic independence of logarithmic and exponential constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3497179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision problems for differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4855565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast evaluation of holonomic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relax, but don't be too lazy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective analytic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On effective analytic continuation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On asymptotic extrapolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transcendental numbers and diophantine approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5566070 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to multiply matrices faster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3592129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to recognize zero? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero tests for constants in simple scientific computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: GFUN / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplying matrices faster than coppersmith-winograd / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5555887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324964 / rank
 
Normal rank

Latest revision as of 09:38, 7 July 2024

scientific article
Language Label Description Also known as
English
Guessing singular dependencies
scientific article

    Statements

    Guessing singular dependencies (English)
    0 references
    3 March 2014
    0 references
    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.
    0 references
    asymptotic dependency
    0 references
    orthogonalization
    0 references
    analytic continuation
    0 references
    Fuchsian singularity
    0 references
    Padé-Hermite forms
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers