Abstract
Feasibility results are generalized for the interval arithmetic versions of Gaussian elimination and of total-step, single-step, and symmetric single-step methods to block methods. It is shown that block Gaussian elimination is always feasible for H-matrices and for a new class of interval matrices. Convergence results for the block iterative methods are given and the quality of the enclosure and the speed of convergence are compared with respect to the fineness of the partition into blocks of the given matrix.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
