Significant progress has been made during the last 15 years in the solution of nonlinear systems, particularly in computing fixed points, solving systems of nonlinear equations and applications to equilibrium models. This volume presents a self-contained account of recent work on simplicial and continuation methods applied to the solution of algebraic equations. The contents are divided into eight chapters. Chapters 1 and 2 deal with Kuhn's algorithm. Chapter 3 considers Newton's method, and a comparison between Kuhn's algorithm and Newton's method is presented in Chapter 4. The following four chapters discuss respectively, incremental algorithms and their cost theory, homotopy algorithms, zeros of polynomial mapping, and piecewise linear algorithms. This text is designed for use by researchers and graduates interested in algebraic equations and computational complexity theory.

This proceedings volume convenes selected, peer-reviewed papers presented at the 3rd International Conference on Mathematics and its Applications in Science and Engineering - ICMASE 2022, which was held on July 4-7, 2022 by the Technical University of Civil Engineering of Bucharest, Romania. Works in this volume cover new developments in applications of mathematics in science and engineering, with emphasis on mathematical and computational modeling of real-world problems. Topics range from the use of differential equations to model mechanical structures to the employ of number theory in the development of information security and cryptography. Educational issues specific to the acquisition of mathematical competencies by engineering and science students at all university levels are also touched on. Researchers and university students are the natural audiences for this book, which can be equally appealing to practitioners seeking up-to-date techniques in mathematical applications to different contexts and disciplines.

This is the first of three volumes providing a comprehensive presentation of the fundamentals of scientific computing. This volume discusses basic principles of computation, and fundamental numerical algorithms that will serve as basic tools for the subsequent two volumes. This book and its companions show how to determine the quality of computational results, and how to measure the relative efficiency of competing methods. Readers learn how to determine the maximum attainable accuracy of algorithms, and how to select the best method for computing problems. This book also discusses programming in several languages, including C++, Fortran and MATLAB. There are 80 examples, 324 exercises, 77 algorithms, 35 interactive JavaScript programs, 391 references to software programs and 4 case studies. Topics are introduced with goals, literature references and links to public software. There are descriptions of the current algorithms in LAPACK, GSLIB and MATLAB. This book could be used for an introductory course in numerical methods, for either upper level undergraduates or first year graduate students. Parts of the text could be used for specialized courses, such as principles of computer languages or numerical linear algebra.

Optimal feedback control arises in different areas such as aerospace engineering, chemical processing, resource economics, etc. In this context, the application of dynamic programming techniques leads to the solution of fully nonlinear Hamilton-Jacobi-Bellman equations. This book presents the state of the art in the numerical approximation of Hamilton-Jacobi-Bellman equations, including post-processing of Galerkin methods, high-order methods, boundary treatment in semi-Lagrangian schemes, reduced basis methods, comparison principles for viscosity solutions, max-plus methods, and the numerical approximation of Monge-Ampere equations. This book also features applications in the simulation of adaptive controllers and the control of nonlinear delay differential equations. Contents From a monotone probabilistic scheme to a probabilistic max-plus algorithm for solving Hamilton-Jacobi-Bellman equations Improving policies for Hamilton-Jacobi-Bellman equations by postprocessing Viability approach to simulation of an adaptive controller Galerkin approximations for the optimal control of nonlinear delay differential equations Efficient higher order time discretization schemes for Hamilton-Jacobi-Bellman equations based on diagonally implicit symplectic Runge-Kutta methods Numerical solution of the simple Monge-Ampere equation with nonconvex Dirichlet data on nonconvex domains On the notion of boundary conditions in comparison principles for viscosity solutions Boundary mesh refinement for semi-Lagrangian schemes A reduced basis method for the Hamilton-Jacobi-Bellman equation within the European Union Emission Trading Scheme

Data mining essentially relies on several mathematical disciplines, many of which are presented in this second edition of this book. Topics include partially ordered sets, combinatorics, general topology, metric spaces, linear spaces, graph theory. To motivate the reader a significant number of applications of these mathematical tools are included ranging from association rules, clustering algorithms, classification, data constraints, logical data analysis, etc. The book is intended as a reference for researchers and graduate students. The current edition is a significant expansion of the first edition. We strived to make the book self-contained and only a general knowledge of mathematics is required. More than 700 exercises are included and they form an integral part of the material. Many exercises are in reality supplemental material and their solutions are included.

