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.

  • Iterative Solution of Nonlinear Equations in Several Variables

    • 1st Edition
    • J. M. Ortega + 1 more
    • Werner Rheinboldt
    • English
    Computer Science and Applied Mathematics: Iterative Solution of Nonlinear Equations in Several Variables presents a survey of the basic theoretical results about nonlinear equations in n dimensions and analysis of the major iterative methods for their numerical solution. This book discusses the gradient mappings and minimization, contractions and the continuation property, and degree of a mapping. The general iterative and minimization methods, rates of convergence, and one-step stationary and multistep methods are also elaborated. This text likewise covers the contractions and nonlinear majorants, convergence under partial ordering, and convergence of minimization methods. This publication is a good reference for specialists and readers with an extensive functional analysis background.

  • Numerical Solutions of Boundary Value Problems for Ordinary Differential Equations

    • 1st Edition
    • A.K. Aziz
    • English
    Numerical Solutions of Boundary Value Problems for Ordinary Differential Equations covers the proceedings of the 1974 Symposium by the same title, held at the University of Maryland, Baltimore Country Campus. This symposium aims to bring together a number of numerical analysis involved in research in both theoretical and practical aspects of this field. This text is organized into three parts encompassing 15 chapters. Part I reviews the initial and boundary value problems. Part II explores a large number of important results of both theoretical and practical nature of the field, including discussions of the smooth and local interpolant with small K-th derivative, the occurrence and solution of boundary value reaction systems, the posteriori error estimates, and boundary problem solvers for first order systems based on deferred corrections. Part III highlights the practical applications of the boundary value problems, specifically a high-order finite-difference method for the solution of two-point boundary-value problems on a uniform mesh. This book will prove useful to mathematicians, engineers, and physicists.

  • Nonlinear Programming 4

    Proceedings of the Nonlinear Programming Symposium 4 Conducted by the Computer Sciences Department at the University of Wisconsin–Madison, July 14-16, 1980
    • 1st Edition
    • Olvi L. Mangasarian + 2 more
    • English
    Nonlinear Programming, 4 focuses on linear, quadratic, and nonlinear programming, unconstrained minimization, nonsmooth and discrete optimization, ellipsoidal methods, linear complementarity problems, and software evaluation. The selection first elaborates on an upper triangular matrix method for quadratic programming, solving quadratic programs by an exact penalty function, and QP-based methods for large-scale nonlinearly constrained optimization. Discussions focus on large-scale linearly constrained optimization, search direction for superbasic variables, finite convergence, basic properties, comparison of three active set methods, and QP-based methods for dense problems. The book then examines an iterative linear programming algorithm based on an augmented Lagrangian and iterative algorithms for singular minimization problems. The publication ponders on the derivation of symmetric positive definite secant updates, preconditioned conjugate gradient methods, and finding the global minimum of a function of one variable using the method of constant signed higher order derivatives. Topics include effects of calculation errors, application to polynomial minimization, using moderate additional storage, updating Cholesky factors, and utilizing sparse second order information. The selection is a valuable source of data for researchers interested in nonlinear programming.

  • Nonlinear Differential Equations

    Invariance, Stability, and Bifurcation
    • 1st Edition
    • Piero de Mottoni + 1 more
    • English
    Nonlinear Differential Equations: Invariance, Stability, and Bifurcation presents the developments in the qualitative theory of nonlinear differential equations. This book discusses the exchange of mathematical ideas in stability and bifurcation theory. Organized into 26 chapters, this book begins with an overview of the initial value problem for a nonlinear wave equation. This text then focuses on the interplay between stability exchange for a stationary solution and the appearance of bifurcating periodic orbits. Other chapters consider the development of methods for ascertaining stability and boundedness and explore the development of bifurcation and stability analysis in nonlinear models of applied sciences. This book discusses as well nonlinear hyperbolic equations in further contributions, featuring stability properties of periodic and almost periodic solutions. The reader is also introduced to the stability problem of the equilibrium of a chemical network. The final chapter deals with suitable spaces for studying functional equations. This book is a valuable resource for mathematicians.

  • 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.

  • A Computational Logic Handbook

    Formerly Notes and Reports in Computer Science and Applied Mathematics
    • 1st Edition
    • Robert S. Boyer + 1 more
    • Werner Rheinboldt + 1 more
    • English
    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.

  • Recent Advances in Numerical Analysis

    Proceedings of a Symposium Conducted by the Mathematics Research Center, the University of Wisconsin-Madison, May 22-24, 1978
    • 1st Edition
    • Carl De Boor + 1 more
    • English
    Recent Advances in Numerical Analysis provides information pertinent to the developments in numerical analysis. This book covers a variety of topics, including positive functions, Sobolev spaces, computing paths, partial differential equations, and perturbation theory. Organized into 12 chapters, this book begins with an overview of stability conditions for numerical methods that can be expressed in the form that some associated function is positive. This text then examines the polynomial approximation theory having applications to finite element Galerkin methods. Other chapters consider the numerical condition of polynomials by examining three particular problem areas, namely, the representation of polynomials, algebraic equations, and the problem of orthogonalization. This book discusses as well a general theory that leads to a systematic way to prepare the initial data. The final chapter deals with the derivation of the Kronecker canonical form. This book is a valuable resource for applied mathematicians, numerical analysts, physicists, engineers, and research workers.

  • 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.

  • Modeling of Complex Systems

    An Introduction
    • 1st Edition
    • V. Vemuri
    • J. William Schmidt
    • English
    Modeling of Complex Systems: An Introduction describes the framework of complex systems. This book discusses the language of system theory, taxonomy of system concepts, steps in model building, and establishing relations using physical laws. The statistical attributes of data, generation of random numbers fundamental problems of recognition, and input-output type models are also elaborated. This text likewise covers the optimization with equality constraints, transfer function models, and competition among species. This publication is written primarily for senior undergraduate students and beginning graduate students who are interested in an interdisciplinary or multidisciplinary approach to large-scale or complex problems of contemporary societal interest.

  • Algebraic Techniques

    Resolution of Equations in Algebraic Structures
    • 1st Edition
    • Hassan Aït-Kaci + 1 more
    • English
    Resolution of Equations in Algebraic Structures: Volume 1, Algebraic Techniques is a collection of papers from the "Colloquium on Resolution of Equations in Algebraic Structures" held in Texas in May 1987. The papers discuss equations and algebraic structures relevant to symbolic computation and to the foundation of programming. One paper discusses the complete lattice of simulation congruences associated with the ground atomic theory of hierarchical specification, retrieving as the lattice's maximum element Milner's strong bisimulation for CCS. Another paper explains algebraic recognizability of subsets of free T-algebras, or equational theories, and covers discrete structures like those of words, terms, finite trees, and finite graphs. One paper proposes a general theory of unification using a category theoretic framework for various substitution systems including classical unification, E-unification, and order-sorted unification. Another paper shows the universality of algebraic equations in computer science. Fixpoint theorems in ordered algebraic structures can be applied in computer science. These theorems, or their variations, include semantics and proof theory, logic programming, as well as efficient strategies for answering recursive queries in deductive data bases. The collection is suitable for programmers, mathematicians, students, and instructors involved in computer science and computer technology.

Related subjects