Approximation theory and numerical analysis are central to the creation of accurate computer simulations and mathematical models. Research in these areas can influence the computational techniques used in a variety of mathematical and computational sciences.

This collection of contributed chapters, dedicated to renowned mathematician Gradimir V. Milovanovi, represent the recent work of experts in the fields of approximation theory and numerical analysis. These invited contributions describe new trends in these important areas of research including theoretic developments, new computational algorithms, and multidisciplinary applications.

Special features of this volume:

- Presents results and approximation methods in various computational settings including: polynomial and orthogonal systems, analytic functions, and differential equations.

- Provides a historical overview of approximation theory and many of its subdisciplines;

- Contains new results from diverse areas of research spanning mathematics, engineering, and the computational sciences.

"Approximation and Computation" is intended for mathematicians and researchers focusing on approximation theory and numerical analysis, but can also be a valuable resource to students and researchers in the computational and applied sciences."

This book shows how to model selected communication scenarios using game theory. The book helps researchers specifically dealing with scenarios motivated by the increasing use of the Internet of Things (IoT) and 5G Communications by using game theory to approach the study of such challenging scenarios. The author explains how game theory acts as a mathematical tool that models decision making in terms of strategies and mechanisms that can result in optimal payoffs for a number of interacting entities, offering often antagonistic behaviors. The book explores new technologies in terms of design, development and management from a theoretical perspective, using game theory to analyze strategic situations and demonstrate profitable behaviors of the cooperative entities. The book identifies and explores several significant applications/uses/situations that arise from the vast deployment of the IoT. The presentation of the technological scenarios is followed in each of the first four chapters by a step-by-step theoretical model often followed by equilibrium proof, and numerical simulation results, that are explained in a tutorial-like manner. The four chapters tackle challenging IoT and 5G related issues, including: new security threats that IoT brings, e.g. botnets, ad hoc vehicular networks and the need for trust in vehicular communications, content repetition by offloading traffic onto mobile users, as well as issues due to new wearable devices that enable data collection to become more intrusive.

This book on constrained optimization is novel in that it fuses these themes: * use examples to introduce general ideas; * engage the student in spreadsheet computation; * survey the uses of constrained optimization;. * investigate game theory and nonlinear optimization, * link the subject to economic reasoning, and * present the requisite mathematics. Blending these themes makes constrained optimization more accessible and more valuable. It stimulates the student's interest, quickens the learning process, reveals connections to several academic and professional fields, and deepens the student's grasp of the relevant mathematics. The book is designed for use in courses that focus on the applications of constrained optimization, in courses that emphasize the theory, and in courses that link the subject to economics.

The advent of rapid, reliable and cheap computing power over the last decades has transformed many, if not most, fields of science and engineering. The multidisciplinary field of optimization is no exception. First of all, with fast computers, researchers and engineers can apply classical optimization methods to problems of larger and larger size. In addition, however, researchers have developed a host of new optimization algorithms that operate in a rather different way than the classical ones, and that allow practitioners to attack optimization problems where the classical methods are either not applicable or simply too costly (in terms of time and other resources) to apply. This book is intended as a course book for introductory courses in stochastic optimization algorithms (in this book, the terms optimization method and optimization algorithm will be used interchangeably), and it has grown from a set of lectures notes used in courses, taught by the author, at the international master programme Complex Adaptive Systems at Chalmers University of Technology in Goteborg, Sweden.Thus, a suitable audience for this book are third and fourth-year engineering students, with a background in engineering mathematics (analysis, algebra, and probability theory) as well as some knowledge of computer programming.

This book addresses the uncertainties of wind power modeled as interval numbers and assesses the physical modeling and methods for interval power flow, interval economic dispatch and interval robust economic dispatch. In particular, the optimization models are set up to address these topics and the state-of-the-art methods are employed to efficiently solve the proposed models. Several standard IEEE test systems as well as real-world large-scale Polish power systems have been tested to verify the effectiveness of the proposed models and methods. These methods can be further applied to other research fields that are involved with uncertainty.

Our everyday lives are practically unthinkable without optimization. We constantly try to minimize our effort and to maximize the reward or progress achieved. Many real-world and industrial problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks. This volume presents a comprehensive collection of extended contributions from the 2017 Workshop on Computational Optimization. Presenting recent advances in computational optimization, it addresses important concrete applications, e.g. the modeling of physical processes, wildfire modeling, modeling processes in chemical engineering, workforce planning, wireless access network topology, parameter settings for controlling various processes, berth allocation, identification of homogeneous domains, and quantum computing. The book shows how to develop algorithms for them based on new intelligent methods like evolutionary computations, ant colony optimization, constrain programming and others.

