In this popular text for an Numerical Analysis course, the authors introduce several major methods of solving various partial differential equations (PDEs) including elliptic, parabolic, and hyperbolic equations. It covers traditional techniques including the classic finite difference method, finite element method, and state-of-the-art numercial methods.The text uniquely emphasizes both theoretical numerical analysis and practical implementation of the algorithms in MATLAB. This new edition includes a new chapter, Finite Value Method, the presentation has been tightened, new exercises and applications are included, and the text refers now to the latest release of MATLAB. Key Selling Points: A successful textbook for an undergraduate text on numerical analysis or methods taught in mathematics and computer engineering. This course is taught in every university throughout the world with an engineering department or school. Competitive advantage broader numerical methods (including finite difference, finite element, meshless method, and finite volume method), provides the MATLAB source code for most popular PDEs with detailed explanation about the implementation and theoretical analysis. No other existing textbook in the market offers a good combination of theoretical depth and practical source codes.

Amid recent interest in Clifford algebra for dual quaternions as a more suitable method for Computer Graphics than standard matrix algebra, this book presents dual quaternions and their associated Clifford algebras in a new light, accessible to and geared towards the Computer Graphics community. Collating all the associated formulas and theorems in one place, this book provides an extensive and rigorous treatment of dual quaternions, as well as showing how two models of Clifford algebras emerge naturally from the theory of dual quaternions. Each chapter comes complete with a set of exercises to help readers sharpen and practice their knowledge. This book is accessible to anyone with a basic knowledge of quaternion algebra and is of particular use to forward-thinking members of the Computer Graphics community. .

This second volume of Handbook of Automated Reasoning covers topics such as higher-order logic and logical frameworks, higher-order unification and matching, logical frameworks, proof-assistants using dependent type systems, and nonclassical logics.

Iterative methods use successive approximations to obtain more accurate solutions. Iterative Methods and Preconditioners for Systems of Linear Equations presents historical background, derives complete convergence estimates for all methods, illustrates and provides Matlab codes for all methods, and studies and tests all preconditioners first as stationary iterative solvers. This textbook is appropriate for undergraduate and graduate students in need of an overview or of deeper knowledge about iterative methods. It can be used in courses on Advanced Numerical Analysis, Special Topics on Numerical Analysis, Topics on Data Science, Topics on Numerical Optimization, and Topics on Approximation Theory. Scientists and engineers interested in new topics and applications will also find the text useful.

Anyone browsing at the stationery store will see an incredible array of pop-up cards available for any occasion. The workings of pop-up cards and pop-up books can be remarkably intricate. Behind such designs lies beautiful geometry involving the intersection of circles, cones, and spheres, the movements of linkages, and other constructions. The geometry can be modelled by algebraic equations, whose solutions explain the dynamics. For example, several pop-up motions rely on the intersection of three spheres, a computation made every second for GPS location. Connecting the motions of the card structures with the algebra and geometry reveals abstract mathematics performing tangible calculations. Beginning with the nephroid in the 19th-century, the mathematics of pop-up design is now at the frontiers of rigid origami and algorithmic computational complexity. All topics are accessible to those familiar with high-school mathematics; no calculus required. Explanations are supplemented by 140+ figures and 20 animations.

Mathematicians have skills that, if deepened in the right ways, would enable them to use data to answer questions important to them and others, and report those answers in compelling ways. Data science combines parts of mathematics, statistics, computer science. Gaining such power and the ability to teach has reinvigorated the careers of mathematicians. This handbook will assist mathematicians to better understand the opportunities presented by data science. As it applies to the curriculum, research, and career opportunities, data science is a fast-growing field. Contributors from both academics and industry present their views on these opportunities and how to advantage them.

The sequential quadratic hamiltonian (SQH) method is a novel numerical optimization procedure for solving optimal control problems governed by differential models. It is based on the characterisation of optimal controls in the framework of the Pontryagin maximum principle (PMP). The SQH method is a powerful computational methodology that is capable of development in many directions. The Sequential Quadratic Hamiltonian Method: Solving Optimal Control Problems discusses its analysis and use in solving nonsmooth ODE control problems, relaxed ODE control problems, stochastic control problems, mixed-integer control problems, PDE control problems, inverse PDE problems, differential Nash game problems, and problems related to residual neural networks. This book may serve as a textbook for undergraduate and graduate students, and as an introduction for researchers in sciences and engineering who intend to further develop the SQH method or wish to use it as a numerical tool for solving challenging optimal control problems and for investigating the Pontryagin maximum principle on new optimisation problems. Feature Provides insight into mathematical and computational issues concerning optimal control problems, while discussing many differential models of interest in different disciplines. Suitable for undergraduate and graduate students and as an introduction for researchers in sciences and engineering. Accompanied by codes which allow the reader to apply the SQH method to solve many different optimal control and optimisation problems

