Описание: The subject of this book is the solution of stiff differential equations and of differential-algebraic systems (differential equations with constraints). The book is divided into four chapters. The beginning of each chapter is of introductory nature, followed by practical applications, the discussion of numerical results, theoretical investigations on the order and accuracy, linear and nonlinear stability, convergence and asymptotic expansions. Stiff and differential-algebraic problems arise everywhere in scientific computations (e.g., in physics, chemistry, biology, control engineering, electrical network analysis, mechanical systems). Many applications as well as computer programs are presented.
Автор: Alexander J. Zaslavski Название: Algorithms for solving common fixed point problems / ISBN: 3319774360 ISBN-13(EAN): 9783319774367 Издательство: Springer Рейтинг: Цена: 16769.00 р. Наличие на складе: Поставка под заказ.
Описание: This book details approximate solutions to common fixed point problems and convex feasibility problems in the presence of perturbations. Convex feasibility problems search for a common point of a finite collection of subsets in a Hilbert space; common fixed point problems pursue a common fixed point of a finite collection of self-mappings in a Hilbert space. A variety of algorithms are considered in this book for solving both types of problems, the study of which has fueled a rapidly growing area of research. This monograph is timely and highlights the numerous applications to engineering, computed tomography, and radiation therapy planning. Totaling eight chapters, this book begins with an introduction to foundational material and moves on to examine iterative methods in metric spaces. The dynamic string-averaging methods for common fixed point problems in normed space are analyzed in Chapter 3. Dynamic string methods, for common fixed point problems in a metric space are introduced and discussed in Chapter 4. Chapter 5 is devoted to the convergence of an abstract version of the algorithm which has been called component-averaged row projections (CARP). Chapter 6 studies a proximal algorithm for finding a common zero of a family of maximal monotone operators. Chapter 7 extends the results of Chapter 6 for a dynamic string-averaging version of the proximal algorithm. In Chapters 8 subgradient projections algorithms for convex feasibility problems are examined for infinite dimensional Hilbert spaces.
Автор: Heinz H. Bauschke; Regina S. Burachik; Patrick L. Название: Fixed-Point Algorithms for Inverse Problems in Science and Engineering ISBN: 1461429005 ISBN-13(EAN): 9781461429005 Издательство: Springer Рейтинг: Цена: 23058.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book presents recent work from top-notch researchers studying projection and other first-order fixed-point algorithms in several areas of mathematics and the applied sciences. It provides a survey of the theory and practice in fixed-point algorithms.
Описание: Numerous problems from diverse disciplines can be converted using mathematical modelling to an equation defined on suitable abstract spaces usually involving the n-dimensional Euclidean space or Hilbert space or Banach Space or even more general spaces. The solution of these equations is sought in closed form. But this is possible only in special cases. That is why researchers and practitioners use algorithms which seems to be the only alternative. Due to the explosion of technology, scientific and parallel computing, faster and faster computers become available. This development simply means that new optimized algorithms should be developed to take advantage of these improvements. There is exactly where we come in with our book containing such algorithms with application especially in problems from Economics but also from other areas such as Mathematical: Biology, Chemistry, Physics, Scientific, Parallel Computing, and also Engineering. The book can be used by senior undergraduate students, graduate students, researchers and practitioners in the aforementioned area in the classroom or as a reference material. Readers should know the fundamentals of numerical functional analysis, economic theory, and Newtonian physics. Some knowledge of computers and contemporary programming shall be very helpful to the readers.
Автор: Kazimierz Malanowski; Koichi Mizukami Название: Analysis and Algorithms of Optimization Problems ISBN: 3540166602 ISBN-13(EAN): 9783540166603 Издательство: Springer Рейтинг: Цена: 12157.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Автор: Mari?n Vajtersic Название: Algorithms for Elliptic Problems ISBN: 9048141907 ISBN-13(EAN): 9789048141906 Издательство: Springer Рейтинг: Цена: 19564.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 'Et moi, ..., si j'avait su comment. One service mathematics has ren- en revenir, je n'y serais point alle'. dered the human race. It has put common sense back where it be- Jules Verne longs, on the topmost shelf next to the dusty canister labelIed 'discard- The series is divergent; therefore we ed nonsense'. may be able to do something with Eric T. Bell it. O. Heaviside Mathematics is a tool for thought. A highly necessary tool in a world where both feedback and nonlinearities abound. Similarly, all kinds of parts of mathematics serve as tools for other parts and for other sciences. Applying a simple rewriting rule to the quote on the right above one finds such statements as: 'One service topology has rendered mathema- tical physics ... '; 'One service logic has rendered computer science ... '; 'One service category theory has rendered mathematics ... '. All ar- guably true. Alld all statements obtainable this way form part of the raison d 'etre of this serics.
Описание: This tutorial introduces readers to several variants of routing problems with profits. In these routing problems each node has a certain profit, and not all nodes need to be visited. Since the orienteering problem (OP) is by far the most frequently studied problem in this category of routing problems, the book mainly focuses on the OP. In turn, other problems are presented as variants of the OP, focusing on the similarities and differences. The goal of the OP is to determine a subset of nodes to visit and in which order, so that the total collected profit is maximized and a given time budget is not exceeded.
The book provides a comprehensive review of variants of the OP, such as the team OP, the team OP with time windows, the profitable tour problem, and the prize-collecting travelling salesperson problem. In addition, it presents mathematical models and techniques for solving these OP variants and discusses their complexity. Several simple examples and benchmark instances, together with their best-known results, are also included. Finally, the book reviews the latest applications of these problems in the fields of logistics, tourism and others.
Описание: This book provides state-of-the-art and interdisciplinary topics on solving matrix eigenvalue problems, particularly by using recent petascale and upcoming post-petascale supercomputers.
Описание: Introduction.- Definitions and Mathematical Models of Single Vehicle Routing.- Definitions and Mathematical Models of OP Variants.- State-of-the-Art Solution Techniques for PTP and PCTSP.- State-of-the-Art Solution Techniques for OP and TOP.- State-of-the-Art Solution Techniques for OPTW and TOPTW.- Applications of the OP.- Other Orienteering Problem Variants.
Описание: This book presents selected papers from the 3rd International Workshop on Computational Engineering held in Stuttgart from October 6 to 10, 2014, bringing together innovative contributions from related fields with computer science and mathematics as an important technical basis among others.
Автор: Dostбl Zdeněk, Kozubek Tomбs, Sadowskб Marie Название: Scalable Algorithms for Contact Problems ISBN: 1493983121 ISBN-13(EAN): 9781493983124 Издательство: Springer Рейтинг: Цена: 18167.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book presents a comprehensive and self-contained treatment of the authors` newly developed scalable algorithms for the solutions of multibody contact problems of linear elasticity.
Автор: Emilio Spedicato Название: Computer Algorithms for Solving Linear Algebraic Equations ISBN: 3642767192 ISBN-13(EAN): 9783642767197 Издательство: Springer Рейтинг: Цена: 14673.00 р. Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: Proceedings of the NATO Advanced Study Institute on Computer Algorithms for Solving Linear Equations: The State of the Art, held at Il Ciocco, Barga, Italy, September 9-21, 1990
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru
