Daniel Siewiorek – författare

Asymptotic Approximations of Integrals deals with the methods used in the asymptotic approximation of integrals. Topics covered range from logarithmic singularities and the summability method to the distributional approach and the Mellin transform technique for multiple integrals. Uniform asymptotic expansions via a rational transformation are also discussed, along with double integrals with a curve of stationary points. For completeness, classical methods are examined as well. Comprised of nine chapters, this volume begins with an introduction to the fundamental concepts of asymptotics, followed by a discussion on classical techniques used in the asymptotic evaluation of integrals, including Laplace''s method, Mellin transform techniques, and the summability method. Subsequent chapters focus on the elementary theory of distributions; the distributional approach; uniform asymptotic expansions; and integrals which depend on auxiliary parameters in addition to the asymptotic variable. The book concludes by considering double integrals and higher-dimensional integrals. This monograph is intended for graduate students and research workers in mathematics, physics, and engineering.

Perspectives in Computing, Vol. 17: Pascal-SC: A Computer Language for Scientific Computation focuses on the application of Pascal-SC, a programming language developed as an extension of standard Pascal, in scientific computation. The publication first elaborates on the introduction to Pascal-SC, a review of standard Pascal, and real floating-point arithmetic. Discussions focus on optimal scalar product, standard functions, real expressions, program structure, simple extensions, real floating-point arithmetic, vector and matrix arithmetic, and dynamic arrays. The text then examines functions and operators with arbitrary result types and solving problems with Pascal-SC. The book ponders on strings and text processing, dynamic arrays, and modules. Topics include declaration and use of modules, compatibility of static and dynamic arrays, dynamic result types of functions and operators, strings in procedures, functions, and operators, and declaration of string variables. The publication is a dependable reference for computer science experts and researchers interested in the application of Pascal-SC in scientific computation.

Numerical Method for Initial Value Problems in Ordinary Differential Equations deals with numerical treatment of special differential equations: stiff, stiff oscillatory, singular, and discontinuous initial value problems, characterized by large Lipschitz constants. The book reviews the difference operators, the theory of interpolation, first integral mean value theorem, and numerical integration algorithms. The text explains the theory of one-step methods, the Euler scheme, the inverse Euler scheme, and also Richardson''s extrapolation. The book discusses the general theory of Runge-Kutta processes, including the error estimation, and stepsize selection of the R-K process. The text evaluates the different linear multistep methods such as the explicit linear multistep methods (Adams-Bashforth, 1883), the implicit linear multistep methods (Adams-Moulton scheme, 1926), and the general theory of linear multistep methods. The book also reviews the existing stiff codes based on the implicit/semi-implicit, singly/diagonally implicit Runge-Kutta schemes, the backward differentiation formulas, the second derivative formulas, as well as the related extrapolation processes. The text is intended for undergraduates in mathematics, computer science, or engineering courses, andfor postgraduate students or researchers in related disciplines.

Perspectives in Computing: A Computational Logic Handbook contains a precise description of the logic and a detailed reference guide to the associated mechanical theorem proving system, including a primer for the logic as a functional programming language, an introduction to proofs in the logic, and a primer for the mechanical theorem. The publication first offers information on a primer for the logic, formalization within the logic, and a precise description of the logic. Discussions focus on induction and recursion, quantification, explicit value terms, dealing with features and omissions, elementary mathematical relationships, Boolean operators, and conventional data structures. The text then takes a look at proving theorems in the logic, mechanized proofs in the logic, and an introduction to the system. The text examines the processes involved in using the theorem prover, four classes of rules generated from lemmas, and aborting or interrupting commands. Topics include executable counterparts, toggle, elimination of irrelevancy, heuristic use of equalities, representation of formulas, type sets, and the crucial check points in a proof attempt. The publication is a vital reference for researchers interested in computational logic.