Power series in computer algebra (Q1198232): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0747-7171(10)80012-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023383647 / rank
 
Normal rank

Latest revision as of 09:21, 30 July 2024

scientific article
Language Label Description Also known as
English
Power series in computer algebra
scientific article

    Statements

    Power series in computer algebra (English)
    0 references
    16 January 1993
    0 references
    Let \(f\) be a function, meromorphic in a neighbourhood of \(z_ 0\in\mathbb{C}\) and having a pole in \(z_ 0\) [or being holomorphic in \(z_ 0\)]. The paper deals with the following method to compute the Laurent expansion [or the Taylor expansion] of \(f\) at \(z_ 0\): Find a homogeneous differential equation which has polynomials as coefficients and is satisfied by \(f\), translate the differential equation into a linear recursion formula for the coefficients of the Laurent expansion [or the Taylor expansion] and calculate the coefficients from the recursion formula. This method may be applied to a wide class of functions; it has been implemented in the computer algebra systems Maple and Mathematica.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    meromorphic
    0 references
    pole
    0 references
    Laurent expansion
    0 references
    Taylor expansion
    0 references
    homogeneous differential equation
    0 references
    linear recursion formula
    0 references
    computer algebra systems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references