Abstract
In-place linear transformations allow input to be overwritten with the output of the transformation. This paper presents a family of in-place linear transformations based on block lower/upper (LU) decompositions, of which the known transformation via LU decomposition is a special case, and shows that the proposed family includes a class of transformations that possesses the cache-oblivious property. Furthermore, the number of cache misses and approaches for non-square matrices is discussed. The simulation shows that the proposed in-place linear transformation is faster than the existing transformation via LU decompositions.
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.
