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

Interative Methods for Optimization, C.T. Kelley


Варианты приобретения
Цена: 61870.00T
Кол-во:
 о цене
Наличие: Невозможна поставка.

в Мои желания

Автор: C.T. Kelley
Название:  Interative Methods for Optimization
ISBN: 9780898714333
Издательство: Mare Nostrum (Eurospan)
Классификация:






ISBN-10: 0898714338
Обложка/Формат: Paperback
Страницы: 195
Вес: 0.04 кг.
Дата издания: 1999-07-31
Серия: Frontiers in applied mathematics
Язык: English
Иллюстрации: Illustrations
Размер: 253 x 179 x 12
Читательская аудитория: Professional and scholarly
Основная тема: Optimization,Applied mathematics
Рейтинг:
Поставляется из: Англии
Описание: Presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis rather than generality.

Interative Methods for Solving Linear Systems

Автор: Anne Greenbaum
Название: Interative Methods for Solving Linear Systems
ISBN: 089871396X ISBN-13(EAN): 9780898713961
Издательство: Marston Book Services
Рейтинг:
Цена: 88300.00 T
Наличие на складе: Поставка под заказ.
Описание: Much recent research has concentrated on the efficient solution of large sparse or structured linear systems using iterative methods. A language loaded with acronyms for a thousand different algorithms has developed, and it is often difficult even for specialists to identify the basic principles involved. Here is a book that focuses on the analysis of iterative methods.

The author includes the most useful algorithms from a practical point of view and discusses the mathematical principles behind their derivation and analysis. Several questions are emphasized throughout: Does the method converge? If so, how fast? Is it optimal, among a certain class? If not, can it be shown to be near-optimal? The answers are presented clearly, when they are known, and remaining important open questions are laid out for further study. Greenbaum includes important material on the effect of rounding errors on iterative methods that has not appeared in other books on this subject.

Additional important topics include a discussion of the open problem of finding a provably near-optimal short recurrence for non-Hermitian linear systems; the relation of matrix properties such as the field of values and the pseudospectrum to the convergence rate of iterative methods; comparison theorems for preconditioners and discussion of optimal preconditioners of specified forms; introductory material on the analysis of incomplete Cholesky, multigrid, and domain decomposition preconditioners, using the diffusion equation and the neutron transport equation as example problems. A small set of recommended algorithms and implementations is included.



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