An FFT-based algorithm for 2D power series expansions
From MaRDI portal
Recommendations
- A two-dimensional generalization of the Bauer algorithm
- scientific article; zbMATH DE number 4004852
- The two-dimensional g-fraction with independent variables for double power series
- A fast algorithm for reversion of power series
- Regular two-dimensional \(C\)-fraction with non-equivalent variables for double power series
Cites work
- scientific article; zbMATH DE number 3853473 (Why is no real title available?)
- scientific article; zbMATH DE number 192909 (Why is no real title available?)
- scientific article; zbMATH DE number 3189602 (Why is no real title available?)
- A New Method for Generating Power Series Expansions of Functions
- Differentiation Formulas for Analytic Functions
- Improved FFT-based numerical inversion of Laplace transforms via fast Hartley transform algorithm
- Multidimensional Residues, Generating Functions, and Their Application to Queueing Networks
- Numerical Differentiation of Analytic Functions
- Numerical Differentiation of Analytic Functions
- Partitions Approximated by Finite Cosine-Series
- Several complex variables I. Introduction to complex analysis. Transl. from the Russian by P. M. Gauthier
Cited in
(3)
This page was built for publication: An FFT-based algorithm for \(2\)D power series expansions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963035)