Abstract
The existence of block L U factorization without pivoting for complex symmetric block tridiagonal matrices whose real and imaginary parts are positive definite and every block has the same property is assured. Some properties of the factors of the block L U factorization for this kind of matrices are presented. By the block representation of the factorization, the growth factor proposed by Amodio and Mazzia [P. Amodio, F. Mazzia, A new approach to the backward error analysis in the L U factorization algorithm, BIT 39 (1999) 385–402], sometimes, is less than or equal to 1. Based on the growth factor, an error analysis is also considered and it shows that the factorization is stable under some reasonable assumptions. Finally, a numerical experiment on a model problem is used to verify our results.
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.