Congruences are ubiquitous in computer science, engineering, mathematics, and related areas. Developing techniques for finding (the number of) solutions of congruences is an important problem. But there are many scenarios in which we are interested in only a subset of the solutions; in other words, there are some restrictions. What do we know about these restricted congruences, their solutions, and applications? This book introduces the tools that are needed when working on restricted congruences and then systematically studies a variety of restricted congruences. Restricted Congruences in Computing defines several types of restricted congruence, obtains explicit formulae for the number of their solutions using a wide range of tools and techniques, and discusses their applications in cryptography, information security, information theory, coding theory, string theory, quantum field theory, parallel computing, artificial intelligence, computational biology, discrete mathematics, number theory, and more. This is the first book devoted to restricted congruences and their applications. It will be of interest to graduate students and researchers across computer science, electrical engineering, and mathematics.

Topos Theory is an important branch of mathematical logic of interest to theoretical computer scientists, logicians and philosophers who study the foundations of mathematics, and to those working in differential geometry and continuum physics. This compendium contains material that was previously available only in specialist journals. This is likely to become the standard reference work for all those interested in the subject.

Electric power systems have become much more complex in the past years, due to the integration of distributed generation including renewable energy sources and the challenges caused by intermittency of renewables. This complexity makes power systems potentially more vulnerable. However, use of computer-based protection methods (i.e., digital protection relays) supported by communication technology have helped in protecting electrical networks from faults to which they are subjected to. This second edition of the book covers a comprehensive introduction to the protection of electrical power systems using digital protective relays. The new edition offers a thorough revision and update, and comprehensive additional material. Chapters treat the mathematical background of protection algorithms including, sinusoidal-wave-based algorithms, Walsh function and S-Transform-based techniques, least squares and differential equation-based techniques, travelling wave-based protection, protection of transformers, digital line differential protection, a comparison between digital protection algorithms, and importantly, protection of networks with distributed generation including renewable energy resources. The book is written for researchers in electrical engineering and power engineering, in industry, utilities and universities, and for advanced students. The treatment is logically structured, covering mathematics and principles for the development and implementation of the major algorithms underlying different protection techniques. These techniques can be applied to protection of generator transformers, lines, switchgear and cable circuits: the main components of transmission and distribution systems with and without integrated distributed energy sources including renewables.

A more accessible approach than most competitor texts, which move into advanced, research-level topics too quickly for today's students. Part I is comprehensive in providing all necessary mathematical underpinning, particularly for those who need more opportunity to develop their mathematical competence. More confident students may move directly to Part II and dip back into Part I as a reference. Ideal for use as an introductory text for courses in quantum computing. Fully worked examples illustrate the application of mathematical techniques. Exercises throughout develop concepts and enhance understanding. End-of-chapter exercises offer more practice in developing a secure foundation.

A best-seller in its French edition, the construction of this book is original and its success in the French market demonstrates its appeal. It is based on three principles: 1. An organization of the chapters by families of algorithms : exhaustive search, divide and conquer, etc. At the contrary, there is no chapter only devoted to a systematic exposure of, say, algorithms on strings. Some of these will be found in different chapters. 2. For each family of algorithms, an introduction is given to the mathematical principles and the issues of a rigorous design, with one or two pedagogical examples. 3. For its most part, the book details 150 problems, spanning on seven families of algorithms. For each problem, a precise and progressive statement is given. More important, a complete solution is detailed, with respect to the design principles that have been presented ; often, some classical errors are pointed at. Roughly speaking, two thirds of the book are devoted to the detailed rational construction of the solutions.

