The Distributed and Unified Numerics Environment (Dune) is a set of open-source C++ libraries for the implementation of finite element and finite volume methods. Over the last 15 years it has become one of the most commonly used libraries for the implementation of new, efficient simulation methods in science and engineering. Describing the main Dune libraries in detail, this book covers access to core features like grids, shape functions, and linear algebra, but also higher-level topics like function space bases and assemblers. It includes extensive information on programmer interfaces, together with a wealth of completed examples that illustrate how these interfaces are used in practice. After having read the book, readers will be prepared to write their own advanced finite element simulators, tapping the power of Dune to do so.

This book is intended to be a useful contribution for the modern teaching of applied mathematics, educating Industrial Mathematicians that will meet the growing demand for such experts. It covers many applications where mathematics play a fundamental role, from biology, telecommunications, medicine, physics, finance and industry. It is presented in such a way that can be useful in Modelation, Simulation and Optimization courses, targeting master and PhD students. Its content is based on many editions from the successful series of Modelling Weeks organized by the European Consortium of Mathematics in Industry (ECMI). Each chapter addresses a particular problem, and is written in a didactic way, providing the description of the problem, the particular way of approaching it and the proposed solution, along with the results obtained.

This volume presents a systematic and unified treatment of Leray-Schauder continuation theorems in nonlinear analysis. In particular, fixed point theory is established for many classes of maps, such as contractive, non-expansive, accretive, and compact maps, to name but a few. This book also presents coincidence and multiplicity results. Many applications of current interest in the theory of nonlinear differential equations are presented to complement the theory. The text is essentially self-contained, so it may also be used as an introduction to topological methods in nonlinear analysis. This volume will appeal to graduate students and researchers in mathematical analysis and its applications.

This book paints a fresco of the field of extrapolation and rational approximation over the last several centuries to the present through the works of their primary contributors. It can serve as an introduction to the topics covered, including extrapolation methods, Pade approximation, orthogonal polynomials, continued fractions, Lanczos-type methods etc.; it also provides in depth discussion of the many links between these subjects. A highlight of this book is the presentation of the human side of the fields discussed via personal testimonies from contemporary researchers, their anecdotes, and their exclusive remembrances of some of the "actors." This book shows how research in this domain started and evolved. Biographies of other scholars encountered have also been included. An important branch of mathematics is described in its historical context, opening the way to new developments. After a mathematical introduction, the book contains a precise description of the mathematical landscape of these fields spanning from the 19th century to the first part of the 20th. After an analysis of the works produced after that period (in particular those of Richardson, Aitken, Shanks, Wynn, and others), the most recent developments and applications are reviewed.

This book presents a comprehensive mathematical and computational approach for solving electromagnetic problems of practical relevance, such as electromagnetic scattering and the cavity problems. After an in-depth introduction to the mathematical foundations of isogeometric analysis, which discusses how to conduct higher-order simulations efficiently and without the introduction of geometrical errors, the book proves quasi-optimal approximation properties for all trace spaces of the de Rham sequence, and demonstrates inf-sup stability of the isogeometric discretisation of the electric field integral equation (EFIE). Theoretical properties and algorithms are described in detail. The algorithmic approach is, in turn, validated through a series of numerical experiments aimed at solving a set of electromagnetic scattering problems. In the last part of the book, the boundary element method is combined with a novel eigenvalue solver, a so-called contour integral method. An algorithm is presented, together with a set of successful numerical experiments, showing that the eigenvalue solver benefits from the high orders of convergence offered by the boundary element approach. Last, the resulting software, called BEMBEL (Boundary Element Method Based Engineering Library), is reviewed: the user interface is presented, while the underlying design considerations are explained in detail. Given its scope, this book bridges an important gap between numerical analysis and engineering design of electromagnetic devices.

The book introduces modern high-order methods for computational fluid dynamics. As compared to low order finite volumes predominant in today's production codes, higher order discretizations significantly reduce dispersion errors, the main source of error in long-time simulations of flow at higher Reynolds numbers. A major goal of this book is to teach the basics of the discontinuous Galerkin (DG) method in terms of its finite volume and finite element ingredients. It also discusses the computational efficiency of high-order methods versus state-of-the-art low order methods in the finite difference context, given that accuracy requirements in engineering are often not overly strict. The book mainly addresses researchers and doctoral students in engineering, applied mathematics, physics and high-performance computing with a strong interest in the interdisciplinary aspects of computational fluid dynamics. It is also well-suited for practicing computational engineers who would like to gain an overview of discontinuous Galerkin methods, modern algorithmic realizations, and high-performance implementations.