The goal in putting together this unique compilation was to present the current status of the solutions to some of the most essential open problems in pure and applied mathematics. Emphasis is also given to problems in interdisciplinary research for which mathematics plays a key role. This volume comprises highly selected contributions by some of the most eminent mathematicians in the international mathematical community on longstanding problems in very active domains of mathematical research. A joint preface by the two volume editors is followed by a personal farewell to John F. Nash, Jr. written by Michael Th. Rassias. An introduction by Mikhail Gromov highlights some of Nash's legendary mathematical achievements. The treatment in this book includes open problems in the following fields: algebraic geometry, number theory, analysis, discrete mathematics, PDEs, differential geometry, topology, K-theory, game theory, fluid mechanics, dynamical systems and ergodic theory, cryptography, theoretical computer science, and more. Extensive discussions surrounding the progress made for each problem are designed to reach a wide community of readers, from graduate students and established research mathematicians to physicists, computer scientists, economists, and research scientists who are looking to develop essential and modern new methods and theories to solve a variety of open problems.

Dynamics, Games and Science I and II are a selection of surveys and research articles written by leading researchers in mathematics. The majority of the contributions are on dynamical systems and game theory, focusing either on fundamental and theoretical developments or on applications to modeling in biology, ecomonics, engineering, finances and psychology.

The papers are based on talks given at the International Conference DYNA 2008, held in honor of Mauricio Peixoto and David Rand at the University of Braga, Portugal, on September 8-12, 2008.

The aim of these volumes is to present cutting-edge research in these areas to encourage graduate students and researchers in mathematics and other fields to develop them further.

This volume reflects "New Trends in Shape Optimization" and is based on a workshop of the same name organized at the Friedrich-Alexander University Erlangen-Nurnberg in September 2013. During the workshop senior mathematicians and young scientists alike presented their latest findings. The format of the meeting allowed fruitful discussions on challenging open problems, and triggered a number of new and spontaneous collaborations. As such, the idea was born to produce this book, each chapter of which was written by a workshop participant, often with a collaborator. The content of the individual chapters ranges from survey papers to original articles; some focus on the topics discussed at the Workshop, while others involve arguments outside its scope but which are no less relevant for the field today. As such, the book offers readers a balanced introduction to the emerging field of shape optimization.

The editors and authors dedicate this book to Bernhard Korte on the occasion of his seventieth birthday. We, the editors, are happy about the overwhelming feedback to our initiative to honor him with this book and with a workshop in Bonn on November 3-7,2008.Althoughthiswouldbeareasontolookback,wewouldratherliketolook forward and see what are the interesting research directions today. This book is written by leading experts in combinatorial optimization. All - pers were carefully reviewed, and eventually twenty-three of the invited papers were accepted for this book. The breadth of topics is typical for the eld: combinatorial optimization builds bridges between areas like combinatorics and graph theory, submodular functions and matroids, network ows and connectivity, approximation algorithms and mat- matical programming, computational geometry and polyhedral combinatorics. All these topics are related, and they are all addressed in this book. Combi- torial optimization is also known for its numerous applications. To limit the scope, however, this book is not primarily about applications, although some are mentioned at various places. Most papers in this volume are surveys that provide an excellent overview of an activeresearcharea,butthisbookalsocontainsmanynewresults.Highlightingmany of the currently most interesting research directions in combinatorial optimization, we hope that this book constitutes a good basis for future research in these areas.

"Discrete-Time Linear Systems: Theory and Design with Applications "combines system theory and design in order to show the importance of system theory and its role in system design. The book focuses on system theory (including optimal state feedback and optimal state estimation) and system design (with applications to feedback control systems and wireless transceivers, plus system identification and channel estimation).

This book provides a comprehensive guide to analyzing and solving optimal design problems in continuous media by means of the so-called sub-relaxation method. Though the underlying ideas are borrowed from other, more classical approaches, here they are used and organized in a novel way, yielding a distinct perspective on how to approach this kind of optimization problems. Starting with a discussion of the background motivation, the book broadly explains the sub-relaxation method in general terms, helping readers to grasp, from the very beginning, the driving idea and where the text is heading. In addition to the analytical content of the method, it examines practical issues like optimality and numerical approximation. Though the primary focus is on the development of the method for the conductivity context, the book's final two chapters explore several extensions of the method to other problems, as well as formal proofs. The text can be used for a graduate course in optimal design, even if the method would require some familiarity with the main analytical issues associated with this type of problems. This can be addressed with the help of the provided bibliography.