This monograph collects cutting-edge results and techniques for solving nonlinear partial differential equations using critical points. Including many of the author's own contributions, a range of proofs are conveniently collected here, Because the material is approached with rigor, this book will serve as an invaluable resource for exploring recent developments in this active area of research, as well as the numerous ways in which critical point theory can be applied. Different methods for finding critical points are presented in the first six chapters. The specific situations in which these methods are applicable is explained in detail. Focus then shifts toward the book's main subject: applications to problems in mathematics and physics. These include topics such as Schroedinger equations, Hamiltonian systems, elliptic systems, nonlinear wave equations, nonlinear optics, semilinear PDEs, boundary value problems, and equations with multiple solutions. Readers will find this collection of applications convenient and thorough, with detailed proofs appearing throughout. Critical Point Theory will be ideal for graduate students and researchers interested in solving differential equations, and for those studying variational methods. An understanding of fundamental mathematical analysis is assumed. In particular, the basic properties of Hilbert and Banach spaces are used.

This monograph provides an introduction to the design and analysis of Hybrid High-Order methods for diffusive problems, along with a panel of applications to advanced models in computational mechanics. Hybrid High-Order methods are new-generation numerical methods for partial differential equations with features that set them apart from traditional ones. These include: the support of polytopal meshes, including non-star-shaped elements and hanging nodes; the possibility of having arbitrary approximation orders in any space dimension; an enhanced compliance with the physics; and a reduced computational cost thanks to compact stencil and static condensation. The first part of the monograph lays the foundations of the method, considering linear scalar second-order models, including scalar diffusion - possibly heterogeneous and anisotropic - and diffusion-advection-reaction. The second part addresses applications to more complex models from the engineering sciences: non-linear Leray-Lions problems, elasticity, and incompressible fluid flows. This book is primarily intended for graduate students and researchers in applied mathematics and numerical analysis, who will find here valuable analysis tools of general scope.

This monograph develops adaptive stochastic methods in computational mathematics. The authors discuss the basic ideas of the algorithms and ways to analyze their properties and efficiency. Methods of evaluation of multidimensional integrals and solutions of integral equations are illustrated by multiple examples from mechanics, theory of elasticity, heat conduction and fluid dynamics. Contents Part I: Evaluation of Integrals Fundamentals of the Monte Carlo Method to Evaluate Definite Integrals Sequential Monte Carlo Method and Adaptive Integration Methods of Adaptive Integration Based on Piecewise Approximation Methods of Adaptive Integration Based on Global Approximation Numerical Experiments Adaptive Importance Sampling Method Based on Piecewise Constant Approximation Part II: Solution of Integral Equations Semi-Statistical Method of Solving Integral Equations Numerically Problem of Vibration Conductivity Problem on Ideal-Fluid Flow Around an Airfoil First Basic Problem of Elasticity Theory Second Basic Problem of Elasticity Theory Projectional and Statistical Method of Solving Integral Equations Numerically

This book has been designed for a first course on digital design for engineering and computer science students. It offers an extensive introduction on fundamental theories, from Boolean algebra and binary arithmetic to sequential networks and finite state machines, together with the essential tools to design and simulate systems composed of a controller and a datapath. The numerous worked examples and solved exercises allow a better understanding and more effective learning. All of the examples and exercises can be run on the Deeds software, freely available online on a webpage developed and maintained by the authors. Thanks to the learning-by-doing approach and the plentiful examples, no prior knowledge in electronics of programming is required. Moreover, the book can be adapted to different level of education, with different targets and depth, be used for self-study, and even independently from the simulator. The book draws on the authors' extensive experience in teaching and developing learning materials.

This book contains a selection of the latest research in the field of Computational Social Science (CSS) methods, uses, and results, as presented at the 2018 annual conference of the CSSSA. This conference was held in Santa Fe, New Mexico, October 25 - 28, 2018, at the Drury Plaza Hotel. CSS investigates social and behavioral dynamics in both nature and society, through computer simulation, network analysis, and the science of complex systems. The Computational Social Science Society of the Americas (CSSSA) is a professional society that aims to advance the field of CSS in all its areas, from fundamental principles to real-world applications, by holding conferences and workshops, promoting standards of scientific excellence in research and teaching, and publishing novel research findings. What follows is a diverse representation of new approaches and research findings, using the tools of CSS and Agent-Based Modeling (ABM) in exploring complex phenomena across many different domains. Readers will not only have the methods and results of these specific projects on which to build, but will also gain a greater appreciation for the broad scope of CSS, and have a wealth of case-study examples that can serve as meaningful exemplars for new research projects and activities. This book, we hope, will appeal to any researchers and students working in the social sciences, broadly defined, who aim to better understand and apply the concepts of Complex Adaptive Systems to their work.