This book compiles recent developments on sliding mode control theory and its applications. Each chapter presented in the book proposes new dimension in the sliding mode control theory such as higher order sliding mode control, event triggered sliding mode control, networked control, higher order discrete-time sliding mode control and sliding mode control for multi-agent systems. Special emphasis has been given to practical solutions to design involving new types of sliding mode control. This book is a reference guide for graduate students and researchers working in the domain for designing sliding mode controllers. The book is also useful to professional engineers working in the field to design robust controllers for various applications.

This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains. After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theory can help refine some of these computability questions. Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.

Matrix Analysis and Computations introduces the basics of matrix analysis and presents representative methods and their corresponding theories in matrix computations. In this textbook, readers will find: The matrix theory necessary for direct and iterative methods for solving systems of linear equations. Systematic methods and rigorous theory on matrix splitting iteration methods and Krylov subspace iteration methods. Current results on preconditioning and iterative methods for solving standard and generalized saddle-point linear systems. Exercises at the end of each chapter for applying learned methods. This book is intended for graduate students, researchers, and engineers interested in matrix analysis and matrix computations. It is appropriate for the following courses: Advanced Numerical Analysis, Special Topics on Numerical Analysis, Topics on Data Science, Topics on Numerical Optimization, and Topics on Approximation Theory.

This title presents a systematic treatment of results on the theory and numerical analysis of the Navier-Stokes equations for viscous incompressible fluids. Considered are the linearized stationary case, the nonlinear stationary case, and the full nonlinear time-dependent case. The relevant mathematical tools are introduced at each stage The new material in this book is Appendix III, reproducing a survey article written in 1998. This appendix contains aspects not addressed in the earlier editions, in particular a short derivation of the Navier-Stokes equations from the basic conservation principles in continuum mechanics, further historical perspectives, and indications on new developments in the area. The appendix also surveys some aspects of the related Euler equations and the compressible Navier-Stokes equations. Readers are advised to peruse this before reading the core of the book.

This monograph is devoted to a new class of non-commutative rings, skew Poincare-Birkhoff-Witt (PBW) extensions. Beginning with the basic definitions and ring-module theoretic/homological properties, it goes on to investigate finitely generated projective modules over skew PBW extensions from a matrix point of view. To make this theory constructive, the theory of Groebner bases of left (right) ideals and modules for bijective skew PBW extensions is developed. For example, syzygies and the Ext and Tor modules over these rings are computed. Finally, applications to some key topics in the noncommutative algebraic geometry of quantum algebras are given, including an investigation of semi-graded Koszul algebras and semi-graded Artin-Schelter regular algebras, and the noncommutative Zariski cancellation problem. The book is addressed to researchers in noncommutative algebra and algebraic geometry as well as to graduate students and advanced undergraduate students.

This book offers a compact primer on advanced numerical flux functions in computational fluid dynamics (CFD). It comprehensively introduces readers to methods used at the forefront of compressible flow simulation research. Further, it provides a comparative evaluation of the methods discussed, helping readers select the best numerical flux function for their specific needs. The first two chapters of the book reviews finite volume methods and numerical functions, before discussing issues commonly encountered in connection with each. The third and fourth chapter, respectively, address numerical flux functions for ideal gases and more complex fluid flow cases- multiphase flows, supercritical fluids and magnetohydrodynamics. In closing, the book highlights methods that provide high levels of accuracy. The concise content provides an overview of recent advances in CFD methods for shockwaves. Further, it presents the author's insights into the advantages and disadvantages of each method, helping readers implement the numerical methods in their own research.

This book explores various intelligent algorithms including evolutionary algorithms, swarm intelligence-based algorithms for analysis and control of dynamical systems. Both single-input-single-output (SISO) and multi-input-multi-output (MIMO) systems are explored for analysis and control purposes. The applications of intelligent algorithm vary from approximation to optimal control design. The applications of intelligent algorithms not only improve understanding of a dynamical system but also enhance the control efficacy. The intelligent algorithms are now readily applied to all fields of control including linear control, nonlinear control, digital control, optimal control, etc. The book also discusses the main benefits attained due to the application of algorithms to analyze and control.

Haskell is a purely functional language that allows programmers to rapidly develop clear, concise, and correct software. The language has grown in popularity in recent years, both in teaching and in industry. This book is based on the author's experience of teaching Haskell for more than twenty years. All concepts are explained from first principles and no programming experience is required, making this book accessible to a broad spectrum of readers. While Part I focuses on basic concepts, Part II introduces the reader to more advanced topics. This new edition has been extensively updated and expanded to include recent and more advanced features of Haskell, new examples and exercises, selected solutions, and freely downloadable lecture slides and example code. The presentation is clean and simple, while also being fully compliant with the latest version of the language, including recent changes concerning applicative, monadic, foldable, and traversable types.

