Skip to main content
View Cart

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.

  • Geometric Measure Theory

    A Beginner's Guide
    • 1st Edition
    • Frank Morgan
    • English
    Geometric Measure Theory: A Beginner's Guide provides information pertinent to the development of geometric measure theory. This book presents a few fundamental arguments and a superficial discussion of the regularity theory. Organized into 12 chapters, this book begins with an overview of the purpose and fundamental concepts of geometric measure theory. This text then provides the measure-theoretic foundation, including the definition of Hausdorff measure and covering theory. Other chapters consider the m-dimensional surfaces of geometric measure theory called rectifiable sets and introduce the two basic tools of the regularity theory of area-minimizing surfaces. This book discusses as well the fundamental theorem of geometric measure theory, which guarantees solutions to a wide class of variational problems in general dimensions. The final chapter deals with the basic methods of geometry and analysis in a generality that embraces manifold applications. This book is a valuable resource for graduate students, mathematicians, and research workers.

  • Random Polynomials

    Probability and Mathematical Statistics: A Series of Monographs and Textbooks
    • 1st Edition
    • A. T. Bharucha-Reid + 1 more
    • Z. W. Brinbaum + 1 more
    • English
    Probability and Mathematical Statistics: A Series of Monographs and Textbooks: Random Polynomials focuses on a comprehensive treatment of random algebraic, orthogonal, and trigonometric polynomials. The publication first offers information on the basic definitions and properties of random algebraic polynomials and random matrices. Discussions focus on Newton's formula for random algebraic polynomials, random characteristic polynomials, measurability of the zeros of a random algebraic polynomial, and random power series and random algebraic polynomials. The text then elaborates on the number and expected number of real zeros of random algebraic polynomials; number and expected number of real zeros of other random polynomials; and variance of the number of real zeros of random algebraic polynomials. Topics include the expected number of real zeros of random orthogonal polynomials and the number and expected number of real zeros of trigonometric polynomials. The book takes a look at convergence and limit theorems for random polynomials and distribution of the zeros of random algebraic polynomials, including limit theorems for random algebraic polynomials and random companion matrices and distribution of the zeros of random algebraic polynomials. The publication is a dependable reference for probabilists, statisticians, physicists, engineers, and economists.

  • Fixed Points

    Algorithms and Applications
    • 1st Edition
    • Stepan Karamardian
    • English
    Fixed Points: Algorithms and Applications covers the proceedings of the First International Conference on Computing Fixed Points with Applications, held in the Department of Mathematical Sciences at Clemson University, Clemson, South Carolina on June 26-28, 1974. This book is composed of 21 chapters and starts with reviews of finding roots of polynomials by pivoting procedures and the relations between convergence and labeling in approximation algorithm. The next chapters deal with the principles of complementary pivot theory and the Markovian decision chains; the method of continuation for Brouwer fixed point calculation; a fixed point approach to stability in cooperative games; and computation of fixed points in a nonconvex region. Other chapters discuss a computational comparison of fixed point algorithms, the fundamentals of union jack triangulations, and some aspects of Mann’s iterative method for approximating fixed points. The final chapters consider the application of fixed point algorithms to the analysis of tax policies and the pricing for congestion in telephone networks. This book will prove useful to mathematicians, computer scientists, and advance mathematics students.

  • Surveys in Applied Mathematics

    Essays Dedicated to S.M. Ulam
    • 1st Edition
    • N. Metropolis + 2 more
    • English
    Surveys in Applied Mathematics: Essays Dedicated to S.M. Ulam covers the proceedings of the First Los Alamos Symposium on Mathematics in the Natural Sciences. The book focuses on the processes, principles, methodologies, and applications of mathematics in the natural sciences. The selection first offers information on the role of applied mathematics, shape of a curve, and biased versus unbiased estimation. Discussions focus on the James-Stein estimator, automorphic forms and Poincaré series, Poincaré metrics, Schottky space and augmented Schottky space, and Schottky groups and Riemann surfaces. The text then examines algorithms, Whitney numbers of geometric lattices, and continued fraction expansion of algebraic numbers. The book takes a look at bifurcations in reaction-diffusion problems, survey of some finite element methods proposed for treating the Dirichlet problem, and mathematics of quantum fields. Topics include Dirichlet problem, chemical waves and reaction-diffusion equations, and bifurcation theorems. The text then ponders on almost periodic behavior of nonlinear waves, turbulence theory, and renormalization group methods. The selection is a valuable source of information for mathematicians and researchers interested in applied mathematics.

  • Calculus

    • 3rd Edition
    • Stanley I. Grossman
    • English
    Calculus, Third Edition emphasizes the techniques and theorems of calculus, including many applied examples and exercises in both drill and applied-type problems. This book discusses shifting the graphs of functions, derivative as a rate of change, derivative of a power function, and theory of maxima and minima. The area between two curves, differential equations of exponential growth and decay, inverse hyperbolic functions, and integration of rational functions are also elaborated. This text likewise covers the fluid pressure, ellipse and translation of axes, graphing in polar coordinates, proof of l'Hôpital's rule, and approximation using Taylor polynomials. Other topics include the rectangular coordinate system in space, higher-order partial derivatives, line integrals in space, and vibratory motion. This publication is valuable to students taking calculus.

  • On the Cauchy Problem

    • 1st Edition
    • Sigeru Mizohata
    • William F. Ames
    • English
    Notes and Reports in Mathematics in Science and Engineering, Volume 3: On the Cauchy Problem focuses on the processes, methodologies, and mathematical approaches to Cauchy problems. The publication first elaborates on evolution equations, Lax-Mizohata theorem, and Cauchy problems in Gevrey class. Discussions focus on fundamental proposition, proof of theorem 4, Gevrey property in t of solutions, basic facts on pseudo-differential, and proof of theorem 3. The book then takes a look at micro-local analysis in Gevrey class, including proof and consequences of theorem 1. The manuscript examines Schrödinger type equations, as well as general view-points on evolution equations. Numerical representations and analyses are provided in the explanation of these type of equations. The book is a valuable reference for mathematicians and researchers interested in the Cauchy problem.

  • From Pixels to Animation

    An Introduction to Graphics Programming
    • 1st Edition
    • James Alan Farrell
    • English
    From Pixels to Animation: An Introduction to Graphics Programming deals with the C programming language, particularly for the Borland C and Microsoft C languages. The book reviews the basics of graphics programming, including graphics hardware, graphs, charts, changing colors, 3D graphics, high level functions provided by Borland and Microsoft C. The text also explains low-level graphics, getting around the limitations of standard, graphics libraries, SVGA programming, and creating graphics functions. Advanced topics include linear transformations, ray tracing, and fractals. The book explains in detail the aspect ratio of pixels (length of the pixel dot divided by its width), pixel colors, line styles, and the functions to create the graphic. The text also describes the presentation of a three-dimensional object by using perspective, shading, and texturing. Between the operating system, which carries out the instruction of the program, and the hardware, which displays the output of the program, is the Basic Input/Output Services (BIOS). The BIOS is a set of routine instruction inside the different parts or hardware devices in the computer. The book explains programing animation effects by utilizing routines provided by Microsoft or Borland. The text also notes that a programmer can create good animation effects by directly addressing the graphics adapter, bypassing the BIOS or the high-level routines created by Microsoft or Borland. The book is suitable for beginning programmers, computer science, operators, animators, and artists involved with computer aided designs.

  • Iterative Solution of Large Linear Systems

    • 1st Edition
    • David M. Young
    • Werner Rheinboldt
    • English
    Iterative Solution of Large Linear Systems describes the systematic development of a substantial portion of the theory of iterative methods for solving large linear systems, with emphasis on practical techniques. The focal point of the book is an analysis of the convergence properties of the successive overrelaxation (SOR) method as applied to a linear system where the matrix is "consistently ordered". Comprised of 18 chapters, this volume begins by showing how the solution of a certain partial differential equation by finite difference methods leads to a large linear system with a sparse matrix. The next chapter reviews matrix theory and the properties of matrices, as well as several theorems of matrix theory without proof. A number of iterative methods, including the SOR method, are then considered. Convergence theorems are also given for various iterative methods under certain assumptions on the matrix A of the system. Subsequent chapters deal with the eigenvalues of the SOR method for consistently ordered matrices; the optimum relaxation factor; nonstationary linear iterative methods; and semi-iterative methods. This book will be of interest to students and practitioners in the fields of computer science and applied mathematics.

  • Control Theory of Systems Governed by Partial Differential Equations

    • 1st Edition
    • A.K. Aziz + 2 more
    • English
    Control Theory of Systems Governed by Partial Differential Equations covers the proceedings of the 1976 Conference by the same title, held at the Naval Surface Weapons Center, Silver Spring, Maryland. The purpose of this conference is to examine the control theory of partial differential equations and its application. This text is divided into five chapters that primarily focus on tutorial lecture series on the theory of optimal control of distributed systems. It describes the many manifestations of the theory and its applications appearing in the other chapters. This work also presents the principles of the duality and asymptotic methods in control theory, including the variational principle for the heat equation. A chapter highlights systems that are not of the linear quadratic type. This chapter also explores the control of free surfaces and the geometrical control variables. The last chapter provides a summary of the features and applications of the numerical approximation of problems of optimal control. This book will prove useful to mathematicians, engineers, and researchers.

  • The Mathematical Theory of Coding

    • 1st Edition
    • Ian F. Blake + 1 more
    • English
    The Mathematical Theory of Coding focuses on the application of algebraic and combinatoric methods to the coding theory, including linear transformations, vector spaces, and combinatorics. The publication first offers information on finite fields and coding theory and combinatorial constructions and coding. Discussions focus on self-dual and quasicyclic codes, quadratic residues and codes, balanced incomplete block designs and codes, bounds on code dictionaries, code invariance under permutation groups, and linear transformations of vector spaces over finite fields. The text then takes a look at coding and combinatorics and the structure of semisimple rings. Topics include structure of cyclic codes and semisimple rings, group algebra and group characters, rings, ideals, and the minimum condition, chains and chain groups, dual chain groups, and matroids, graphs, and coding. The book ponders on group representations and group codes for the Gaussian channel, including distance properties of group codes, initial vector problem, modules, group algebras, andrepresentations, orthogonality relationships and properties of group characters, and representation of groups. The manuscript is a valuable source of data for mathematicians and researchers interested in the mathematical theory of coding.

Related subjects