Abstract
A fast and computationally effecient algorithm for decomposing a class of matrices into a product of lower and upper (LU) triangular matrices is introduced. The class of matrices considered is almost tridiagonal with the exception being that the upper rightmost element and lower leftmost element are nonzero.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