Advanced Problem Solving Using Maple (TM): Applied Mathematics, Operations Research, Business Analytics, and Decision Analysis applies the mathematical modeling process by formulating, building, solving, analyzing, and criticizing mathematical models. Scenarios are developed within the scope of the problem-solving process. The text focuses on discrete dynamical systems, optimization techniques, single-variable unconstrained optimization and applied problems, and numerical search methods. Additional coverage includes multivariable unconstrained and constrained techniques. Linear algebra techniques to model and solve problems such as the Leontief model, and advanced regression techniques including nonlinear, logistics, and Poisson are covered. Game theory, the Nash equilibrium, and Nash arbitration are also included. Features: The text's case studies and student projects involve students with real-world problem solving Focuses on numerical solution techniques in dynamical systems, optimization, and numerical analysis The numerical procedures discussed in the text are algorithmic and iterative Maple is utilized throughout the text as a tool for computation and analysis All algorithms are provided with step-by-step formats About the Authors: William P. Fox is an emeritus professor in the Department of Defense Analysis at the Naval Postgraduate School. Currently, he is an adjunct professor, Department of Mathematics, the College of William and Mary. He received his PhD at Clemson University and has many publications and scholarly activities including twenty books and over one hundred and fifty journal articles. William C. Bauldry, Prof. Emeritus and Adjunct Research Prof. of Mathematics at Appalachian State University, received his PhD in Approximation Theory from Ohio State. He has published many papers on pedagogy and technology, often using Maple, and has been the PI of several NSF-funded projects incorporating technology and modeling into math courses. He currently serves as Associate Director of COMAP's Math Contest in Modeling (MCM).

This book surveys some of the important research work carried out by Indian scientists in the field of pure and applied probability, quantum probability, quantum scattering theory, group representation theory and general relativity. It reviews the axiomatic foundations of probability theory by A.N. Kolmogorov and how the Indian school of probabilists and statisticians used this theory effectively to study a host of applied probability and statistics problems like parameter estimation, convergence of a sequence of probability distributions, and martingale characterization of diffusions. It will be an important resource to students and researchers of Physics and Engineering, especially those working with Advanced Probability and Statistics.

This book covers a variety of problems, and offers solutions to some, in: Statistical state and parameter estimation in nonlinear stochastic dynamical system in both the classical and quantum scenarios Propagation of electromagnetic waves in a plasma as described by the Boltzmann Kinetic Transport Equation Classical and Quantum General Relativity It will be of use to Engineering undergraduate students interested in analysing the motion of robots subject to random perturbation, and also to research scientists working in Quantum Filtering.

This book is for graduate students and researchers, introducing modern foundational research in mathematics, computer science, and philosophy from an interdisciplinary point of view. Its scope includes Predicative Foundations, Constructive Mathematics and Type Theory, Computation in Higher Types, Extraction of Programs from Proofs, and Algorithmic Aspects in Financial Mathematics. By filling the gap between (under-)graduate level textbooks and advanced research papers, the book gives a scholarly account of recent developments and emerging branches of the aforementioned fields.

Practical Mathematical Cryptography provides a clear and accessible introduction to practical mathematical cryptography. Cryptography, both as a science and as practice, lies at the intersection of mathematics and the science of computation, and the presentation emphasises the essential mathematical nature of the computations and arguments involved in cryptography. Cryptography is also a practical science, and the book shows how modern cryptography solves important practical problems in the real world, developing the theory and practice of cryptography from the basics to secure messaging and voting. The presentation provides a unified and consistent treatment of the most important cryptographic topics, from the initial design and analysis of basic cryptographic schemes towards applications. Features Builds from theory toward practical applications Suitable as the main text for a mathematical cryptography course Focus on secure messaging and voting systems.

This book discusses the Sliding Mode Control (SMC) problems of networked control systems (NCSs) under various communication protocols including static/dynamic/periodic event-triggered mechanism, and stochastic communication, Round-Robin, weighted try-once-discard, multiple-packet transmission, and the redundant channel transmission protocol. The super-twisting algorithm and the extended-state-observer-based SMC scheme are described in this book for suppressing chattering. Besides, the SMC designs for two-dimensional (1-D) and two-dimensional (2-D) NCSs are illustrated as well. Features: Captures recent advances of theories, techniques, and applications of networked sliding mode control from an engineering-oriented perspective. Includes new design ideas and optimization techniques of networked sliding mode control theory. Provides advanced tools to apply networked sliding mode control techniques in the practical applications. Discusses some new tools to the engineering applications while dealing with the model uncertainties and external disturbances. This book aims at Researchers and professionals in Control Systems, Computer Networks, Internet of Things, and Communication Systems.

This book introduces machine learning for readers with some background in basic linear algebra, statistics, probability, and programming. In a coherent statistical framework it covers a selection of supervised machine learning methods, from the most fundamental (k-NN, decision trees, linear and logistic regression) to more advanced methods (deep neural networks, support vector machines, Gaussian processes, random forests and boosting), plus commonly-used unsupervised methods (generative modeling, k-means, PCA, autoencoders and generative adversarial networks). Careful explanations and pseudo-code are presented for all methods. The authors maintain a focus on the fundamentals by drawing connections between methods and discussing general concepts such as loss functions, maximum likelihood, the bias-variance decomposition, ensemble averaging, kernels and the Bayesian approach along with generally useful tools such as regularization, cross validation, evaluation metrics and optimization methods. The final chapters offer practical advice for solving real-world supervised machine learning problems and on ethical aspects of modern machine learning.

