[1825 days] Krylov Solvers for Linear Algebraic Systems: Krylov Solvers
[1825 days] Krylov Solvers for Linear Algebraic Systems: Krylov Solvers [1825 days] Krylov Solvers for Linear Algebraic Systems: Krylov Solvers

[1825 days] Krylov Solvers for Linear Algebraic Systems: Krylov Solvers

CHI TIẾT SẢN PHẨM

Mã sản phẩm:
9780444514745
Tồn kho:
Còn hàng
Nhà xuất bản:
Loại bìa:
Page Fidelity
Ngôn ngữ:
English
Tác giả:
Broyden, Charles George; Vespucci, Maria Teresa


Special Price 5,969,000 VNĐ

Còn VNĐ nữa bạn sẽ được miễn phí giao hàngTìm hiểu thêm

Mua hàng số lượng lớn

Thời gian giao hàng Xem thêm

Chính sách đổi trả Xem thêm

Số lượng

The first four chapters of this book give a comprehensive and unified theory of the Krylov methods. Many of these are shown to be particular examples of
the block conjugate-gradient algorithm and it is this observation that
permits the unification of the theory. The two major sub-classes of those
methods, the Lanczos and the Hestenes-Stiefel, are developed in parallel as
natural generalisations of the Orthodir (GCR) and Orthomin algorithms. These
are themselves based on Arnoldi's algorithm and a generalised Gram-Schmidt
algorithm and their properties, in particular their stability properties,
are determined by the two matrices that define the block conjugate-gradient
algorithm. These are the matrix of coefficients and the preconditioning
matrix.

In Chapter 5 the"transpose-free" algorithms based on the conjugate-gradient squared algorithm are presented while Chapter 6 examines the various ways in which the QMR technique has been exploited. Look-ahead methods and general block methods are dealt with in Chapters 7 and 8 while Chapter 9 is devoted to error analysis of two basic algorithms.

In Chapter 10 the results of numerical testing of the more important algorithms in their basic forms (i.e. without look-ahead or preconditioning) are presented and these are related to the structure of the algorithms and the general theory. Graphs illustrating the performances of various algorithm/problem combinations are given via a CD-ROM.

Chapter 11, by far the longest, gives a survey of preconditioning techniques. These range from the old idea of polynomial preconditioning via SOR and ILU preconditioning to methods like SpAI, AInv and the multigrid methods that were developed specifically for use with parallel computers. Chapter 12 is devoted to dual algorithms like Orthores and the reverse algorithms of Hegedus. Finally certain ancillary matters like reduction to Hessenberg form, Chebychev polynomials and the companion matrix are described in a series of appendices.

· comprehensive and unified approach
· up-to-date chapter on preconditioners
· complete theory of stability
· includes dual and reverse methods
· comparison of algorithms on CD-ROM
· objective assessment of algorithms

Sản phẩm liên quan

New
[1825 days] Current Topics in Developmental Biology

This serial provides a comprehensive survey of the major topics in the field of developmental biolog..

5,461,000 VNĐ

New
[1825 days] Cavity-Enhanced Spectroscopies

"Cavity-Enhanced Spectroscopy" discusses the use of optical resonators and lasers to make sensitive ..

5,334,000 VNĐ

New
[1825 days] PCR in Neuroscience: PCR in Neuroscience

The volumes in this series include contemporary techniques significant to a particular branch of neu..

1,853,000 VNĐ

New
[1825 days] Rankin v. McPherson, 483 U.S. 378

This title is from the Hayes Barton Press "Originals" series, a collection of classic fiction and no..

38,000 VNĐ

New
[1825 days] INTERNATIONAL REVIEW OF CYTOLOGY V107

INTERNATIONAL REVIEW OF CYTOLOGY V107..

1,853,000 VNĐ

New
[1825 days] Science of Ceramic Interfaces II

This collection of papers arose from the Proceedings of the International Workshop on Interfaces of ..

1,853,000 VNĐ

New
[30 days] Sensor Technology Handbook

Without sensors most electronic applications would not exist—they perform a vital function, namely p..

1,614,500 VNĐ

0898536989