Nonpolynomial finite difference schemes and the use of the fast Fourier transform
From MaRDI portal
Publication:1056206
DOI10.1016/0021-9991(83)90099-2zbMath0522.65064OpenAlexW2019793175MaRDI QIDQ1056206
Publication date: 1983
Published in: Journal of Computational Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0021-9991(83)90099-2
exponential functionfast Fourier transformcomputational resultsnonpolynomial finite difference schemes
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Cites Work
- On the FACR(l) algorithm for the discrete Poisson equation
- Use of fast Fourier transforms for solving partial differential equations in physics
- Accurate Representations of Partial Differential Equations by Finite-difference Schemes
- FINITE DIFFERENCES ASSOCIATED WITH SECOND—ORDER DIFFERENTIAL EQUATIONS
- A SUGGESTED APPROACH TO FINITE-DIFFERENCE REPRESENTATION OF DIFFERENTIAL EQUATIONS,
- Further Accurate Representations of Partial Differential Equations by Finite-difference Methods
- New Methods for the Derivation of Stable Difference Representations for Differential Equations
- The Methods of Cyclic Reduction, Fourier Analysis and the FACR Algorithm for the Discrete Solution of Poisson’s Equation on a Rectangle
- Steady Laminar Forced Convection from a Circular Cylinder at Low Reynolds Numbers
- RELAXATION METHODS APPLIED TO DETERMINE THE MOTION, IN TWO DIMENSIONS, OF A VISCOUS FLUID PAST A FIXED CYLINDER
This page was built for publication: Nonpolynomial finite difference schemes and the use of the fast Fourier transform
