Based on their research experience, the authors propose a reference textbook in two volumes on the theory of generalized locally Toeplitz sequences and their applications. This first volume focuses on the univariate version of the theory and the related applications in the unidimensional setting, while the second volume, which addresses the multivariate case, is mainly devoted to concrete PDE applications. This book systematically develops the theory of generalized locally Toeplitz (GLT) sequences and presents some of its main applications, with a particular focus on the numerical discretization of differential equations (DEs). It is the first book to address the relatively new field of GLT sequences, which occur in numerous scientific applications and are especially dominant in the context of DE discretizations. Written for applied mathematicians, engineers, physicists, and scientists who (perhaps unknowingly) encounter GLT sequences in their research, it is also of interest to those working in the fields of Fourier and functional analysis, spectral analysis of DE discretization matrices, matrix analysis, measure and operator theory, numerical analysis and linear algebra. Further, it can be used as a textbook for a graduate or advanced undergraduate course in numerical analysis.

The main aim of this book is to discuss model order reduction (MOR) methods for differential-algebraic equations (DAEs) with linear coefficients that make use of splitting techniques before applying model order reduction. The splitting produces a system of ordinary differential equations (ODE) and a system of algebraic equations, which are then reduced separately. For the reduction of the ODE system, conventional MOR methods can be used, whereas for the reduction of the algebraic systems new methods are discussed. The discussion focuses on the index-aware model order reduction method (IMOR) and its variations, methods for which the so-called index of the original model is automatically preserved after reduction.

This volume presents easy-to-understand yet surprising properties obtained using topological, geometric and graph theoretic tools in the areas covered by the Geometry Conference that took place in Mulhouse, France from September 7-11, 2014 in honour of Tudor Zamfirescu on the occasion of his 70th anniversary. The contributions address subjects in convexity and discrete geometry, in distance geometry or with geometrical flavor in combinatorics, graph theory or non-linear analysis. Written by top experts, these papers highlight the close connections between these fields, as well as ties to other domains of geometry and their reciprocal influence. They offer an overview on recent developments in geometry and its border with discrete mathematics, and provide answers to several open questions. The volume addresses a large audience in mathematics, including researchers and graduate students interested in geometry and geometrical problems.

This book presents and discusses the state of the art and future perspectives in mathematical modeling and homogenization techniques with the focus on addressing key physiological issues in the context of multiphase healthy and malignant biological materials. The highly interdisciplinary content brings together contributions from scientists with complementary areas of expertise, such as pure and applied mathematicians, engineers, and biophysicists. The book also features the lecture notes from a half-day introductory course on asymptotic homogenization. These notes are suitable for undergraduate mathematics or physics students, while the other chapters are aimed at graduate students and researchers.

Designed for graduate students, researchers, and engineers in mathematics, optimization, and economics, this self-contained volume presents theory, methods, and applications in mathematical analysis and approximation theory. Specific topics include: approximation of functions by linear positive operators with applications to computer aided geometric design, numerical analysis, optimization theory, and solutions of differential equations. Recent and significant developments in approximation theory, special functions and q-calculus along with their applications to mathematics, engineering, and social sciences are discussed and analyzed. Each chapter enriches the understanding of current research problems and theories in pure and applied research.

In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature. The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms. The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.

This book is dedicated to Professor Selim G. Akl to honour his groundbreaking research achievements in computer science over four decades. The book is an intellectually stimulating excursion into emergent computing paradigms, architectures and implementations. World top experts in computer science, engineering and mathematics overview exciting and intriguing topics of musical rhythms generation algorithms, analyse the computational power of random walks, dispelling a myth of computational universality, computability and complexity at the microscopic level of synchronous computation, descriptional complexity of error detection, quantum cryptography, context-free parallel communicating grammar systems, fault tolerance of hypercubes, finite automata theory of bulk-synchronous parallel computing, dealing with silent data corruptions in high-performance computing, parallel sorting on graphics processing units, mining for functional dependencies in relational databases, cellular automata optimisation of wireless sensors networks, connectivity preserving network transformers, constrained resource networks, vague computing, parallel evolutionary optimisation, emergent behaviour in multi-agent systems, vehicular clouds, epigenetic drug discovery, dimensionality reduction for intrusion detection systems, physical maze solvers, computer chess, parallel algorithms to string alignment, detection of community structure. The book is a unique combination of vibrant essays which inspires scientists and engineers to exploit natural phenomena in designs of computing architectures of the future.