Our understanding of information and information dynamics has outgrown classical information theory. The theory does not account for the value or influence of information within the context of a system or network and does not explain how these properties might influence how information flows though and interacts with a system. The invited chapters in this collection present new theories, methods, and applications that address some of these limitations.

Dynamics of Information Systems presents state-of-the-art research explaining the importance of information in the evolution of a distributed or networked system. This book presents techniques for measuring the value or significance of information within the context of a system. Each chapter reveals a unique topic or perspective from experts in this exciting area of research.

These newly developed techniques have numerous applications including: the detection of terrorist networks, the design of highly functioning businesses and computer systems, modeling the distributed sensory and control physiology of animals, quantum entanglement and genome modeling, multi-robotic systems design, as well as industrial and manufacturing safety.

From the reviews of the previous editions

..".. The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting mathematical results and practical applications. ... the author pays much attention to the inclusion of well-chosen exercises. The reader does not remain helpless; solutions or at least hints are given in the appendix. Except for some small basic mathematical and algorithmic knowledge the book is self-contained. ..." K.Engel, Mathematical Reviews 2002

The substantial development effort of this text, involving multiple editions and trailing in the context of various workshops, university courses and seminar series, clearly shows through in this new edition with its clear writing, good organisation, comprehensive coverage of essential theory, and well-chosen applications. The proofs of important results and the representation of key algorithms in a Pascal-like notation allow this book to be used in a high-level undergraduate or low-level graduate course on graph theory, combinatorial optimization or computer science algorithms. The well-worked solutions to exercises are a real bonus for self study by students. The book is highly recommended. P .B. Gibbons, Zentralblatt fur Mathematik 2005

Once again, the new edition has been thoroughly revised. In particular, some further material has been added: more on NP-completeness (especially on dominating sets), a section on the Gallai-Edmonds structure theory for matchings, and about a dozen additional exercises as always, with solutions. Moreover, the section on the 1-factor theorem has been completely rewritten: it now presents a short direct proof for the more general Berge-Tutte formula. Several recent research developments are discussed and quite a few references have been added."

Facility location theory develops the idea of locating one or more facilities by optimizing suitable criteria such as minimizing transportation cost, or capturing the largest market share. The contributions in this book focus an approach to facility location theory through game theoretical tools highlighting situations where a location decision is faced by several decision makers and leading to a game theoretical framework in non-cooperative and cooperative methods. Models and methods regarding the facility location via game theory are explored and applications are illustrated through economics, engineering, and physics. Mathematicians, engineers, economists and computer scientists working in theory, applications and computational aspects of facility location problems using game theory will find this book useful.

Optimization has become an essential tool in addressing the limitation of resources and need for better decision-making in the medical field. Both continuous and discrete mathematical techniques are playing an increasingly important role in understanding several fundamental problems in medicine. This volume presents a wide range of medical applications that can utilize mathematical computing. Examples include using an algorithm for considering the seed reconstruction problem in brachytherapy and using optimization-classification models to assist in the early prediction, diagnosis and detection of diseases. Discrete optimization techniques and measures derived from the theory of nonlinear dynamics, with analysis of multi-electrode electroencephalographic (EEG) data, assist in predicting impending epileptic seizures. Mathematics in medicine can also be found in recent cancer research. Sophisticated mathematical models and optimization algorithms have been used to generate treatment plans for radionuclide implant and external beam radiation therapy. Optimization techniques have also been used to automate the planning process in Gamma Knife treatment, as well as to address a variety of medical image registration problems. This work grew out of a workshop on optimization which was held during the 2005 CIM Thematic Term on Optimization in Coimbra, Portugal. It provides an overview of the state-of-the-art in optimization in medicine and will serve as an excellent reference for researchers in the medical computing community and for those working in applied mathematics and optimization."

A unique interdisciplinary foundation for real-world problem solving

Stochastic search and optimization techniques are used in a vast number of areas, including aerospace, medicine, transportation, and finance, to name but a few. Whether the goal is refining the design of a missile or aircraft, determining the effectiveness of a new drug, developing the most efficient timing strategies for traffic signals, or making investment decisions in order to increase profits, stochastic algorithms can help researchers and practitioners devise optimal solutions to countless real-world problems.

Introduction to Stochastic Search and Optimization: Estimation, Simulation, and Control is a graduate-level introduction to the principles, algorithms, and practical aspects of stochastic optimization, including applications drawn from engineering, statistics, and computer science. The treatment is both rigorous and broadly accessible, distinguishing this text from much of the current literature and providing students, researchers, and practitioners with a strong foundation for the often-daunting task of solving real-world problems.

The text covers a broad range of today’s most widely used stochastic algorithms, including:

