Some improvements on the convergence of the interval maor method
From MaRDI portal
Publication:4489985
The paper is concerned with an interval iterative method for solving linear systems. The author presents upper and lower bounds for the spectral radius of the iteration matrix, generalising some of his earlier results. Also, an interval version of the modified accelerated overrelaxation method (MAOR) is considered and sufficient conditions for convergence are established, when the interval matrix of the system belongs to some classes. Numerical examples, are presented for illustrative purpose.
Recommendations
Cites work
- Convergence of Matrix Iterations Subject to Diagonal Dominance
- Extended convergence regions for the AOR method
- scientific article; zbMATH DE number 3366440 (Why is no real title available?)
- New techniques for the analysis of linear interval equations
- On the convergence of the interval MAOR method
- On the convergence of the modified accelerated overrelaxation (MAOR) method
- The AOR method for solving linear interval equations
- The upper bound of the spectral radius of M-1N and convergence of some iterative methods
Cited in
(7)- A new class of interval methods with higher order of convergence
- On the convergence of the modified accelerated overrelaxation (MAOR) method
- A note on the convergence of the MAOR method
- On the convergence of the interval MAOR method
- How to improve MAOR method convergence area for linear complementarity problems
- Convergence of the interval and point TOR method
- An interval extension of SMS method for computing weighted Moore-Penrose inverse
This page was built for publication: Some improvements on the convergence of the interval maor method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489985)