Springer-Lehrbuch - tiera.ru

Literatur zu Kapitel 8 385, Schultz, M.H. (1986): GMRES: a generalized minimal residual algorithmfor solving nonsymmetric linear systems. SIAM J. Scientific and Statistical Computing,7, 856–869.Schröder, J., Trottenberg, U. (1973): Reduktionsverfahren für Differenzengleichungenbei Randwertaufgaben I. Numer.Math. 22, 37–68., , Reutersberg, H. (1976): Reduktionsverfahren für Differenzengleichungenbei Randwertaufgaben II. Numer. Math. 26, 429–459.Sonneveldt, P. (1989): CGS, a fast Lanczos-type solver for nonsymmetric linearsystems. SIAM J. Scientific and Statistical Computing 10, 36–52.Swarztrauber, P.N. (1977): The methods of cyclic reduction, Fourier analysis andthe FACR algorithm for the discrete solution of Poisson’s equation on a rectangle.SIAM Review 19, 490–501.van der Vorst (1992): Bi-CGSTAB: A fast and smoothly converging variant ofBi-CG for the solution of non-symmetric linear systems. SIAM J. Scientific andStatistical Computing 12, 631–644.Varga, R.S. (1962): Matrix Iterative Analysis. Series in Automatic Computation.Englewood Cliffs: Prentice Hall.Wachspress, E.L. (1966): Iterative Solution of Elliptic Systems and Application to theNeutron Diffusion Equations of Reactor Physics. Englewood Cliffs, N.J.: Prentice-Hall.Wilkinson, J.H., Reinsch, C. (1971): Linear Algebra. Handbook for Automatic Computation,Vol. II. Grundlehren der mathematischen Wissenschaften in Einzeldarstellungen,Bd. 186. Berlin-Heidelberg-New York: Springer.Young, D.M. (1971): Iterative Solution of Large Linear Systems. Computer Scienceand Applied Mathematics. New York: Academic Press.