This book discusses an important area of numerical optimization, called interior-point method. This topic has been popular since the 1980s when people gradually realized that all simplex algorithms were not convergent in polynomial time and many interior-point algorithms could be proved to converge in polynomial time. However, for a long time, there was a noticeable gap between theoretical polynomial bounds of the interior-point algorithms and efficiency of these algorithms. Strategies that were important to the computational efficiency became barriers in the proof of good polynomial bounds. The more the strategies were used in algorithms, the worse the polynomial bounds became. To further exacerbate the problem, Mehrotra's predictor-corrector (MPC) algorithm (the most popular and efficient interior-point algorithm until recently) uses all good strategies and fails to prove the convergence. Therefore, MPC does not have polynomiality, a critical issue with the simplex method. This book discusses recent developments that resolves the dilemma. It has three major parts. The first, including Chapters 1, 2, 3, and 4, presents some of the most important algorithms during the development of the interior-point method around the 1990s, most of them are widely known. The main purpose of this part is to explain the dilemma described above by analyzing these algorithms' polynomial bounds and summarizing the computational experience associated with them. The second part, including Chapters 5, 6, 7, and 8, describes how to solve the dilemma step-by-step using arc-search techniques. At the end of this part, a very efficient algorithm with the lowest polynomial bound is presented. The last part, including Chapters 9, 10, 11, and 12, extends arc-search techniques to some more general problems, such as convex quadratic programming, linear complementarity problem, and semi-definite programming.

An Image Processing Tour of College Mathematics aims to provide meaningful context for reviewing key topics of the college mathematics curriculum, to help students gain confidence in using concepts and techniques of applied mathematics, to increase student awareness of recent developments in mathematical sciences, and to help students prepare for graduate studies. The topics covered include a library of elementary functions, basic concepts of descriptive statistics, probability distributions of functions of random variables, definitions and concepts behind first- and second-order derivatives, most concepts and techniques of traditional linear algebra courses, an introduction to Fourier analysis, and a variety of discrete wavelet transforms - all of that in the context of digital image processing. Features Pre-calculus material and basic concepts of descriptive statistics are reviewed in the context of image processing in the spatial domain. Key concepts of linear algebra are reviewed both in the context of fundamental operations with digital images and in the more advanced context of discrete wavelet transforms. Some of the key concepts of probability theory are reviewed in the context of image equalization and histogram matching. The convolution operation is introduced painlessly and naturally in the context of naive filtering for denoising and is subsequently used for edge detection and image restoration. An accessible elementary introduction to Fourier analysis is provided in the context of image restoration. Discrete wavelet transforms are introduced in the context of image compression, and the readers become more aware of some of the recent developments in applied mathematics. This text helps students of mathematics ease their way into mastering the basics of scientific computer programming.

Features contributions from thought leaders across academia, industry, and government Focuses on novel algorithms and practical applications

This is an introductory single-term numerical analysis text with a modern scientific computing flavor. It offers an immediate immersion in numerical methods featuring an up-to-date approach to computational matrix algebra and an emphasis on methods used in actual software packages, always highlighting how hardware concerns can impact the choice of algorithm. It fills the need for a text that is mathematical enough for a numerical analysis course yet applied enough for students of science and engineering taking it with practical need in mind. The standard methods of numerical analysis are rigorously derived with results stated carefully and many proven. But while this is the focus, topics such as parallel implementations, the Basic Linear Algebra Subroutines, halfto quadruple-precision computing, and other practical matters are frequently discussed as well. Prior computing experience is not assumed. Optional MATLAB subsections for each section provide a comprehensive self-taught tutorial and also allow students to engage in numerical experiments with the methods they have just read about. The text may also be used with other computing environments. This new edition offers a complete and thorough update. Parallel approaches, emerging hardware capabilities, computational modeling, and data science are given greater weight.

Provides guidance on performance enhancement and reliability of IC chips. Provides a detailed hybrid optimization strategy for the optimal arrangement of IC chips on a board. The MATLAB program for the hybrid optimization strategy along with its stability analysis is carried out in a detailed manner.

- New advancements of fractal analysis with applications to many scientific, engineering, and societal issues - Recent changes and challenges of fractal geometry with the rapid advancement of technology - Attracted chapters on novel theory and recent applications of fractals. - Offers recent findings, modelling and simulations of fractal analysis from eminent institutions across the world - Analytical innovations of fractal analysis - Edited collection with a variety of viewpoints