An FFT-based algorithm for \(2\)D power series expansions

DOI10.1016/S0898-1221(99)00122-4zbMath0936.65150OpenAlexW2088334502MaRDI QIDQ1963035

Tong-Yi Guo, Jia-Chyu Guo, Hwang, Chyi

Publication date: 20 January 2000

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0898-1221(99)00122-4

zbMATH Keywords

algorithmRiemann zeta functionfast Fourier transforminverse Laplace transformpower series expansionbivariate analytic function

Mathematics Subject Classification ID

General theory of numerical methods in complex analysis (potential theory, etc.) (65E05) Numerical methods for discrete and fast Fourier transforms (65T50) Numerical methods for integral transforms (65R10) Power series, series of functions of several complex variables (32A05)

Uses Software

• Algorithm 413

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved FFT-based numerical inversion of Laplace transforms via fast Hartley transform algorithm
• Several complex variables I. Introduction to complex analysis. Transl. from the Russian by P. M. Gauthier
• Multidimensional Residues, Generating Functions, and Their Application to Queueing Networks
• Numerical Differentiation of Analytic Functions
• Partitions Approximated by Finite Cosine-Series
• Numerical Differentiation of Analytic Functions
• A New Method for Generating Power Series Expansions of Functions
• Differentiation Formulas for Analytic Functions

This page was built for publication: An FFT-based algorithm for \(2\)D power series expansions