Abstract
In this paper, the nonsingular CUPL-Toeplitz linear system from Markov chain is solved. We introduce two fast approaches whose complexity could be considered to be O(nlogn) based on the splitting method of the CUPL-Toeplitz matrix which equals to a Toeplitz matrix minus a rank-one matrix. Finally, we confirm the performance of the new algorithms by three numerical experiments.
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.
