Polynomial Based Iteration Methods for Symmetric Linear Systems
10 Angebote vergleichen

Lieferung aus: Deutschland, Versandkostenfrei.
buecher.de GmbH & Co. KG, [1].
Any book on the solution of nonsingular systems of equations is bound to start with Ax= J, but here, A is assumed to be symmetric. These systems arise frequently in scientific computing, for example, from the discretization by finite differences or by finite elements of partial differential equations. Usually, the resulting coefficient matrix A is large, but sparse. In many cases, the need to store the matrix factors rules out the application of direct solvers, such as Gaussian elimination in which case the only alternative is to use iterative methods. A natural way to exploit the sparsity structure of A is to design iterative schemes that involve the coefficient matrix only in the form of matrix-vector products. To achieve this goal, most iterative methods generate iterates Xn by the simple rule Xn = Xo + Qn-l(A)ro, where ro = f-Axo denotes the initial residual and Qn-l is some polynomial of degree n - 1. The idea behind such polynomial based iteration methods is to choose Qn-l such that the scheme converges as fast as possible.Softcover reprint of the original 1st ed. 1996. 2013. 283 S. 5 SW-Abb.,. 244 mmVersandfertig in 3-5 Tagen, Softcover.

Any book on the solution of nonsingular systems of equations is bound to start with Ax= J, but here, A is assumed to be symmetric. These systems arise frequently in scientific computing, for example, from the discretization by finite differences or by finite elements of partial differential equations. Usually, the resulting coefficient matrix A is large, but sparse. In many cases, the need to store the matrix factors rules out the application of direct solvers, such as Gaussian elimination in which case the only alternative is to use iterative methods. A natural way to exploit the sparsity structure of A is to design iterative schemes that involve the coefficient matrix only in the form of matrix-vector products. To achieve this goal, most iterative methods generate iterates Xn by the simple rule Xn = Xo + Qn-l(A)ro, where ro = f-Axo denotes the initial residual and Qn-l is some polynomial of degree n - 1. The idea behind such polynomial based iteration methods is to choose Qn-l such that the scheme converges as fast as possible. Bernd Fischer, 24.4 x 17.0 x 1.6 cm, Buch.

Lieferung aus: Deutschland, Versandkostenfrei, Shipping in 3 days.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen

Von Händler/Antiquariat, Revaluation Books [2134736], Exeter, United Kingdom.
reprint edition. German language. 9.60x6.60 inches. In Stock.

Lieferung aus: Deutschland, Gewöhnlich versandfertig in 24 Stunden.
Von Händler/Antiquariat, Amazon.de.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen

Lieferung aus: Deutschland, Versandfertig in 1 - 2 Werktagen.
Von Händler/Antiquariat, ---SuperBookDeals---.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen

Lieferung aus: Deutschland, Lagernd, zzgl. Versandkosten.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen

Von Händler/Antiquariat, AHA-BUCH GmbH [51283250], Einbeck, NDS, Germany.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen

Lieferung aus: Deutschland, Lagernd, zzgl. Versandkosten.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen

Lieferung aus: Vereinigtes Königreich Grossbritannien und Nordirland, Lagernd.
Entwurf, Finite-Elemente-Methode, Konstruktion, Matrix, Polynom, Engineering; Engineering, general, eBook.