This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area. The book covers many of the recent developments of the field, including application of important separators, branching based on linear programming, Cut & Count to obtain faster algorithms on tree decompositions, algorithms based on representative families of matroids, and use of the Strong Exponential Time Hypothesis. A number of older results are revisited and explained in a modern and didactic way. The book provides a toolbox of algorithmic techniques. Part I is an overview of basic techniques, each chapter discussing a certain algorithmic paradigm. The material covered in this part can be used for an introductory course on fixed-parameter tractability. Part II discusses more advanced and specialized algorithmic ideas, bringing the reader to the cutting edge of current research. Part III presents complexity results and lower bounds, giving negative evidence by way of W[1]-hardness, the Exponential Time Hypothesis, and kernelization lower bounds. All the results and concepts are introduced at a level accessible to graduate students and advanced undergraduate students. Every chapter is accompanied by exercises, many with hints, while the bibliographic notes point to original publications and related work.

Written in easy to understand language, this self-explanatory guide introduces the fundamentals of finite element methods and its application to differential equations. Beginning with a brief introduction to Sobolev spaces and elliptic scalar problems, the text progresses through an explanation of finite element spaces and estimates for the interpolation error. The concepts of finite element methods for parabolic scalar parabolic problems, object-oriented finite element algorithms, efficient implementation techniques, and high dimensional parabolic problems are presented in different chapters. Recent advances in finite element methods, including non-conforming finite elements for boundary value problems of higher order and approaches for solving differential equations in high dimensional domains are explained for the benefit of the reader. Numerous solved examples and mathematical theorems are interspersed throughout the text for enhanced learning.

This proceedings volume gathers selected, peer-reviewed papers presented at the 2nd International Conference on Mathematics and its Applications in Science and Engineering - ICMASE 2021, which was virtually held on July 1-2, 2021 by the University of Salamanca, Spain. Works included in this book cover applications of mathematics both in engineering research and in real-world problems, touching topics such as difference equations, number theory, optimization, and more. The list of applications includes the modeling of mechanical structures, the shape of machines, and the growth of a population, expanding to fields like information security and cryptography. Advances in teaching and learning mathematics in the context of engineering courses are also covered.This volume can be of special interest to researchers in applied mathematics and engineering fields, as well as practitioners seeking studies that address real-life problems in engineering.

This book presents a modern continuum mechanics and mathematical framework to study shell physical behaviors, and to formulate and evaluate finite element procedures. With a view towards the synergy that results from physical and mathematical understanding, the book focuses on the fundamentals of shell theories, their mathematical bases and finite element discretizations. The complexity of the physical behaviors of shells is analysed, and the difficulties to obtain uniformly optimal finite element procedures are identified and studied. Some modern finite element methods are presented for linear and nonlinear analyses. In this Second Edition the authors give new developments in the field and - to make the book more complete - more explanations throughout the text, an enlarged section on general variational formulations and new sections on 3D-shell models, dynamic analyses, and triangular elements. The analysis of shells represents one of the most challenging fields in all of mechanics, and encompasses various fundamental and generally applicable components. Specifically, the material presented in this book regarding geometric descriptions, tensors and mixed variational formulations is fundamental and widely applicable also in other areas of mechanics.

This monograph discusses covariant Schroedinger operators and their heat semigroups on noncompact Riemannian manifolds and aims to fill a gap in the literature, given the fact that the existing literature on Schroedinger operators has mainly focused on scalar Schroedinger operators on Euclidean spaces so far. In particular, the book studies operators that act on sections of vector bundles. In addition, these operators are allowed to have unbounded potential terms, possibly with strong local singularities. The results presented here provide the first systematic study of such operators that is sufficiently general to simultaneously treat the natural operators from quantum mechanics, such as magnetic Schroedinger operators with singular electric potentials, and those from geometry, such as squares of Dirac operators that have smooth but endomorphism-valued and possibly unbounded potentials. The book is largely self-contained, making it accessible for graduate and postgraduate students alike. Since it also includes unpublished findings and new proofs of recently published results, it will also be interesting for researchers from geometric analysis, stochastic analysis, spectral theory, and mathematical physics..

