11,95 €
11,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
6 °P sammeln
11,95 €
11,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
6 °P sammeln
Als Download kaufen
11,95 €
inkl. MwSt.
Sofort per Download lieferbar
payback
6 °P sammeln
Jetzt verschenken
11,95 €
inkl. MwSt.
Sofort per Download lieferbar

Alle Infos zum eBook verschenken
payback
6 °P sammeln
  • Format: ePub

This graduate-level text examines the practical use of iterative methods in solving large, sparse systems of linear algebraic equations and in resolving multidimensional boundary-value problems. Assuming minimal mathematical background, it profiles the relative merits of several general iterative procedures. Topics include polynomial acceleration of basic iterative methods, Chebyshev and conjugate gradient acceleration procedures applicable to partitioning the linear system into a red/black block form, adaptive computational algorithms for the successive overrelaxation (SOR) method, and…mehr

  • Geräte: eReader
  • mit Kopierschutz
  • eBook Hilfe
  • Größe: 30.85MB
Produktbeschreibung
This graduate-level text examines the practical use of iterative methods in solving large, sparse systems of linear algebraic equations and in resolving multidimensional boundary-value problems. Assuming minimal mathematical background, it profiles the relative merits of several general iterative procedures. Topics include polynomial acceleration of basic iterative methods, Chebyshev and conjugate gradient acceleration procedures applicable to partitioning the linear system into a red/black block form, adaptive computational algorithms for the successive overrelaxation (SOR) method, and computational aspects in the use of iterative algorithms for solving multidimensional problems. 1981 edition. 48 figures. 35 tables.

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, D ausgeliefert werden.


Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Autorenporträt
Louis A. Hageman and David M. Young