Iterative Methods

Robert M. Corless and Nicolas Fillion
Additional contact information
Robert M. Corless: University of Western Ontario, Applied Mathematics
Nicolas Fillion: University of Western Ontario, Applied Mathematics

Chapter Chapter 7 in A Graduate Introduction to Numerical Methods, 2013, pp 307-325 from Springer

Abstract: Abstract This chapter looks at iterative methods to solve linear systems and at some alternative methods to solve eigenvalue problems. That is, we now look at iteration instead of using a finite number of noniterative steps. Iterative methods for solving eigenvalue problems are, of course, completely natural. We looked at power iteration and at the QR iteration in Chap. 5 ; here we look at some methods that take advantage of sparsity or structure. We also use one pass of iterative refinement to improve structured backward error. ⊲

Keywords: Iterative Method; Iterative Refinement; Seidel Method; Biconjugate Gradient; Jacobi Iteration (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-8453-0_7

Ordering information: This item can be ordered from
http://www.springer.com/9781461484530

DOI: 10.1007/978-1-4614-8453-0_7

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().