This book presents a detailed description of a robust pseudomultigrid algorithm for solving (initial-)boundary value problems on structured grids in a black-box manner. To overcome the problem of robustness, the presented Robust Multigrid Technique (RMT) is based on the application of the essential multigrid principle in a single grid algorithm. It results in an extremely simple, very robust and highly parallel solver with close-to-optimal algorithmic complexity and the least number of problem-dependent components. Topics covered include an introduction to the mathematical principles of multigrid methods, a detailed description of RMT, results of convergence analysis and complexity, possible expansion on unstructured grids, numerical experiments and a brief description of multigrid software, parallel RMT and estimations of speed-up and efficiency of the parallel multigrid algorithms, and finally applications of RMT for the numerical solution of the incompressible Navier Stokes equations. Potential readers are graduate students and researchers working in applied and numerical mathematics as well as multigrid practitioners and software programmers. Contents Introduction to multigrid Robust multigrid technique Parallel multigrid methods Applications of multigrid methods in computational fluid dynamics

An enormous array of problems encountered by scientists and engineersare based on the design of mathematical models using many different types of ordinary differential, partial differential, integral, and integro-differential equations. Accordingly, the solutions of these equations areof great interest to practitioners and to science in general.Presentinga wealthof cutting-edgeresearchbya diverse group ofexperts in the field, "Integral Methods in Science and Engineering: Computational and Analytic Aspects"gives a vivid picture of both the development of theoretical integral techniques and their use in specific science and engineering problems.

This bookwill be valuable for researchers in applied mathematics, physics, and mechanical and electrical engineering. It will likewise be a usefulstudy guideforgraduate students in these disciplines, and for various other professionals who use integration as an essential technique in their work. "

This book is a result of a workshop, the 8th of the successful TopoInVis workshop series, held in 2019 in Nykoeping, Sweden. The workshop regularly gathers some of the world's leading experts in this field. Thereby, it provides a forum for discussions on the latest advances in the field with a focus on finding practical solutions to open problems in topological data analysis for visualization. The contributions provide introductory and novel research articles including new concepts for the analysis of multivariate and time-dependent data, robust computational approaches for the extraction and approximations of topological structures with theoretical guarantees, and applications of topological scalar and vector field analysis for visualization. The applications span a wide range of scientific areas comprising climate science, material sciences, fluid dynamics, and astronomy. In addition, community efforts with respect to joint software development are reported and discussed.

Customer-Oriented Optimization in Public Transportation develops models, results and algorithms for optimizing public transportation from a customer-oriented point of view. The methods used are based on graph-theoretic approaches and integer programming. The specific topics are all motivated by real-world examples which occurred in practical projects. An appendix summarizes some of the basics of optimization needed to interpret the material in the book. In detail, the topics the book covers in its three parts are as follows: Stop location - Does it make sense to open new stations along existing bus or railway lines? If yes, in which locations? The problem is modeled as a continuous covering problem. To solve it, the author develops a finite dominating set and shows that efficient methods are possible if the special structure of the covering matrix is used; Delay management - Should a train wait for delayed feeder trains or should it depart in time?

Before the appearance of broadband links and wireless systems, networks have been used to connect people in new ways. Now, the modern world is connected through large-scale, computational networked systems such as the Internet. Because of the ever-advancing technology of networking, efficient algorithms have become increasingly necessary to solve some of the problems developing in this area.

"Mathematical Aspects of Network Routing Optimization" focuses on computational issues arisingfrom the process of optimizing network routes, such as quality of the resulting links and their reliability. Algorithms are a cornerstone for the understanding of the protocols underlying multicast routing. The main objectivein the text is to deriveefficient algorithms, with or without guarantee of approximation. Notes have been provided for basic topics such as graph theory and linear programming to assist those who are not fully acquainted with the mathematical topics presented throughout the book.

"Mathematical Aspects of Network Routing Optimization" provides a thorough introduction to the subject of algorithms for network routing, and focuses especially on multicast and wireless ad hoc systems. This book is designed for graduate students, researchers, and professionals interested in understanding the algorithmic and mathematical ideas behind routing in computer networks. It is suitable for advanced undergraduate students, graduate students, and researchers in the area of network algorithms."

A Theoretical Introduction to Numerical Analysis presents the general methodology and principles of numerical analysis, illustrating these concepts using numerical methods from real analysis, linear algebra, and differential equations. The book focuses on how to efficiently represent mathematical models for computer-based study.

An accessible yet rigorous mathematical introduction, this book provides a pedagogical account of the fundamentals of numerical analysis. The authors thoroughly explain basic concepts, such as discretization, error, efficiency, complexity, numerical stability, consistency, and convergence. The text also addresses more complex topics like intrinsic error limits and the effect of smoothness on the accuracy of approximation in the context of Chebyshev interpolation, Gaussian quadratures, and spectral methods for differential equations. Another advanced subject discussed, the method of difference potentials, employs discrete analogues of Calderon's potentials and boundary projection operators. The authors often delineate various techniques through exercises that require further theoretical study or computer implementation.

