Krylov Solvers for Linear Algebraic Systems: Krylov Solvers (Volume 11) (Studies in Computational Mathematics, Volume 11) - Image 1

£37.37

Elsevier Krylov Solvers for Linear Algebraic Systems: Krylov Solvers (Volume 11) (Studies in Computational Mathematics, Volume 11)

Name: Krylov Solvers for Linear Algebraic Systems: Krylov Solvers (Volume 11) (Studies in Computational Mathematics, Volume 11)
Brand: Elsevier
Price: 37.37 GBP
Availability: InStock

Civil Engineering

It has never been this cheap. We have no record of a lower price.

£37 today · cheaper than every other day in the last 3 months

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 22 days • 22 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 22 days • 1 price levels

Days at Price

Price Analysis

Most common price: £37 (22 days, 100.0%)

Price range: £37 - £37

Price levels: 1 different prices over 22 days

Description

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 ofthe block conjugate-gradient algorithm and it is this observation thatpermits the unification of the theory. The two major sub-classes of thosemethods, the Lanczos and the Hestenes-Stiefel, are developed in parallel asnatural generalisations of the Orthodir (GCR) and Orthomin algorithms. Theseare themselves based on Arnoldi's algorithm and a generalised Gram-Schmidtalgorithm and their properties, in particular their stability properties,are determined by the two matrices that define the block conjugate-gradientalgorithm. These are the matrix of coefficients and the preconditioningmatrix.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

Product Specifications

Brand: Elsevier
Format: hardcover
ASIN: 0444514740
Category: Books > Subjects > Science, Nature & Maths > Engineering & Technology > Civil Engineering
Domain: Amazon UK
Release Date: 12 September 2004
Listed Since: 06 February 2007

Barcode

No barcode data available

Elsevier Krylov Solvers for Linear Algebraic Systems: Krylov Solvers (Volume 11) (Studies in Computational Mathematics, Volume 11)

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

A Survey of Preconditioned Iterative Methods: 328 (Chapman & Hall/CRC Research Notes in Mathematics Series)

Numerical Linear Algebra: Theorems, Proofs, and Python Implementations (Computational Mathematics Library)

Krylov Methods for Nonsymmetric Linear Systems: From Theory to Computations: 57 (Springer Series in Computational Mathematics, 57)

Krylov Methods for Nonsymmetric Linear Systems: From Theory to Computations: 57 (Springer Series in Computational Mathematics, 57)

Iterative Krylov Methods for Large Linear Systems: 13 (Cambridge Monographs on Applied and Computational Mathematics, Series Number 13)

Separable Type Representations of Matrices and Fast Algorithms: Volume 1 Basics. Completion Problems. Multiplication and Inversion Algorithms: 234 (Operator Theory: Advances and Applications, 234)

Parallel Algorithms in Computational Science and Engineering (Modeling and Simulation in Science, Engineering and Technology)

Guaranteed Accuracy in Numerical Linear Algebra: 252 (Mathematics and Its Applications, 252)

High Performance Computing - HiPC 2002: 9th International Conference Bangalore, India, December 18-21, 2002, Proceedings: 2552 (Lecture Notes in Computer Science, 2552)

The Art of High Performance Computing for Computational Science, Vol. 1: Techniques of Speedup and Parallelization for General Purposes

Algorithms for Large Scale Linear Algebraic Systems:: Applications in Science and Engineering: 508 (Nato Science Series C:, 508)

Algorithms for Large Scale Linear Algebraic Systems:: Applications in Science and Engineering: 508 (Nato Science Series C:, 508)

DIRECT METHODS FOR SPARSE MATRICES 2E (Numerical Mathematics and Scientific Computation)

Parallel Processing and Applied Mathematics: 13th International Conference, PPAM 2019, Bialystok, Poland, September 8–11, 2019, Revised Selected ... (Lecture Notes in Computer Science, 12043)

High Performance Algorithms for Structured Matrix Problems (Advances in the Theory of Computation and Computational Math)

Parallelism in Matrix Computations (Scientific Computation)

Domain Decomposition Methods in Science and Engineering XXI: 98 (Lecture Notes in Computational Science and Engineering, 98)

Domain Decomposition Methods in Science and Engineering XXI: 98 (Lecture Notes in Computational Science and Engineering, 98)

Model Reduction of Complex Dynamical Systems: 171 (International Series of Numerical Mathematics, 171)

Perturbation Theory for Matrix Equations (Volume 9) (Studies in Computational Mathematics, Volume 9)

Parallel Processing for Scientific Computing: 20 (Software, Environments and Tools, Series Number 20)

Parallel Numerical Algorithms: 4 (ICASE LaRC Interdisciplinary Series in Science and Engineering, 4)

Krylov Subspace Methods for Linear Systems: Principles of Algorithms: 60 (Springer Series in Computational Mathematics, 60)

Applied Linear Algebra (Undergraduate Texts in Mathematics)