Skip to main content
Elsevier

Books in Mathematics

The Mathematics collection presents a range of foundational and advanced research content across applied and discrete mathematics, including fields such as Computational Mathematics; Differential Equations; Linear Algebra; Modelling & Simulation; Numerical Analysis; Probability & Statistics.

  • FORTRAN

    • 1st Edition
    • Samuel L. Marateck
    • English
    FORTRAN is written for students who have no prior knowledge of computers or programming. The book aims to teach students how to program using the FORTRAN language. The publication first elaborates on an introduction to computers and programming, introduction to FORTRAN, and calculations and the READ statement. Discussions focus on flow charts, rounding numbers, strings, executing the program, the WRITE and FORMAT statements, performing an addition, input and output devices, and algorithms. The text then takes a look at functions and the IF statement and the DO Loop, the IF-THEN-ELSE and the WHILE loop, including applications of the DO loop, the LOGICAL declaration statement, library functions, other applications of the IF statement, and writing REAL constants in exponential form. The manuscript ponders on subscripted variables, the DATA statement, and the implied DO loop, doubly subscripted variables and matrix multiplication, input/output, and functions, subprograms, and subroutines. Topics include statement functions, subprograms calling other subprograms, reading using X format, control characters, reading using F format, INTEGER subscripted variables, and matrix multiplication. The publication is a dependable source of data for computer programmers and students interested in the FORTRAN language.

  • Iterative Methods for Large Linear Systems

    • 1st Edition
    • David R. Kincaid + 1 more
    • English
    Iterative Methods for Large Linear Systems contains a wide spectrum of research topics related to iterative methods, such as searching for optimum parameters, using hierarchical basis preconditioners, utilizing software as a research tool, and developing algorithms for vector and parallel computers. This book provides an overview of the use of iterative methods for solving sparse linear systems, identifying future research directions in the mainstream of modern scientific computing with an eye to contributions of the past, present, and future. Different iterative algorithms that include the successive overrelaxation (SOR) method, symmetric and unsymmetric SOR methods, local (ad-hoc) SOR scheme, and alternating direction implicit (ADI) method are also discussed. This text likewise covers the block iterative methods, asynchronous iterative procedures, multilevel methods, adaptive algorithms, and domain decomposition algorithms. This publication is a good source for mathematicians and computer scientists interested in iterative methods for large linear systems.

  • Statistical Computer Performance Evaluation

    • 1st Edition
    • Walter Freiberger
    • English
    Statistical Computer Performance Evaluation contains the proceedings of a Conference on Statistical Computer Performance Evaluation held at Brown University in Providence, Rhode Island, on November 22-23, 1971, under the auspices of the Division of Applied Mathematics and the Center for Computer and Information Sciences. The papers review the application of quantitative, and particularly statistical, methods to the study of computer performance. Comprised of 19 chapters, this book begins with an overview of the state of the art of computer system evaluation and some quantitative methods (analytical, simulation, and empirical methods) that are applicable to the problem. A utility theoretic approach to evaluation of a time-sharing system is then described, followed by a discussion on the results of a multi-factor paging experiment. Subsequent chapters focus on statistical quantification of instruction and operand traces; measurement and improvement of program behavior under paging systems; free-storage algorithms; and probabilistic models for predicting software reliability. This monograph will be of interest to practitioners in the fields ofcomputer science and applied mathematics.

  • Large Scale Scientific Computation

    Proceedings of a Conference Conducted by the Mathematics Research Center, the University of Wisconsin - Madison, May 17-19, 1983
    • 1st Edition
    • Seymour V. Parter
    • English
    Large Scale Scientific Computation is a collection of papers that deals with specialized architectural considerations, efficient use of existing computers, software developments, large scale projects in diverse disciplines, and mathematical approaches to basic algorithmic problems. One paper describes numerical treatment of large highly nonlinear two or three dimensional boundary value problems by quadratic minimization techniques applied in many institutions such as in Laboratoire Central des Ponts et Chaussees, Avions Marcel Dassault et Breguet Aviation. Another paper discusses computer-structured design techniques to improve the reliability, efficiency, and accuracy of future production codes. Computer modelling is a potent tool in numerical weather prediction relying on observation, analysis, initialization, and model development. One paper illustrates a systolic algorithm for matrix triangulation, as well as its uses in the Cholesky decomposition of covariance matrices. Another paper describes the Transient Reactor Analysis Code (TRAC) designed to deal with internal flow problems of nuclear reactors. One paper explains the application of large-scale aerodynamic simulation where the programmer can use finite difference techniques in which a large number of mesh points are strategically and orderly placed in the domain of the flow field. The collection is intended for undergraduates in mathematics, programming, computer science, or engineering courses, and designers or researchers involved in industrial facilities, aeronautics, and nuclear design.

  • Oriented Projective Geometry

    A Framework for Geometric Computations
    • 1st Edition
    • Jorge Stolfi
    • English
    Oriented Projective Geometry: A Framework for Geometric Computations proposes that oriented projective geometry is a better framework for geometric computations than classical projective geometry. The aim of the book is to stress the value of oriented projective geometry for practical computing and develop it as a rich, consistent, and effective tool for computer programmers. The monograph is comprised of 20 chapters. Chapter 1 gives a quick overview of classical and oriented projective geometry on the plane, and discusses their advantages and disadvantages as computational models. Chapters 2 through 7 define the canonical oriented projective spaces of arbitrary dimension, the operations of join and meet, and the concept of relative orientation. Chapter 8 defines projective maps, the space transformations that preserve incidence and orientation; these maps are used in chapter 9 to define abstract oriented projective spaces. Chapter 10 introduces the notion of projective duality. Chapters 11, 12, and 13 deal with projective functions, projective frames, relative coordinates, and cross-ratio. Chapter 14 tells about convexity in oriented projective spaces. Chapters 15, 16, and 17 show how the affine, Euclidean, and linear vector spaces can be emulated with the oriented projective space. Finally, chapters 18 through 20 discuss the computer representation and manipulation of lines, planes, and other subspaces. Computer scientists and programmers will find this text invaluable.

  • An Introduction to Data Base Design

    • 1st Edition
    • Betty Joan Salzberg
    • English
    An Introduction to Data Base Design provides an understanding of how data base management systems (DBMS) work to be able to use any available commercial DBMS intelligently. This book presents the principle of independence of physical and local organization. Organized into seven chapters, this book begins with an overview of normal form theory. This text then describes the three types of DBMS. Other chapters consider the difficulties in processing queries where the names of the files are not mentioned. This book discusses as well how to group data hierarchically, how to use a preorder tree traversal to represent the data, and how to convert a network organization to a hierarchical one. The final chapter deals with four essential issues in data base theory, namely, recovery, security, integrity, and concurrency. This book is a valuable resource for computer science students in the junior or senior year, and people in industry who are doing technical work using data bases.

  • Probabilistic Analysis and Related Topics

    Volume 2
    • 1st Edition
    • A. T. Bharucha-Reid
    • English
    Probabilistic Analysis and Related Topics, Volume 2 focuses on the integrability, continuity, and differentiability of random functions, as well as functional analysis, measure theory, operator theory, and numerical analysis. The selection first offers information on the optimal control of stochastic systems and Gleason measures. Discussions focus on convergence of Gleason measures, random Gleason measures, orthogonally scattered Gleason measures, existence of optimal controls without feedback, random necessary conditions, and Gleason measures in tensor products. The text then elaborates on an introduction to nonstandard analysis and hyperfinite probability theory, including applications to stochastic processes, conversion from nonstandard to standard measure spaces, and an introduction to nonstandard analysis. The text examines stochastic matrices, ergodic Markov chains, and measures on semigroups, as well as limit theorems for convolution products of probability measures on completely simple semigroups; ergodicity of Markov chains and probability measures on semigroups; and limits of convolutions in groups and semigroups. The selection is a dependable source of data for mathematicians and researchers interested in the general theory of random functions.

  • Social Issues in Computing

    • 1st Edition
    • C. C. Gotlieb + 1 more
    • Werner Rheinboldt
    • English
    Social Issues in Computing provides information pertinent to the social implications of technology. This book presents the highly dynamic interaction between computers and society. Organized into 13 chapters, this book begins with an overview of the problems associated with computers and attempts to indicate some of the viewpoints, assumptions, and biases from which the discussion is undertaken. This text then examines in detail the effects of computers on society ad describes the extent of computer use. Other chapters consider the disparities in computer use between various countries, as well as the degree to which various countries are able to share in the market for computer products and services. This book discusses as well the factors that led to the rapid and widespread adoption of computers. The final chapter deals with the effects of automation, computers, and technology. This book is a valuable resource for computer science students and research workers.

  • Rewriting Techniques

    Resolution of Equations in Algebraic Structures
    • 1st Edition
    • Hassan Aït-Kaci + 1 more
    • English
    Resolution of Equations in Algebraic Structures: Volume 2, Rewriting Techniques is a collection of papers dealing with the construction of canonical rewrite systems, constraint handling in logic programming, and completion algorithms for conditional rewriting systems. Papers discuss the Knuth-Bendix completion method which constructs a complete system for a given set of equations, including extensions of the method dealing with termination, unfailing completion, and associative-communic... completion. One paper examines the various practical techniques that can be used to extend Prolog as a constraint solver, particularly on techniques that solve boolean equations, imposing inequality, disequality, and finitary domain constraints on variables. Another paper presents a sufficient condition for confluence of conditional rewriting, and a practical unification algorithm modulo conditional rewriting through the notion of conditional narrowing. One paper analyzes the possibility of using completion for inductive proofs in the initial algebra of an equational variety without explicit induction. Another papers discusses solving systems of word equations in the free monoid and the free group, where a solution is defined as a word homomorphism. Programmers, mathematicians, students, and instructors involved in computer science and computer logic will find this collection valuable.

  • Handbook of Mathematical Formulas

    • 1st Edition
    • Hans-Jochen Bartsch
    • English
    Handbook of Mathematical Formulas presents a compilation of formulas to provide the necessary educational aid. This book covers the whole field from the basic rules of arithmetic, via analytic geometry and infinitesimal calculus through to Fourier's series and the basics of probability calculus. Organized into 12 chapters, this book begins with an overview of the fundamental notions of set theory. This text then explains linear expression wherein the variables are only multiplied by constants and added to constants or expressions of the same kind. Other chapters consider a variety of topics, including matrices, statistics, linear optimization, Boolean algebra, and Laplace's transforms. This book discusses as well the various systems of coordinates in analytical geometry. The final chapter deals with algebra of logic and its development into a two-value Boolean algebra as switching algebra. This book is intended to be suitable for students of technical schools, colleges, and universities.

Related subjects