Numerical evaluation of Airy functions with complex arguments (Q1184603): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An algorithm for the evaluation of the complex Airy functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3896709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shear-flow instability at the interface between two viscous fluids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shear-flow instability due to a wall and a viscosity discontinuity at the interface / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4059363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3331506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error Bounds for Linear Recurrence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Aspects of Three-Term Recurrence Relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3332204 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive computation of certain derivatives&a study of error propagation / rank
 
Normal rank

Latest revision as of 15:09, 15 May 2024

scientific article
Language Label Description Also known as
English
Numerical evaluation of Airy functions with complex arguments
scientific article

    Statements

    Numerical evaluation of Airy functions with complex arguments (English)
    0 references
    0 references
    28 June 1992
    0 references
    The authors give two methods for the evaluation of Airy functions of complex argument. The first method is based on the Taylor series expansion or an asymptotic expansion of each function. This method is accurate to any desired precision but is slow an unsuitable for fixed- precision languages. The second method extends a known idea to the complex plane, which is accurate to double precision (12 digits) and is suitable for programming in Fortran. It actually uses the first method to obtain a grid of points in the complex plane where the functions are known to high precision and then uses Taylor series from these base points. This makes the algorithm accurate and efficient.
    0 references
    Airy functions of complex argument
    0 references
    Taylor series expansion
    0 references
    asymptotic expansion
    0 references
    algorithm
    0 references
    0 references

    Identifiers