Convergence of nested classical iterative methods for linear systems

Numerische Mathematik

Volumn 58, Issue 1, 1990, Pages 685-702

  Lanzkron, Paul J ^a   Rose, Donald J ^a   Szyld, Daniel B ^a  

^a DUKE UNIVERSITY   (United States)

Author keywords

Subject classifications: AMS(MOS): 65F10, CR: G1.3

Indexed keywords

EID: 0001759094     PISSN: 0029599X     EISSN: 09453245     Source Type: Journal    
DOI: 10.1007/BF01385649     Document Type: Article

References (29)

1. Global approximate Newton methods
2. Asynchronous iterative methods for multiprocessors
3. Chaotic relaxation
4. Comparisons of regular splittings of matrices
5. Inexact newton methods
6. Comparisons of weak regular splittings and multisplitting methods
7. Two-stage fictitious components methods for solving the Dirichlet boundary value problem
8. Convergence of a two-stage Richardson iterative procedure for solving systems of linear equations
9. The convergence of inexact Chebyshev and Richardson iterative methods for solving linear systems
10. Comparison theorems for weak splittings of bounded operators
11. Algorithmes de relaxation à retards
12. A note on comparison theorems for nonnegative mtrices
13. Convergence of parallel multisplitting methods for M-matrices
14. On the convergence of two-stage iterative processes for solving linear equations
15. Multi-splittings of matrices and parallel solution of linear systems
16. Monotone iterations for nonlinear equations with application to Gauss-Seidel methods
17. A simple approach to the Perron-Frobenius theory for positive operators on general partially-ordered finite-dimensional linear spaces
18. Itérations chaotiques série-parallèle pour des équations non-linéaires de point fixe
19. Inner/outer iterative methods and numerical Schwarz algorithms
20. Factorization and normalized iterative methods