scientific article; zbMATH DE number 3915503
From MaRDI portal
Publication:3690950
[For the entire collection see Zbl 0536.00008.] The author studies the complexity of some methods for an asymptotically fast solution of block Toeplitz systems \(Ax=b\). He proposes a new algorithm with the complexity \(O(p^ 2N \log^ 2_ 2N+p^ 3N)\) where N is the order of the matrix A and p is the Toeplitz rank of A. Further he suggests a new block variant of the Padé-approximation method and discusses its complexity.
Recommendations
Cited in
(10)- Algorithmic complexity of the problem of occurrence in commutants and members of the lower central series
- Remarks on complexity of polynomial and special matrix computations
- On the complexity of algebraic numbers
- Complexity of the normalization of algebras
- scientific article; zbMATH DE number 3872682 (Why is no real title available?)
- scientific article; zbMATH DE number 7295748 (Why is no real title available?)
- scientific article; zbMATH DE number 3961588 (Why is no real title available?)
- Proof Complexity Meets Algebra
- scientific article; zbMATH DE number 766201 (Why is no real title available?)
- On the algebraic complexity of set equality and inclusion
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3690950)