Abstract
The textured, iterative approximation algorithms are a class fast linear equation solvers and differ from the classical iterative algorithms fundamentally in their approximations of system matrices. The textured approach uses different approximations of a system matrix in a round-robin fashion while the classical approaches use a single fixed approximation. It therefore has a better approximation of system matrix and a potentially faster speed. In this paper we prove that the convergent speed of the textured iterative algorithms for linear equations with a class of tridiagonal system matrices is strictly faster than the corresponding classical iterative algorithms. We also give the spectral radii of the textured iterative and classical algorithms for this class of linear equations. These results provide some insights and theoretical supports for the textured iterative algorithms.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
