Iteration Methods

Prem K. Kythe and Pratap Puri
Additional contact information
Prem K. Kythe: University of New Orleans
Pratap Puri: University of New Orleans, Department of Mathematics

Chapter 6 in Computational Methods for Linear Integral Equations, 2002, pp 146-174 from Springer

Abstract: Abstract In this chapter we discuss some iteration methods that arise quite naturally. For smaller systems the iterative methods are sometimes faster than the Gaussian elimination method. However, the iterative methods get very complicated to program, and the Gaussian method is still preferred. It seems that the Nyström method with product integration (Section 4.2) is a better numerical method. Iterative methods for singular equations are presented in Section 7.8 and those for the FK1/VK1 in Section 11.7.

Keywords: Harmonic Function; Dirichlet Problem; Iteration Method; Iterative Scheme; Quadrature Formula (search for similar items in EconPapers)
Date: 2002
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-4612-0101-4_6

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

DOI: 10.1007/978-1-4612-0101-4_6

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 ().