Titlebook: Iterative Solution of Large Sparse Systems of Equations; Wolfgang Hackbusch Book 2016Latest edition Springer International Publishing Swit

Fuctionary

書目名稱Iterative Solution of Large Sparse Systems of Equations影響因子(影響力)




書目名稱Iterative Solution of Large Sparse Systems of Equations影響因子(影響力)學(xué)科排名




書目名稱Iterative Solution of Large Sparse Systems of Equations網(wǎng)絡(luò)公開度




書目名稱Iterative Solution of Large Sparse Systems of Equations網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Iterative Solution of Large Sparse Systems of Equations被引頻次




書目名稱Iterative Solution of Large Sparse Systems of Equations被引頻次學(xué)科排名




書目名稱Iterative Solution of Large Sparse Systems of Equations年度引用




書目名稱Iterative Solution of Large Sparse Systems of Equations年度引用學(xué)科排名




書目名稱Iterative Solution of Large Sparse Systems of Equations讀者反饋




書目名稱Iterative Solution of Large Sparse Systems of Equations讀者反饋學(xué)科排名

abstemious

handle

Gradient Methodection 9.3 we discuss the drawback of the gradient directions and introduce the conjugate directions in preparation for the conjugate gradient method in the next chapter. The final Section 9.4 mentions a variant of the gradient method: the minimal residual iteration which can be applied to any regular matrix ..

財(cái)政

ESPY

精致

Domain Decomposition and Subspace MethodsHere we distinguish between the additive and multiplicative subspace iteration as explained in the corresponding Sections 12.6 and 12.7. Illustrations follow in Section 12.8. Interestingly, multigrid iterations can also be considered as subspace iterations as analysed in Section 12.9.

價(jià)值在貶值

Introductiondirect solution by the Gauss elimination is determined. This cost can be compared with the cost of the iterative methods introduced later. In Section 1.6, the Gauss–Seidel and SOR iteration are presented as first examples of linear iterations. Finally, in Section 1.7, sparsity of the underlying matrix discussed.

jarring

Fissure

裁決

-LU Iterationrrespondingly, the .-LU iteration described in Section 13.4 is very fast. The variant discussed in . 13.4.2 is purely algebraic, i.e., the data needed for the iteration are only based on the underlying matrix. Concerning details about the technique of hierarchical matrices, we refer to Appendix D.