Контакты/Проезд  Доставка и Оплата Помощь/Возврат
История
  +7 707 857-29-98
  +7(7172) 65-23-70
  10:00-18:00 пн-пт
  shop@logobook.kz
   
    Поиск книг                        
Найти
  Зарубежные издательства Российские издательства  
Авторы | Каталог книг | Издательства | Новинки | Учебная литература | Акции | Бестселлеры | |
 

Contemporary Algorithms for Solving Problems in Economics and Other Disciplines, Ioannis K. Argyros


Варианты приобретения
Цена: 182680.00T
Кол-во:
Наличие:
Добавить в корзину
в Мои желания

Автор: Ioannis K. Argyros
Название:  Contemporary Algorithms for Solving Problems in Economics and Other Disciplines
ISBN: 9781536181289
Издательство: Nova Science
Классификация:

ISBN-10: 1536181285
Обложка/Формат: Hardback
Страницы: 325
Вес: 0.57 кг.
Дата издания: 17.07.2020
Язык: English
Размер: 157 x 233 x 18
Читательская аудитория: General (us: trade)
Ключевые слова: Mathematics
Рейтинг:
Поставляется из: Англии
Описание: 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.

Algorithms for solving common fixed point problems /

Автор: Alexander J. Zaslavski
Название: Algorithms for solving common fixed point problems /
ISBN: 3319774360 ISBN-13(EAN): 9783319774367
Издательство: Springer
Рейтинг:
Цена: 111790.00 T
Наличие на складе: Нет в наличии.
Описание: 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.

Algorithms for Solving Common Fixed Point Problems

Автор: Alexander J. Zaslavski
Название: Algorithms for Solving Common Fixed Point Problems
ISBN: 3030084558 ISBN-13(EAN): 9783030084554
Издательство: Springer
Рейтинг:
Цена: 111790.00 T
Наличие на складе: Нет в наличии.
Описание: This book details approximate solutions to common fixed point problems and convex feasibility problems in the presence of perturbations. common fixed point problems pursue a common fixed point of a finite collection of self-mappings in a Hilbert space.

Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain

Автор: Jin-Yi Cai, Xi Chen
Название: Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain
ISBN: 1107062373 ISBN-13(EAN): 9781107062375
Издательство: Cambridge Academ
Рейтинг:
Цена: 155230.00 T
Наличие на складе: Невозможна поставка.
Описание: Complexity theory aims to understand and classify computational problems according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems on the Boolean domain and is broadly accessible to researchers and graduate students.

Eigenvalue Problems: Algorithms, Software and Applications, in Petascale Computing

Автор: Tetsuya Sakurai; Shao-Liang Zhang; Toshiyuki Imamu
Название: Eigenvalue Problems: Algorithms, Software and Applications, in Petascale Computing
ISBN: 3319624245 ISBN-13(EAN): 9783319624242
Издательство: Springer
Рейтинг:
Цена: 167700.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Inverse Problems: Tikhonov Theory and Algorithms

Автор: Ito Kazufumi, Jin Bangti
Название: Inverse Problems: Tikhonov Theory and Algorithms
ISBN: 9814596191 ISBN-13(EAN): 9789814596190
Издательство: World Scientific Publishing
Рейтинг:
Цена: 118270.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание:

Inverse problems arise in practical applications whenever one needs to deduce unknowns from observables. This monograph is a valuable contribution to the highly topical field of computational inverse problems. Both mathematical theory and numerical algorithms for model-based inverse problems are discussed in detail. The mathematical theory focuses on nonsmooth Tikhonov regularization for linear and nonlinear inverse problems. The computational methods include nonsmooth optimization algorithms, direct inversion methods and uncertainty quantification via Bayesian inference.

The book offers a comprehensive treatment of modern techniques, and seamlessly blends regularization theory with computational methods, which is essential for developing accurate and efficient inversion algorithms for many practical inverse problems.

It demonstrates many current developments in the field of computational inversion, such as value function calculus, augmented Tikhonov regularization, multi-parameter Tikhonov regularization, semismooth Newton method, direct sampling method, uncertainty quantification and approximate Bayesian inference. It is written for graduate students and researchers in mathematics, natural science and engineering.


Fixed-Point Algorithms for Inverse Problems in Science and Engineering

Автор: 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
Рейтинг:
Цена: 153720.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Analysis and Algorithms of Optimization Problems

Автор: Kazimierz Malanowski; Koichi Mizukami
Название: Analysis and Algorithms of Optimization Problems
ISBN: 3540166602 ISBN-13(EAN): 9783540166603
Издательство: Springer
Рейтинг:
Цена: 81050.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.

Algorithms for Elliptic Problems

Автор: Mari?n Vajtersic
Название: Algorithms for Elliptic Problems
ISBN: 9048141907 ISBN-13(EAN): 9789048141906
Издательство: Springer
Рейтинг:
Цена: 130430.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: '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.

Orienteering Problems: Models and Algorithms for Vehicle Routing Problems with Profits

Автор: Vansteenwegen Pieter, Gunawan Aldy
Название: Orienteering Problems: Models and Algorithms for Vehicle Routing Problems with Profits
ISBN: 3030297454 ISBN-13(EAN): 9783030297459
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing

Автор: Tetsuya Sakurai; Shao-Liang Zhang; Toshiyuki Imamu
Название: Eigenvalue Problems: Algorithms, Software and Applications in Petascale Computing
ISBN: 3319873091 ISBN-13(EAN): 9783319873091
Издательство: Springer
Рейтинг:
Цена: 186330.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.

Adjoint Equations and Perturbation Algorithms in Nonlinear Problems

Автор: Marchuk, Guri I. , Agoshkov, Valeri I. , Shutyae
Название: Adjoint Equations and Perturbation Algorithms in Nonlinear Problems
ISBN: 0367448580 ISBN-13(EAN): 9780367448585
Издательство: Taylor&Francis
Рейтинг:
Цена: 67360.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: This book presents the theory of adjoint equations in nonlinear problems and their applications to perturbation algorithms for solution of nonlinear problems in mathematical physics. It formulates a series of principles of construction of adjoint operators in nonlinear problems.

Recent Trends in Computational Engineering - Ce2014: Optimization, Uncertainty, Parallel Algorithms, Coupled and Complex Problems

Автор: Mehl Miriam, Bischoff Manfred, Schafer Michael
Название: Recent Trends in Computational Engineering - Ce2014: Optimization, Uncertainty, Parallel Algorithms, Coupled and Complex Problems
ISBN: 3319387219 ISBN-13(EAN): 9783319387215
Издательство: Springer
Рейтинг:
Цена: 46570.00 T
Наличие на складе: Есть у поставщика Поставка под заказ.
Описание: 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.


Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2)
ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
Kaspi QR
   В Контакте     В Контакте Мед  Мобильная версия