
doi: 10.1007/bf02832316
The authors consider the multisplitting method and the relaxed multisplitting method for solving a linear system of equations with a large sparse \(M\)-matrix. They prove convergence results for both classes of methods under appropriate assumptions on the relaxation parameters.
Iterative numerical methods for linear systems, Computational methods for sparse matrices, convergence, large sparse \(M\)-matrix, relaxed multisplitting method, symmetric successive overrelaxation (SSOR), multisplitting method
Iterative numerical methods for linear systems, Computational methods for sparse matrices, convergence, large sparse \(M\)-matrix, relaxed multisplitting method, symmetric successive overrelaxation (SSOR), multisplitting method
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
