Two fast algorithms for finding the solution of the lower Hessenberg quasi-Toeplitz linear system from Markov chain
Abstract We present two fast algorithms for finding the solution of the nonsingular lower Hessenberg quasi-Toeplitz linear system stem from Markov chain. And we confirm the complexity of these two algorithms is both O $$(n\log n)$$ based on the fact that a lower Hessenberg quasi-Toeplitz matrix can...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2025-07-01
|
| Series: | Scientific Reports |
| Subjects: | |
| Online Access: | https://doi.org/10.1038/s41598-025-06791-3 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|