Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

Navier–Stokes Equations on R3 × [0, T] [electronic resource] / by Frank Stenger, Don Tucker, Gerd Baumann.

By: Contributor(s): Material type: TextTextPublisher: Cham : Springer International Publishing : Imprint: Springer, 2016Description: X, 226 p. 25 illus. in color. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783319275260
Subject(s): Additional physical formats: Printed edition:: No title; Printed edition:: No title; Printed edition:: No titleDDC classification:
  • 515.353 23
LOC classification:
  • QA370-380
Online resources:
Contents:
Preface -- Introduction, PDE, and IE Formulations -- Spaces of Analytic Functions -- Spaces of Solution of the N–S Equations -- Proof of Convergence of Iteration 1.6.3 -- Numerical Methods for Solving N–S Equations -- Sinc Convolution Examples -- Implementation Notes -- Result Notes.
In: Springer eBooksSummary: In this monograph, leading researchers in the world of numerical analysis, partial differential equations, and hard computational problems study the properties of solutions of the Navier–Stokes partial differential equations on (x, y, z, t) ∈ ℝ3 × [0, T]. Initially converting the PDE to a system of integral equations, the authors then describe spaces A of analytic functions that house solutions of this equation, and show that these spaces of analytic functions are dense in the spaces S of rapidly decreasing and infinitely differentiable functions. This method benefits from the following advantages: The functions of S are nearly always conceptual rather than explicit Initial and boundary conditions of solutions of PDE are usually drawn from the applied sciences, and as such, they are nearly always piece-wise analytic, and in this case, the solutions have the same properties When methods of approximation are applied to functions of A they converge at an exponential rate, whereas methods of approximation applied to the functions of S converge only at a polynomial rate Enables sharper bounds on the solution enabling easier existence proofs, and a more accurate and more efficient method of solution, including accurate error bounds Following the proofs of denseness, the authors prove the existence of a solution of the integral equations in the space of functions A ∩ ℝ3 × [0, T], and provide an explicit novel algorithm based on Sinc approximation and Picard–like iteration for computing the solution. Additionally, the authors include appendices that provide a custom Mathematica program for computing solutions based on the explicit algorithmic approximation procedure, and which supply explicit illustrations of these computed solutions.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Preface -- Introduction, PDE, and IE Formulations -- Spaces of Analytic Functions -- Spaces of Solution of the N–S Equations -- Proof of Convergence of Iteration 1.6.3 -- Numerical Methods for Solving N–S Equations -- Sinc Convolution Examples -- Implementation Notes -- Result Notes.

In this monograph, leading researchers in the world of numerical analysis, partial differential equations, and hard computational problems study the properties of solutions of the Navier–Stokes partial differential equations on (x, y, z, t) ∈ ℝ3 × [0, T]. Initially converting the PDE to a system of integral equations, the authors then describe spaces A of analytic functions that house solutions of this equation, and show that these spaces of analytic functions are dense in the spaces S of rapidly decreasing and infinitely differentiable functions. This method benefits from the following advantages: The functions of S are nearly always conceptual rather than explicit Initial and boundary conditions of solutions of PDE are usually drawn from the applied sciences, and as such, they are nearly always piece-wise analytic, and in this case, the solutions have the same properties When methods of approximation are applied to functions of A they converge at an exponential rate, whereas methods of approximation applied to the functions of S converge only at a polynomial rate Enables sharper bounds on the solution enabling easier existence proofs, and a more accurate and more efficient method of solution, including accurate error bounds Following the proofs of denseness, the authors prove the existence of a solution of the integral equations in the space of functions A ∩ ℝ3 × [0, T], and provide an explicit novel algorithm based on Sinc approximation and Picard–like iteration for computing the solution. Additionally, the authors include appendices that provide a custom Mathematica program for computing solutions based on the explicit algorithmic approximation procedure, and which supply explicit illustrations of these computed solutions.

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in