This important textbook provides an introduction to the concepts of the newly developed extended finite element method (XFEM) for fracture analysis of structures, as well as for other related engineering applications.
One of the main advantages of the method is that it avoids any need for remeshing or geometric crack modelling in numerical simulation, while generating discontinuous fields along a crack and around its tip. The second major advantage of the method is that by a small increase in number of degrees of freedom, far more accurate solutions can be obtained. The method has recently been extended to nonlinear materials and other disciplines such as modelling contact and interface, simulation of inclusions and holes, moving and changing phase problems, and even to multiscale analyses.
The book is self contained, with summaries of both classical and modern computational techniques. The main chapters include a comprehensive range of numerical examples describing various features of XFEM.

This book is primarily intended as a research monograph that could also be used in graduate courses for the design of parallel algorithms in matrix computations. It assumes general but not extensive knowledge of numerical linear algebra, parallel architectures, and parallel programming paradigms. The book consists of four parts: (I) Basics; (II) Dense and Special Matrix Computations; (III) Sparse Matrix Computations; and (IV) Matrix functions and characteristics. Part I deals with parallel programming paradigms and fundamental kernels, including reordering schemes for sparse matrices. Part II is devoted to dense matrix computations such as parallel algorithms for solving linear systems, linear least squares, the symmetric algebraic eigenvalue problem, and the singular-value decomposition. It also deals with the development of parallel algorithms for special linear systems such as banded ,Vandermonde ,Toeplitz ,and block Toeplitz systems. Part III addresses sparse matrix computations: (a) the development of parallel iterative linear system solvers with emphasis on scalable preconditioners, (b) parallel schemes for obtaining a few of the extreme eigenpairs or those contained in a given interval in the spectrum of a standard or generalized symmetric eigenvalue problem, and (c) parallel methods for computing a few of the extreme singular triplets. Part IV focuses on the development of parallel algorithms for matrix functions and special characteristics such as the matrix pseudospectrum and the determinant. The book also reviews the theoretical and practical background necessary when designing these algorithms and includes an extensive bibliography that will be useful to researchers and students alike. The book brings together many existing algorithms for the fundamental matrix computations that have a proven track record of efficient implementation in terms of data locality and data transfer on state-of-the-art systems, as well as several algorithms that are presented for the first time, focusing on the opportunities for parallelism and algorithm robustness.

This proceedings volume highlights a selection of papers presented at the Sixth International Conference on High Performance Scientific Computing, which took place in Hanoi, Vietnam on March 16-20, 2015. The conference was jointly organized by the Heidelberg Institute of Theoretical Studies (HITS), the Institute of Mathematics of the Vietnam Academy of Science and Technology (VAST), the Interdisciplinary Center for Scientific Computing (IWR) at Heidelberg University, and the Vietnam Institute for Advanced Study in Mathematics, Ministry of Education The contributions cover a broad, interdisciplinary spectrum of scientific computing and showcase recent advances in theory, methods, and practical applications. Subjects covered numerical simulation, methods for optimization and control, parallel computing, and software development, as well as the applications of scientific computing in physics, mechanics, biomechanics and robotics, material science, hydrology, biotechnology, medicine, transport, scheduling, and industry.

This book provides a snapshot of representative modeling analyses of coastal hypoxia and its effects. Hypoxia refers to conditions in the water column where dissolved oxygen falls below levels that can support most metazoan marine life (i.e., 2 mg O2 l-1). The number of hypoxic zones has been increasing at an exponential rate since the 1960s; there are currently more than 600 documented hypoxic zones in the estuarine and coastal waters worldwide. Hypoxia develops as a synergistic product of many physical and biological factors that affect the balance of dissolved oxygen in seawater, including temperature, solar radiation, wind, freshwater discharge, nutrient supply, and the production and decay of organic matter. A number of modeling approaches have been increasingly used in hypoxia research, along with the more traditional observational and experimental studies. Modeling is necessary because of rapidly changing coastal circulation and stratification patterns that affect hypoxia, the large spatial extent over which hypoxia develops, and limitations on our capabilities to directly measure hypoxia over large spatial and temporal scales. This book consists of 15 chapters that are broadly organized around three main topics: (1) Modeling of the physical controls on hypoxia, (2) Modeling of biogeochemical controls and feedbacks, and, (3) Modeling of the ecological effects of hypoxia. The final chapter is a synthesis chapter that draws generalities from the earlier chapters, highlights strengths and weaknesses of the current state-of-the-art modeling, and offers recommendations on future directions.

