By David A. Kopriva

This e-book bargains a scientific and self-contained method of clear up partial differential equations numerically utilizing unmarried and multidomain spectral tools. It comprises designated algorithms in pseudocode for the appliance of spectral approximations to either one and dimensional PDEs of mathematical physics describing potentials, delivery, and wave propagation. David Kopriva, a widely known researcher within the box with large sensible adventure, exhibits how just a couple of primary algorithms shape the development blocks of any spectral code, even for issues of complicated geometries. The publication addresses computational and functions scientists, because it emphasizes the sensible derivation and implementation of spectral equipment over summary arithmetic. it truly is divided into components: First comes a primer on spectral approximation and the elemental algorithms, together with FFT algorithms, Gauss quadrature algorithms, and the way to approximate derivatives. the second one half exhibits tips on how to use these algorithms to resolve regular and time established PDEs in a single and area dimensions. workouts and questions on the finish of every bankruptcy motivate the reader to scan with the algorithms.

Show description

Read or Download Implementing Spectral Methods for Partial Differential Equations: Algorithms for Scientists and Engineers PDF

Similar number systems books

Numerical Solutions of Partial Differential Equations (Applied Mathematical Sciences)

This e-book is the results of classes of lectures given on the college of Cologne in Germany in 1974/75. the vast majority of the scholars weren't accustomed to partial differential equations and useful research. This explains why Sections 1, 2, four and 12 include a few easy fabric and effects from those parts.

Implementing Spectral Methods for Partial Differential Equations: Algorithms for Scientists and Engineers

This booklet deals a scientific and self-contained method of clear up partial differential equations numerically utilizing unmarried and multidomain spectral equipment. It comprises unique algorithms in pseudocode for the applying of spectral approximations to either one and dimensional PDEs of mathematical physics describing potentials, shipping, and wave propagation.

Methods of Mathematical Physics

This recognized textual content and reference comprises an account of these mathematical equipment that experience purposes in a minimum of branches of physics. The authors supply examples of the sensible use of the equipment taken from a variety of physics, together with dynamics, hydrodynamics, elasticity, electromagnetism, warmth conduction, wave movement and quantum concept.

Front Tracking for Hyperbolic Conservation Laws

This booklet provides the speculation of hyperbolic conservation legislation from easy thought to the leading edge of analysis. The textual content treats the idea of scalar conservation legislation in a single size intimately, exhibiting the soundness of the Cauchy challenge utilizing entrance monitoring. The extension to multidimensional scalar conservation legislation is got utilizing dimensional splitting.

Additional info for Implementing Spectral Methods for Partial Differential Equations: Algorithms for Scientists and Engineers

Sample text

67), we get the well known Discrete Fourier Transform Pair ⎧ −2πij k/N , k = −N/2, . . 69) ⎩f (x ) = N/2−1 f˜ e2πij k/N , j = 0, 1, . . , N − 1. j k=−N/2 k In Chap. 2, we will show how to compute the DFT rapidly using a Fast Fourier Transform. 53) that it is a two step process to compute the interpolant from the Fourier modes. First, we compute and store the coefficients. From the coefficients, we construct the interpolant. Our first two algorithms: Algorithms 1 (DiscreteFourierCoefficients) and 2 (FourierInterpolantFromModes) compute these two steps directly.

The sign of the input variable s determines whether the procedure computes the forward or backward sum. To avoid having to remember which sign corresponds to which transform, let’s define two constants FORWARD = 1 and BACKWARD = −1 to use as input to the procedure. 69). 2) each return a sequence with elements ordered as k = 0, 1, . . , N − 1 instead. Algorithm 6: DFT: Direct (and Slow) Evaluation of the Discrete Fourier Transform Procedure DFT Input: fj N −1 ,s j =0 for k = 0 to N − 1 do Fk ← 0 for j = 0 to N − 1 do Fk ← Fk + fj ∗ e−2sπ ij k/N end end −1 return {Fk }N k=0 End Procedure DFT 2 Algorithms for Periodic Functions 41 For the DFT to be useful in spectral approximations, we must reinterpret the order of the sequences.

Deikx /dx = ikeikx . The Legendre, Chebyshev and, indeed, all of the Jacobi polynomials are not. Instead, we have just seen that the derivatives of the Legendre and Chebyshev polynomials satisfy a three-term recursion relation that couples the polynomial modes. To see how polynomial modes are coupled when we take derivatives, suppose f is also square integrable. Then we can write its derivative as a Legendre series ∞ f (x) = (1) fˆk Lk (x). 83) that we rewrite as Lk (x) = Lk+1 (x) 2k + 1 − Lk−1 (x) 2k + 1 .

Download PDF sample

Rated 4.86 of 5 – based on 21 votes