Abstract
In a recent paper the author has demonstrated how to derive inclusions of solutions of systems of equations from hypernorm estimates and a procedure for computing upper bounds for vectors of the type ( I − K) −1 v, where I denotes the unit matrix, K a nonnegative matrix with spectral radius less than 1 and v a nonnegative vector. In this paper one of the resulting methods based on the same information as well-known interval arithmetic methods developed by S.M. Rump is studied. Two algorithms for computing componentwise inclusions, one for solutions of nonlinear problems and one for solutions of linear problems are presented. Comparisons with corresponding algorithms suggested by Rump are carried out for two concrete problems.
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.