This book features a selection of high-quality papers chosen from the best presentations at the International Conference on Spectral and High-Order Methods (2016), offering an overview of the depth and breadth of the activities within this important research area. The carefully reviewed papers provide a snapshot of the state of the art, while the extensive bibliography helps initiate new research directions.

This volume contains a selection of papers presented at the 21st international conference on domain decomposition methods in science and engineering held in Rennes, France, June 25-29, 2012. Domain decomposition is an active and interdisciplinary research discipline, focusing on the development, analysis and implementation of numerical methods for massively parallel computers. Domain decomposition methods are among the most efficient solvers for large scale applications in science and engineering. They are based on a solid theoretical foundation and shown to be scalable for many important applications. Domain decomposition techniques can also naturally take into account multiscale phenomena. This book contains the most recent results in this important field of research, both mathematically and algorithmically and allows the reader to get an overview of this exciting branch of numerical analysis and scientific computing.

This book reviews the state-of-the-art developments in nature-inspired algorithms and their applications in various disciplines, ranging from feature selection and engineering design optimization to scheduling and vehicle routing. It introduces each algorithm and its implementation with case studies as well as extensive literature reviews, and also includes self-contained chapters featuring theoretical analyses, such as convergence analysis and no-free-lunch theorems so as to provide insights into the current nature-inspired optimization algorithms. Topics include ant colony optimization, the bat algorithm, B-spline curve fitting, cuckoo search, feature selection, economic load dispatch, the firefly algorithm, the flower pollination algorithm, knapsack problem, octonian and quaternion representations, particle swarm optimization, scheduling, wireless networks, vehicle routing with time windows, and maximally different alternatives. This timely book serves as a practical guide and reference resource for students, researchers and professionals.

Written by a team of leading experts in the field, this volume presents a self-contained account of the theory, techniques and results in metric type spaces (in particular in G-metric spaces); that is, the text approaches this important area of fixed point analysis beginning from the basic ideas of metric space topology. The text is structured so that it leads the reader from preliminaries and historical notes on metric spaces (in particular G-metric spaces) and on mappings, to Banach type contraction theorems in metric type spaces, fixed point theory in partially ordered G-metric spaces, fixed point theory for expansive mappings in metric type spaces, generalizations, present results and techniques in a very general abstract setting and framework. Fixed point theory is one of the major research areas in nonlinear analysis. This is partly due to the fact that in many real world problems fixed point theory is the basic mathematical tool used to establish the existence of solutions to problems which arise naturally in applications. As a result, fixed point theory is an important area of study in pure and applied mathematics and it is a flourishing area of research.

This textbook provides a step-by-step approach to numerical methods in engineering modelling. The authors provide a consistent treatment of the topic, from the ground up, to reinforce for students that numerical methods are a set of mathematical modelling tools which allow engineers to represent real-world systems and compute features of these systems with a predictable error rate. Each method presented addresses a specific type of problem, namely root-finding, optimization, integral, derivative, initial value problem, or boundary value problem, and each one encompasses a set of algorithms to solve the problem given some information and to a known error bound. The authors demonstrate that after developing a proper model and understanding of the engineering situation they are working on, engineers can break down a model into a set of specific mathematical problems, and then implement the appropriate numerical methods to solve these problems.

This book presents practical applications of the finite element method to general differential equations. The underlying strategy of deriving the finite element solution is introduced using linear ordinary differential equations, thus allowing the basic concepts of the finite element solution to be introduced without being obscured by the additional mathematical detail required when applying this technique to partial differential equations. The author generalizes the presented approach to partial differential equations which include nonlinearities. The book also includes variations of the finite element method such as different classes of meshes and basic functions. Practical application of the theory is emphasised, with development of all concepts leading ultimately to a description of their computational implementation illustrated using Matlab functions. The target audience primarily comprises applied researchers and practitioners in engineering, but the book may also be beneficial for graduate students.

