FFTs and three-dimensional Poisson solvers for hypercubes (Q1175197): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Thomas Turnbull / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Olof B. Widlund / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-8191(05)80100-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071337437 / rank
 
Normal rank

Latest revision as of 10:53, 30 July 2024

scientific article
Language Label Description Also known as
English
FFTs and three-dimensional Poisson solvers for hypercubes
scientific article

    Statements

    FFTs and three-dimensional Poisson solvers for hypercubes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 June 1992
    0 references
    In many applications, very much fast Fourier transforms (FFTs) need to be computed. An important example is provided by various fast Poisson solvers. In particular, Poisson's equation on a cube can be solved by using Fourier transforms in two directions and tridiagonal linear equation solvers for the third coordinate. This paper is a careful study of the performance of various strategies to parallelize these algorithms on hypercubes. A number of alternatives for the FFT are introduced and formulas for their running time are developed and compared with actual performance on an Intel system. A similar study is then conducted for fast Poisson solvers. The paper ends with a discussion of two additional Poisson solvers, which had not been tested by the time of the completion of this project.
    0 references
    parallel computation
    0 references
    three-dimensional Poisson solvers
    0 references
    fast Fourier transforms
    0 references
    fast Poisson solvers
    0 references
    Poisson's equation
    0 references
    performance
    0 references
    hypercubes
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references