These are the proceedings of the 25th International Conference on Domain Decomposition Methods in Science and Engineering, which was held in St. John's, Newfoundland, Canada in July 2018. Domain decomposition methods are iterative methods for solving the often very large systems of equations that arise when engineering problems are discretized, frequently using finite elements or other modern techniques. These methods are specifically designed to make effective use of massively parallel, high-performance computing systems. The book presents both theoretical and computational advances in this domain, reflecting the state of art in 2018.

The book consists of articles based on the XXXVIII Bialowieza Workshop on Geometric Methods in Physics, 2019. The series of Bialowieza workshops, attended by a community of experts at the crossroads of mathematics and physics, is a major annual event in the field. The works in this book, based on presentations given at the workshop, are previously unpublished, at the cutting edge of current research, typically grounded in geometry and analysis, with applications to classical and quantum physics. For the past eight years, the Bialowieza Workshops have been complemented by a School on Geometry and Physics, comprising series of advanced lectures for graduate students and early-career researchers. The extended abstracts of the five lecture series that were given in the eighth school are included. The unique character of the Workshop-and-School series draws on the venue, a famous historical, cultural and environmental site in the Bialowieza forest, a UNESCO World Heritage Centre in the east of Poland: lectures are given in the Nature and Forest Museum and local traditions are interwoven with the scientific activities. The chapter "Toeplitz Extensions in Noncommutative Topology and Mathematical Physics" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

This book gathers research papers and surveys on the latest advances in Schubert Calculus, presented at the International Festival in Schubert Calculus, held in Guangzhou, China on November 6-10, 2017. With roots in enumerative geometry and Hilbert's 15th problem, modern Schubert Calculus studies classical and quantum intersection rings on spaces with symmetries, such as flag manifolds. The presence of symmetries leads to particularly rich structures, and it connects Schubert Calculus to many branches of mathematics, including algebraic geometry, combinatorics, representation theory, and theoretical physics. For instance, the study of the quantum cohomology ring of a Grassmann manifold combines all these areas in an organic way. The book is useful for researchers and graduate students interested in Schubert Calculus, and more generally in the study of flag manifolds in relation to algebraic geometry, combinatorics, representation theory and mathematical physics.

This book applies the convex integration method to multi-dimensional compressible Euler equations in the barotropic case as well as the full system with temperature. The convex integration technique, originally developed in the context of differential inclusions, was applied in the groundbreaking work of De Lellis and Szekelyhidi to the incompressible Euler equations, leading to infinitely many solutions. This theory was later refined to prove non-uniqueness of solutions of the compressible Euler system, too. These non-uniqueness results all use an ansatz which reduces the equations to a kind of incompressible system to which a slight modification of the incompressible theory can be applied. This book presents, for the first time, a generalization of the De Lellis-Szekelyhidi approach to the setting of compressible Euler equations. The structure of this book is as follows: after providing an accessible introduction to the subject, including the essentials of hyperbolic conservation laws, the idea of convex integration in the compressible framework is developed. The main result proves that under a certain assumption there exist infinitely many solutions to an abstract initial boundary value problem for the Euler system. Next some applications of this theorem are discussed, in particular concerning the Riemann problem. Finally there is a survey of some related results. This self-contained book is suitable for both beginners in the field of hyperbolic conservation laws as well as for advanced readers who already know about convex integration in the incompressible framework.

This monograph presents the geoscientific context arising in decorrelative gravitational exploration to determine the mass density distribution inside the Earth. First, an insight into the current state of research is given by reducing gravimetry to mathematically accessible, and thus calculable, decorrelated models. In this way, the various unresolved questions and problems of gravimetry are made available to a broad scientific audience and the exploration industry. New theoretical developments will be given, and innovative ways of modeling geologic layers and faults by mollifier regularization techniques are shown. This book is dedicated to surface as well as volume geology with potential data primarily of terrestrial origin. For deep geology, the geomathematical decorrelation methods are to be designed in such a way that depth information (e.g., in boreholes) may be canonically entered. Bridging several different geo-disciplines, this book leads in a cycle from the potential measurements made by geoengineers, to the cleansing of data by geophysicists and geoengineers, to the subsequent theory and model formation, computer-based implementation, and numerical calculation and simulations made by geomathematicians, to interpretation by geologists, and, if necessary, back. It therefore spans the spectrum from geoengineering, especially geodesy, via geophysics to geomathematics and geology, and back. Using the German Saarland area for methodological tests, important new fields of application are opened, particularly for regions with mining-related cavities or dense development in today's geo-exploration.

