On hybrid iterative methods for nonsymmetric systems of linear equations

Numerische Mathematik

Volumn 73, Issue 4, 1996, Pages 489-506

  Manteuffel, Thomas A ^a   Starke, Gerhard ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030533709     PISSN: 0029599X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002110050202     Document Type: Article

References (21)

1. Arnoldi, W.E. (1951): The principle of minimized iterations in the solution of the matrix eigenvalue problem. Quart. Appl. Math. 9, 17-29
2. Eiermann, M. (1989): On semiiterative methods generated by Faber polynomials. Numer. Math. 56, 139-156
3. Eiermann, M. (1993): Fields of values and iterative methods. Linear Algebra Appl. 180, 167-198
4. Eiermann, M., Niethammer, W. (1983): On the construction of semiiterative methods. SIAM J. Numer. Anal. 20, 1153-1160
5. Freund, R.W. (1992): Quasi-kernel polynomials and their use in ncn-Hermitian matrix iterations. J. Comp. Appl. Math. 43, 135-158
6. Freund, R.W., Golub, G.H., Nachtigal, N.M: (1992): Iterative so ution of linear systems. Acta Numerica 1, 57-100
7. Hanke, M., Hochbruck, M., Niethammer, W. (1993): Experiments with Krylov subspace methods on a massively parallel computer. Appl. Math. 38, 440-451
8. Hausdorff, F. (1919): Der Wertevorrat einer Bilinearform. Math. Z. 3, 314-316
9. Henrici, P. (1962): Bounds for iterates, inverses, spectral variation and fields of values of non-normal matrices. Numer. Math. 4, 24-40
10. Horn, R.A, Johnson, C.R. (1991): Topics in Matrix Analysis. Cambridge University Press, Cambridge
11. Manteuffel, T.A., Otto, J. (1994) On the roots of the orthogonal polynomials and residual polynomials associated with a conjugate gradient method. J. Numer. Linear Algebra Appl. 1, 449-475
12. Manteuffel, T.A., Starke, G. (1993): On hybrid iterative methods for nonsymmetric systems of linear equations. Technical report, Department of Mathematics, University of Colorado at Denver
13. Nachtigal, N.M., Reichel, L., Trefethen, L.N. (1992): A hybrid GMRES algorithm for nonsymmetric matrix iterations. SIAM J. Matrix Anal. Appl. 13, 796-825
14. Rivlin, T.J., Shapiro, H.S. (1961): A unified approach to certain problems of approximation and minimization. J. Soc. Indust. Appl. Math. 9, 670-699
15. Saad, Y. (1980): Variations on Arnoldi's method for computing eigenelements of large unsymmetric matrices. Linear Algebra Appl. 34, 269-295
16. Saad, Y. (1989): Krylov subspace methods on supercomputers. SIAM J. Sci. Stat. Comput. 10, 1200-1232
17. Saad, Y., Schultz., M.H. (1986): GMRES: A generalized minimal residual algorithm for solving nonsymmetric linear systems SIAM J. Sci. Stat. Comput. 7, 856-869
18. Saylor, P.E., Smolarski, D.C. (1991): Implementation of an adaptive algorithm for Richardson's method. Linear Algebra Appl. 154-156, 615-646
19. Starke, G., Varga, R.S. (1993): A hybrid Arnoldi-Faber method for nonsymmetric systems of linear equations. Numer. Math. 64, 213-240
20. Tang, P.T.P. (1988): A fast algorithm for linear complex Chebyshev approximation. Math. Comp. 51, 721-739
21. Trefethen, L.N. (1990): Approximation theory and numerical linear algebra. In: Algorithms for Approximation II, pp. 336-360. Chapman & Hall