• Random search
• Recursive linear estimation
• Stochastic approximation
• Simulated annealing
• Genetic and evolutionary methods
• Machine (reinforcement) learning
• Model selection
• Simulation-based optimization
• Markov chain Monte Carlo
• Optimal experimental design

The book includes over 130 examples, Web links to software and data sets, more than 250 exercises for the reader, and an extensive list of references. These features help make the text an invaluable resource for those interested in the theory or practice of stochastic search and optimization.

This book provides the first comprehensive introduction to multi-agent, multi-choice repetitive games, such as the Kolkata Restaurant Problem and the Minority Game. It explains how the tangible formulations of these games, using stochastic strategies developed by statistical physicists employing both classical and quantum physics, have led to very efficient solutions to the problems posed. Further, it includes sufficient introductory notes on information-processing strategies employing both classical statistical physics and quantum mechanics. Games of this nature, in which agents are presented with choices, from among which their goal is to make the minority choice, offer effective means of modeling herd behavior and market dynamics and are highly relevant to assessing systemic risk. Accordingly, this book will be of interest to economists, physicists, and computer scientists alike.

Network Analysis has become a major research topic over the last several years. The broad range of applications that can be described and analyzed by means of a network is bringing together researchers, practitioners and other scientific communities from numerous fields such as Operations Research, Computer Science, Transportation, Energy, Social Sciences, and more. The remarkable diversity of fields that take advantage of Network Analysis makes the endeavor of gathering up-to-date material in a single compilation a useful, yet very difficult, task. The purpose of these proceedings is to overcome this difficulty by collecting the major results found by the participants of the "First International Conference in Network Analysis," held at The University of Florida, Gainesville, USA, from the 14th to the 16th of December 2011. The contributions of this conference not only come from different fields, but also cover a broad range of topics relevant to the theory and practice of network analysis, including the reliability of complex networks, software, theory, methodology and applications.

ELEMENTARY LINEAR ALGEBRA, 8E, INTERNATIONAL METRIC EDITION's clear, careful, and concise presentation of material helps you fully understand how mathematics works. The author balances theory with examples, applications, and geometric intuition for a complete, step-by-step learning system. To engage you in the material, a new design highlights the relevance of the mathematics and makes the book easier to read. Data and applications reflect current statistics and examples, demonstrating the link between theory and practice. The companion website LarsonLinearAlgebra.com offers free access to multiple study tools and resources. CalcChat.com offers free step-by-step solutions to the odd-numbered exercises in the text.

This book addresses higher-lower level decision autonomy for autonomous vehicles, and discusses the addition of a novel architecture to cover both levels. The proposed framework's performance and stability are subsequently investigated by employing different meta-heuristic algorithms. The performance of the proposed architecture is shown to be largely independent of the algorithms employed; the use of diverse algorithms (subjected to the real-time performance of the algorithm) does not negatively affect the system's real-time performance. By analyzing the simulation results, the book demonstrates that the proposed model provides perfect mission timing and task management, while also guaranteeing secure deployment. Although mainly intended as a research work, the book's review chapters and the new approaches developed here are also suitable for use in courses for advanced undergraduate or graduate students.

Differential Game Theory with Applications to Missiles and Autonomous Systems explains the use of differential game theory in autonomous guidance and control systems. The book begins with an introduction to the basic principles before considering optimum control and game theory. Two-party and multi-party game theory and guidance are then covered and, finally, the theory is demonstrated through simulation examples and models and the simulation results are discussed. Recent developments in the area of guidance and autonomous systems are also presented. Key features: * Presents new developments and how they relate to established control systems knowledge. * Demonstrates the theory through simulation examples and models. * Covers two-party and multi-party game theory and guidance. * Accompanied by a website hosting MATLAB(R) code. The book is essential reading for researchers and practitioners in the aerospace and defence industries as well as graduate students in aerospace engineering.

This book presents and applies a novel efficient meta-heuristic optimization algorithm called Colliding Bodies Optimization (CBO) for various optimization problems. The first part of the book introduces the concepts and methods involved, while the second is devoted to the applications. Though optimal design of structures is the main topic, two chapters on optimal analysis and applications in constructional management are also included. This algorithm is based on one-dimensional collisions between bodies, with each agent solution being considered as an object or body with mass. After a collision of two moving bodies with specified masses and velocities, these bodies again separate, with new velocities. This collision causes the agents to move toward better positions in the search space. The main algorithm (CBO) is internally parameter independent, setting it apart from previously developed meta-heuristics. This algorithm is enhanced (ECBO) for more efficient applications in the optimal design of structures. The algorithms are implemented in standard computer programming languages (MATLAB and C++) and two main codes are provided for ease of use.