國立高雄大學圖資館 |

Language: English

Back

Iterative solution of large sparse s...

Hackbusch, Wolfgang.

Iterative solution of large sparse systems of equations

Record Type:	Electronic resources : Monograph/item
Title/Author:	Iterative solution of large sparse systems of equationsby Wolfgang Hackbusch.
Author:	Hackbusch, Wolfgang.
Published:	Cham :Springer International Publishing :2016.
Description:	xxiii, 509 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
Subject:	Iterative methods (Mathematics)
Online resource:	http://dx.doi.org/10.1007/978-3-319-28483-5
ISBN:	9783319284835$q(electronic bk.)

Iterative solution of large sparse systems of equations
Hackbusch, Wolfgang.

Iterative solution of large sparse systems of equations[electronic resource] /by Wolfgang Hackbusch. - 2nd ed. - Cham :Springer International Publishing :2016. - xxiii, 509 p. :ill., digital ;24 cm. - Applied mathematical sciences,v.950066-5452 ;. - Applied mathematical sciences ;v.176..

Part I: Linear Iterations -- Introduction -- Iterative Methods -- Classical Linear Iterations in the Positive Definite Case -- Analysis of Classical Iterations Under Special Structural Conditions -- Algebra of Linear Iterations -- Analysis of Positive Definite Iterations -- Generation of Iterations. Part II: Semi-Iterations and Krylov Methods -- Semi-Iterative Methods -- Gradient Methods -- Conjugate Gradient Methods and Generalizations -- Part III: Special Iterations -- Multigrid Iterations -- Domain Decomposition and Subspace Methods -- H-LU Iteration -- Tensor-based Methods -- Appendices.

In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature. The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms. The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.

ISBN: 9783319284835$q(electronic bk.)

Standard No.: 10.1007/978-3-319-28483-5doiSubjects--Topical Terms:

185853
Iterative methods (Mathematics)

LC Class. No.: QA297.8

Dewey Class. No.: 518.26

Iterative solution of large sparse systems of equations
LDR:02689nmm a2200349 a 4500 001 490715
003 DE-He213
005 20161129144659.0
006 m d
007 cr nn 008maaau
008 170118s2016 gw s 0 eng d
020 $a 9783319284835$q(electronic bk.)
020 $a 9783319284811$q(paper)
024 7 $a 10.1007/978-3-319-28483-5 $2 doi
035 $a 978-3-319-28483-5
040 $a GP $c GP
041 0 $a eng
050 4 $a QA297.8
072 7 $a PBKS $2 bicssc
072 7 $a MAT021000 $2 bisacsh
072 7 $a MAT006000 $2 bisacsh
082 0 4 $a 518.26 $2 23
090 $a QA297.8 $b .H118 2016
100 1 $a Hackbusch, Wolfgang. $3 485958
245 1 0 $a Iterative solution of large sparse systems of equations $h [electronic resource] / $c by Wolfgang Hackbusch.
250 $a 2nd ed.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xxiii, 509 p. : $b ill., digital ; $c 24 cm.
490 1 $a Applied mathematical sciences, $x 0066-5452 ; $v v.95
505 0 $a Part I: Linear Iterations -- Introduction -- Iterative Methods -- Classical Linear Iterations in the Positive Definite Case -- Analysis of Classical Iterations Under Special Structural Conditions -- Algebra of Linear Iterations -- Analysis of Positive Definite Iterations -- Generation of Iterations. Part II: Semi-Iterations and Krylov Methods -- Semi-Iterative Methods -- Gradient Methods -- Conjugate Gradient Methods and Generalizations -- Part III: Special Iterations -- Multigrid Iterations -- Domain Decomposition and Subspace Methods -- H-LU Iteration -- Tensor-based Methods -- Appendices.
520 $a In the second edition of this classic monograph, complete with four new chapters and updated references, readers will now have access to content describing and analysing classical and modern methods with emphasis on the algebraic structure of linear iteration, which is usually ignored in other literature. The necessary amount of work increases dramatically with the size of systems, so one has to search for algorithms that most efficiently and accurately solve systems of, e.g., several million equations. The choice of algorithms depends on the special properties the matrices in practice have. An important class of large systems arises from the discretization of partial differential equations. In this case, the matrices are sparse (i.e., they contain mostly zeroes) and well-suited to iterative algorithms. The first edition of this book grew out of a series of lectures given by the author at the Christian-Albrecht University of Kiel to students of mathematics. The second edition includes quite novel approaches.
650 0 $a Iterative methods (Mathematics) $3 185853
650 0 $a Differential equations, Partial $x Numerical solutions. $3 185034
650 1 4 $a Mathematics. $3 184409
650 2 4 $a Numerical Analysis. $3 275681
650 2 4 $a Linear and Multilinear Algebras, Matrix Theory. $3 274063
650 2 4 $a Partial Differential Equations. $3 274075
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Applied mathematical sciences ; $v v.176. $3 557779
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-28483-5
950 $a Mathematics and Statistics (Springer-11649)