Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-mkpzs Total loading time: 0 Render date: 2024-12-23T05:38:14.155Z Has data issue: false hasContentIssue false

10 - Fast Eigensolvers

Published online by Cambridge University Press:  05 October 2013

George Em Karniadakis
Affiliation:
Brown University, Rhode Island
Robert M. Kirby II
Affiliation:
University of Utah
Get access

Summary

In this chapter we introduce methods for solutions of the standard eigenvalue problem

Ax = λx,

where A is a square n × n matrix, as well as for generalized eigenproblems. The main theory is based on the solvers of the previous chapter for linear systems. Unlike, however, the methods of the previous chapter where both direct and iterative approaches are effective, in eigenvalue problems only iterative solvers are efficient. We start with the simple power method and its variants, and we proceed with more sophisticated methods including a method for nonsymmetric eigenproblems using the Arnoldi iteration. We classify the different eigensolvers as local or global depending on whether they are typically used to compute one or two eigenvalues or the entire spectrum, respectively.

We introduce one new MPI function, MPI_Alltoall, and demonstrate its use through some of the algorithms presented in this chapter. In addition, we reiterate the use of MPI_Allgather and MPI_Allreduce through example implementations of algorithms.

LOCAL EIGENSOLVERS

We have already seen in Chapter 2 that computing the eigenvalues accurately from the determinant may not always be possible. The Newton-Raphson method of Chapter 4 is an accurate method of computing the roots of the characteristic polynomial, but it can be extremely inefficient for large systems. In the following, we present a simple method to compute iteratively the maximum and minimum eigenvalues and corresponding eigenvectors. We can also compute any other eigenvalue for which we have a good initial guess.

Type
Chapter
Information
Parallel Scientific Computing in C++ and MPI
A Seamless Approach to Parallel Algorithms and their Implementation
, pp. 538 - 574
Publisher: Cambridge University Press
Print publication year: 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure [email protected] is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

Available formats
×