Fast Fourier transform method for partial differential equations, case study: The 2-D diffusion equation (Q1110287): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0898-1221(88)90182-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066925429 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Direct Solution of Poisson's Equation Using Fourier Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713483 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The numerical solution of linear time-dependent partial differential equations by the Laplace and fast Fourier transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3894929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3321316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4171531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4084640 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341807 / rank
 
Normal rank

Latest revision as of 19:24, 18 June 2024

scientific article
Language Label Description Also known as
English
Fast Fourier transform method for partial differential equations, case study: The 2-D diffusion equation
scientific article

    Statements

    Fast Fourier transform method for partial differential equations, case study: The 2-D diffusion equation (English)
    0 references
    1988
    0 references
    The authors consider the 2D constant coefficient diffusion equation in a rectangle (say with first kind boundary conditions). They develop the idea to apply the fast Fourier transform (FFT) in x and y direction to the initial data, to multiply by the n-th power (if the solution at n t is desired) of the transfer function and once more to use FFT to get the numerical result. The arguments in favour of this process are: it does not depend on n (in the sense that the mentioned n-th power can be calculated through exponentials) and hence the solution at n t can be obtained in one step; the difference between explicit and implicit schemes disappears (and the highest order method may be selected; all single parts of this process (FFT, vector multiply) are executable by corresponding hardware. Some timing results of experiments using such equipment are cited.
    0 references
    0 references
    0 references
    0 references
    0 references
    case study
    0 references
    finite difference schemes
    0 references
    linear filter
    0 references
    diffusion equation
    0 references
    fast Fourier transform
    0 references
    0 references
    0 references
    0 references
    0 references