By lucidly presenting the central mathematical concepts of numerical methods, A Theoretical Introduction to Numerical Analysis provides a foundational link to more specialized computational work in fluid dynamics, acoustics, and electromagnetism.

This book offers an introduction to the theory of smooth manifolds, helping students to familiarize themselves with the tools they will need for mathematical research on smooth manifolds and differential geometry. The book primarily focuses on topics concerning differential manifolds, tangent spaces, multivariable differential calculus, topological properties of smooth manifolds, embedded submanifolds, Sard's theorem and Whitney embedding theorem. It is clearly structured, amply illustrated and includes solved examples for all concepts discussed. Several difficult theorems have been broken into many lemmas and notes (equivalent to sub-lemmas) to enhance the readability of the book. Further, once a concept has been introduced, it reoccurs throughout the book to ensure comprehension. Rank theorem, a vital aspect of smooth manifolds theory, occurs in many manifestations, including rank theorem for Euclidean space and global rank theorem. Though primarily intended for graduate students of mathematics, the book will also prove useful for researchers. The prerequisites for this text have intentionally been kept to a minimum so that undergraduate students can also benefit from it. It is a cherished conviction that "mathematical proofs are the core of all mathematical joy," a standpoint this book vividly reflects.

th This volume contains a selection of 41 refereed papers presented at the 18 International Conference of Domain Decomposition Methods hosted by the School of ComputerScience and Engineering(CSE) of the Hebrew Universityof Jerusalem, Israel, January 12-17, 2008. 1 Background of the Conference Series The International Conference on Domain Decomposition Methods has been held in twelve countries throughout Asia, Europe, the Middle East, and North America, beginning in Paris in 1987. Originally held annually, it is now spaced at roughly 18-month intervals. A complete list of past meetings appears below. The principal technical content of the conference has always been mathematical, but the principal motivation has been to make ef cient use of distributed memory computers for complex applications arising in science and engineering. The leading 15 such computers, at the "petascale" characterized by 10 oating point operations per second of processing power and as many Bytes of application-addressablem- ory, now marshal more than 200,000 independentprocessor cores, and systems with many millions of cores are expected soon. There is essentially no alternative to - main decomposition as a stratagem for parallelization at such scales. Contributions from mathematicians, computerscientists, engineers, and scientists are together n- essary in addressing the challenge of scale, and all are important to this conference.

The papers presented here describe research to improve the general understanding of the application of SAMR to practical problems, to identify issues critical to efficient and effective implementation on high performance computers and to stimulate the development of a community code repository for software including benchmarks to assist in the evaluation of software and compiler technologies. The ten chapters have been divided into two parts reflecting two major issues in the topic: programming complexity of SAMR algorithms and the applicability and numerical challenges of SAMR methods.

Quantitative thinking is our inclination to view natural and everyday phenomena through a lens of measurable events, with forecasts, odds, predictions, and likelihood playing a dominant part. The Error of Truth recounts the astonishing and unexpected tale of how quantitative thinking came to be, and its rise to primacy in the nineteenth and early twentieth centuries. Additionally, it considers how seeing the world through a quantitative lens has shaped our perception of the world we live in, and explores the lives of the individuals behind its early establishment. This worldview was unlike anything humankind had before, and it came about because of a momentous human achievement: we had learned how to measure uncertainty. Probability as a science was conceptualised. As a result of probability theory, we now had correlations, reliable predictions, regressions, the bellshaped curve for studying social phenomena, and the psychometrics of educational testing. Significantly, these developments happened during a relatively short period in world history- roughly, the 130-year period from 1790 to 1920, from about the close of the Napoleonic era, through the Enlightenment and the Industrial Revolutions, to the end of World War I. At which time, transportation had advanced rapidly, due to the invention of the steam engine, and literacy rates had increased exponentially. This brief period in time was ready for fresh intellectual activity, and it gave a kind of impetus for the probability inventions. Quantification is now everywhere in our daily lives, such as in the ubiquitous microchip in smartphones, cars, and appliances; in the Bayesian logic of artificial intelligence, as well as applications in business, engineering, medicine, economics, and elsewhere. Probability is the foundation of quantitative thinking. The Error of Truth tells its story- when, why, and how it happened.