Abstract
In the present paper, modifications of block cyclic reduction are introduced by which the often significant memory access problems of this method on vector computers can be drastically reduced. The modifications are discussed in the context of an interval arithmetic application, as interval methods are particularly sensitive to several aspects of memory access. A comparison of computation times from several numerical tests is included.
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.