This book gives a concise introduction to the basic techniques needed for the theoretical analysis of the Maxwell Equations, and filters in an elegant way the essential parts, e.g., concerning the various function spaces needed to rigorously investigate the boundary integral equations and variational equations. The book arose from lectures taught by the authors over many years and can be helpful in designing graduate courses for mathematically orientated students on electromagnetic wave propagation problems. The students should have some knowledge on vector analysis (curves, surfaces, divergence theorem) and functional analysis (normed spaces, Hilbert spaces, linear and bounded operators, dual space). Written in an accessible manner, topics are first approached with simpler scale Helmholtz Equations before turning to Maxwell Equations. There are examples and exercises throughout the book. It will be useful for graduate students and researchers in applied mathematics and engineers working in the theoretical approach to electromagnetic wave propagation.

The methods considered in the 7th conference on "Finite Volumes for Complex Applications" (Berlin, June 2014) have properties which offer distinct advantages for a number of applications. The second volume of the proceedings covers reviewed contributions reporting successful applications in the fields of fluid dynamics, magnetohydrodynamics, structural analysis, nuclear physics, semiconductor theory and other topics.

The finite volume method in its various forms is a space discretization technique for partial differential equations based on the fundamental physical principle of conservation. Recent decades have brought significant success in the theoretical understanding of the method. Many finite volume methods preserve further qualitative or asymptotic properties, including maximum principles, dissipativity, monotone decay of free energy, and asymptotic stability. Due to these properties, finite volume methods belong to the wider class of compatible discretization methods, which preserve qualitative properties of continuous problems at the discrete level. This structural approach to the discretization of partial differential equations becomes particularly important for multiphysics and multiscale applications.

Researchers, PhD and masters level students in numerical analysis, scientific computing and related fields such as partial differential equations will find this volume useful, as will engineers working in numerical modeling and simulations.

This book highlights recent compelling research results and trends in various aspects of contemporary mathematics, emphasizing applicabilitions to real-world situations. The chapters present exciting new findings and developments in situations where mathematical rigor is combined with common sense. A multi-disciplinary approach, both within each chapter and in the volume as a whole, leads to practical insights that may result in a more synthetic understanding of specific global issues as well as their possible solutions. The volume will be of interest not only to experts in mathematics, but also to graduate students, scientists, and practitioners from other fields including physics, biology, geology, management, and medicine.

This book gathers threads that have evolved across different mathematical disciplines into seamless narrative. It deals with condition as a main aspect in the understanding of the performance ---regarding both stability and complexity--- of numerical algorithms. While the role of condition was shaped in the last half-century, so far there has not been a monograph treating this subject in a uniform and systematic way. The book puts special emphasis on the probabilistic analysis of numerical algorithms via the analysis of the corresponding condition. The exposition's level increases along the book, starting in the context of linear algebra at an undergraduate level and reaching in its third part the recent developments and partial solutions for Smale's 17th problem which can be explained within a graduate course. Its middle part contains a condition-based course on linear programming that fills a gap between the current elementary expositions of the subject based on the simplex method and those focusing on convex programming.

Broadly organized around the applications of Fourier analysis, "Methods of Applied Mathematics with a MATLAB Overview" covers both classical applications in partial differential equations and boundary value problems, as well as the concepts and methods associated to the Laplace, Fourier, and discrete transforms. Transform inversion problems are also examined, along with the necessary background in complex variables. A final chapter treats wavelets, short-time Fourier analysis, and geometrically-based transforms. The computer program MATLAB is emphasized throughout, and an introduction to MATLAB is provided in an appendix. Rich in examples, illustrations, and exercises of varying difficulty, this text can be used for a one- or two-semester course and is ideal for students in pure and applied mathematics, physics, and engineering.

Examining the basic principles in real analysis and their applications, this text provides a self-contained resource for graduate and advanced undergraduate courses. It contains independent chapters aimed at various fields of application, enhanced by highly advanced graphics and results explained and supplemented with practical and theoretical exercises. The presentation of the book is meant to provide natural connections to classical fields of applications such as Fourier analysis or statistics. However, the book also covers modern areas of research, including new and seminal results in the area of functional analysis.