Pseudo Spectral Method Numerical Analysis (2 results)

Title
Refine with Advanced Search

Refine your search

  • Books (2)

  • New (2)

to

Custom price range (US$)

to

  • Language: English

    Published by OmniScriptum, 2026

    6134711799 / 9786134711791

    • Softcover
    • Print on Demand

    Seller: preigu, Osnabrück, Germanypreigu

    5-star seller
    Contact seller

    Condition: New

    US$ 148.24

    US$ 80.40 shipping 
    Ships from Germany to U.S.A.

    Quantity: 5 available

    Taschenbuch. Condition: Neu. Pseudo-Spectral Method | Numerical Analysis, Applied Mathematics, Computational Science, Wave Function | Lambert M. Surhone (u. a.) | Taschenbuch | Englisch | 2026 | OmniScriptum | EAN 9786134711791 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu Print on Demand.

  • Language: English

    Published by Omniscriptum, 2026

    6134711799 / 9786134711791

    • Softcover
    • Print on Demand

    Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

    5-star seller
    Contact seller

    Condition: New

    US$ 256.66

    US$ 35.03 shipping 
    Ships from Germany to U.S.A.

    Quantity: 1 available

    Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. Pseudo-spectralmethods are a class of numerical methods used in applied mathematics andscientific computing for the solution of PDEs, such as the directsimulation of a particle with an arbitrary wavefunction interacting withan arbitrary potential. They are related to spectral methods and areused extensively in computational fluid dynamics and other areas, butare demonstrated below on an example from quantum physics. If thewavefunction is approximated by its value at n distinct points, eachiteration requires 3 pointwise multiplications, one FFT, and one inverseFFT. The pointwise multiplications each require O(n) effort, and the FFTand inverse FFT each require O(nlgn) effort. The total computationaleffort is therefore determined largely by the FFT steps, so it isimperative to use an efficient (and accurate) implementation of the FFT.Fortunately, many are freely available.