Abstract
Based on both the lower and the upper triangular Cholesky decomposition algorithms, the (inverse) lower triangular Cholesky integer transformation and the (inverse) upper triangular Cholesky integer transformation are defined, and the (inverse) paired Cholesky integer transformation is proposed. Then, for the case of high-correlation ambiguity, a multi-time (inverse) paired Cholesky integer transformation is given. In addition, a simple and practical criterion is presented to solve the uniqueness problem of the integer transformation. It is verified by an example that (1) the (inverse) paired Cholesky integer transformation is very convenient and very efficient in practical computation; (2) the (inverse) paired Cholesky integer transformation is better than both the (inverse) lower triangular Cholesky integer transformation and the (inverse) upper triangular Cholesky integer transformation; and that (3) the inverse paired Cholesky integer transformation outperforms the paired Cholesky integer transformation slightly in the most cases.
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.
