Parallelism in spectral methods (Q1122343): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary and interface conditions within a finite element preconditioner for spectral methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev pseudospectral solution of second-order elliptic equations with finite element preconditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating direction methods for three space variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4199478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Direction Methods on Multiprocessors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3914616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3030444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Partial Differential Equations on Vector and Parallel Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-sorting mixed-radix fast Fourier transforms / rank
 
Normal rank

Latest revision as of 14:49, 19 June 2024

scientific article
Language Label Description Also known as
English
Parallelism in spectral methods
scientific article

    Statements

    Parallelism in spectral methods (English)
    0 references
    0 references
    1988
    0 references
    The purpose of this paper is to discuss where and to what extent it is possible to introduce parallelism in spectral algorithms. Communication networks which are suitable for the implementation of spectral methods of fine grain local memory architectures are shown. Typical algorithms for the spectral approximation of the viscous incompressible Navier-Stokes equations serve as examples in the discussion.
    0 references
    parallel computation
    0 references
    spectral algorithms
    0 references
    viscous incompressible Navier- Stokes equations
    0 references
    0 references

    Identifiers

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