Abstract

We report on arithmetic complexity of direct solvers for g -semiband n 2 n systems. If GT denotes grand total of all operations of additions, multiplications and divisions, then in each case GT= p ( g ) n m q ( g ), where p ( g ) and q ( g ) are nonnegative polynomials of degree two and three, respectively. If divisors are not saved, GT reported here saves precisely n operations. Partial pivoting for banded systems can increase the operations counts significantly. We give these counts, and for multiple right-hand sides. For g =1 and n m 1, our results agree with known counts. Some interesting observations follow from the obtained counts.

Full Text
Paper version not known

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 call

Disclaimer: 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.