Pseudo spectral method numerical analysis (2 risultati)

Titolo
Perfeziona con la Ricerca avanzata

Perfeziona la tua ricerca

  • Libri (2)

  • Nuovo (2)

  • Con foto (2)

a

Fascia di prezzo personalizzata (EUR)

a

  • Lingua: Inglese

    Editore: OmniScriptum, 2026

    6134711799 / 9786134711791

    • Brossura
    • Print on Demand

    Da: preigu, Osnabrück, Germaniapreigu

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 125,30

    EUR 70,00 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 5 disponibili

    Taschenbuch. Condizione: 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.

  • Lingua: Inglese

    Editore: Omniscriptum, 2026

    6134711799 / 9786134711791

    • Brossura
    • Print on Demand

    Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH

    Venditore con 5 stelle
    Contatta il venditore

    Condizione: Nuovo

    EUR 216,94

    EUR 30,50 spedizione 
    Spedito da Germania a U.S.A.

    Quantità: 1 disponibili

    Taschenbuch. Condizione: 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.