In this book we gather recent mathematical developments and engineering applications of Trefftz methods, with particular emphasis on the Method of Fundamental Solutions (MFS). These are true meshless methods that have the advantage of avoiding the need to set up a mesh altogether, and therefore going beyond the reduction of the mesh to a boundary. These Trefftz methods have advantages in several engineering applications, for instance in inverse problems where the domain is unknown and some numerical methods would require a remeshing approach. Trefftz methods are also known to perform very well with regular domains and regular data in boundary value problems, achieving exponential convergence. On the other hand, they may also under certain conditions, exhibit instabilities and lead to ill-conditioned systems. This book is divided into ten chapters that illustrate recent advances in Trefftz methods and their application to engineering problems. The first eight chapters are devoted to the MFS and variants whereas the last two chapters are devoted to related meshless engineering applications. Part of these selected contributions were presented in the 9th International Conference on Trefftz Methods and 5th International Conference on the MFS, held in 2019, July 29-31, in Lisbon, Portugal.

This book provides theories on non-parametric shape optimization problems, systematically keeping in mind readers with an engineering background. Non-parametric shape optimization problems are defined as problems of finding the shapes of domains in which boundary value problems of partial differential equations are defined. In these problems, optimum shapes are obtained from an arbitrary form without any geometrical parameters previously assigned. In particular, problems in which the optimum shape is sought by making a hole in domain are called topology optimization problems. Moreover, a problem in which the optimum shape is obtained based on domain variation is referred to as a shape optimization problem of domain variation type, or a shape optimization problem in a limited sense. Software has been developed to solve these problems, and it is being used to seek practical optimum shapes. However, there are no books explaining such theories beginning with their foundations. The structure of the book is shown in the Preface. The theorems are built up using mathematical results. Therefore, a mathematical style is introduced, consisting of definitions and theorems to summarize the key points. This method of expression is advanced as provable facts are clearly shown. If something to be investigated is contained in the framework of mathematics, setting up a theory using theorems prepared by great mathematicians is thought to be an extremely effective approach. However, mathematics attempts to heighten the level of abstraction in order to understand many things in a unified fashion. This characteristic may baffle readers with an engineering background. Hence in this book, an attempt has been made to provide explanations in engineering terms, with examples from mechanics, after accurately denoting the provable facts using definitions and theorems.

This text provides deep and comprehensive coverage of the mathematical background for data science, including machine learning, optimal recovery, compressed sensing, optimization, and neural networks. In the past few decades, heuristic methods adopted by big tech companies have complemented existing scientific disciplines to form the new field of Data Science. This text embarks the readers on an engaging itinerary through the theory supporting the field. Altogether, twenty-seven lecture-length chapters with exercises provide all the details necessary for a solid understanding of key topics in data science. While the book covers standard material on machine learning and optimization, it also includes distinctive presentations of topics such as reproducing kernel Hilbert spaces, spectral clustering, optimal recovery, compressed sensing, group testing, and applications of semidefinite programming. Students and data scientists with less mathematical background will appreciate the appendices that provide more background on some of the more abstract concepts.

This two-volume book provides an insight into the 10th International Conference on Soft Computing for Problem Solving (SocProS 2020). This international conference is a joint technical collaboration of Soft Computing Research Society and Indian Institute of Technology Indore. The book presents the latest achievements and innovations in the interdisciplinary areas of soft computing. It brings together the researchers, engineers and practitioners to discuss thought-provoking developments and challenges, in order to select potential future directions. It covers original research papers in the areas including but not limited to algorithms (artificial immune system, artificial neural network, genetic algorithm, genetic programming and particle swarm optimization) and applications (control systems, data mining and clustering, finance, weather forecasting, game theory, business and forecasting applications). The book will be beneficial for young as well as experienced researchers dealing across complex and intricate real-world problems for which finding a solution by traditional methods is a difficult task.

This two-volume book provides an insight into the 10th International Conference on Soft Computing for Problem Solving (SocProS 2020). This international conference is a joint technical collaboration of Soft Computing Research Society and Indian Institute of Technology Indore. The book presents the latest achievements and innovations in the interdisciplinary areas of soft computing. It brings together the researchers, engineers and practitioners to discuss thought-provoking developments and challenges, in order to select potential future directions. It covers original research papers in the areas including but not limited to algorithms (artificial immune system, artificial neural network, genetic algorithm, genetic programming and particle swarm optimization) and applications (control systems, data mining and clustering, finance, weather forecasting, game theory, business and forecasting applications). The book will be beneficial for young as well as experienced researchers dealing across complex and intricate real-world problems for which finding a solution by traditional methods is a difficult task.

"Analyzes algebras of concrete approximation methods detailing prerequisites, local principles, and lifting theorems. Covers fractality and Fredholmness. Explains the phenomena of the asymptotic splitting of the singular values, and more."