Analysis of the binary complexity of asymptotically fast algorithms for linear system solving

1988 ◽  
Vol 22 (2) ◽  
pp. 41-49 ◽  
Author(s):  
Brent Gregory ◽  
Erich Kaltofen
2021 ◽  
Vol 37 ◽  
pp. 402-415
Author(s):  
Shinya Miyajima

Fast algorithms are proposed for calculating error bounds for a numerically computed Perron root and vector of an irreducible nonnegative matrix. Emphasis is put on the computational efficiency of these algorithms. Error bounds for the root and vector are based on the Collatz--Wielandt theorem, and estimating a solution of a linear system whose coefficient matrix is an $M$-matrix, respectively. We introduce a technique for obtaining better error bounds. Numerical results show properties of the algorithms.


2021 ◽  
Vol 396 ◽  
pp. 125859
Author(s):  
Yaru Fu ◽  
Xiaoyu Jiang ◽  
Zhaolin Jiang ◽  
Seongtae Jhang

Computing ◽  
1977 ◽  
Vol 18 (4) ◽  
pp. 317-327 ◽  
Author(s):  
D. K. Lam ◽  
A. Wouk

1981 ◽  
Vol 64 (10) ◽  
pp. 9-17 ◽  
Author(s):  
Toshimichi Saito ◽  
Hiroichi Fujita

1991 ◽  
Vol 1 (9) ◽  
pp. 1217-1227 ◽  
Author(s):  
A. A. Bakasov ◽  
N. V. Bakasova ◽  
E. K. Bashkirov ◽  
V. Chmielowski
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document