Pole-Swapping Algorithms for the Eigenvalue Problem

Name: Pole-Swapping Algorithms for the Eigenvalue Problem
Brand: SIAM - SOCIETY FOR INDUSTRIAL AND APPLIED
Price: 112.75 AUD
Availability: BackOrder

By: Daan Camps, Thomas Mach, Raf Vandebril, David S. Watkins

Write A Review

Paperback | 29 October 2025

At a Glance

Paperback
96 Pages

Dimensions(cm)
15.0 x 150.0 x 250.0

Paperback

RRP $113.00

$112.75

or 4 interest-free payments of $28.19 with

Available for Backorder. We will order this from our supplier however there isn't a current ETA.

Matrix eigenvalue problems arise in a wide variety of fields in science and engineering, so it is important to have reliable and efficient methods for solving them. Of the methods devised, bulge-chasing algorithms, such as the famous QR and QZ algorithms, are the most important. This book focuses on pole-swapping algorithms, a new class of methods that are generalizations of bulge-chasing algorithms and a bit faster and more accurate owing to their inherent flexibility. The pole-swapping theory developed by the authors sheds light on the functioning of the whole class of algorithms, including QR and QZ. The only book on the topic, Pole-Swapping Algorithms for the Eigenvalue Problem describes the state of the art on eigenvalue methods and provides an improved understanding and explanation of why these important algorithms work. Audience This book is for researchers and students in the field of matrix computations, software developers, and anyone in academia or industry who needs to understand how to solve eigenvalue problems, which are ubiquitous in science and engineering.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $0.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.