scientific article; zbMATH DE number 3915503

MaRDI QIDQ3690950zbMATH OpenFDO

Authors E. E. Tyrtyshnikov

Publication date 1982

zbMATH Keywords

block Toeplitz systemscomplexityPadé-approximation method

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 766201
• scientific article; zbMATH DE number 766291
• On the fast solution of Toeplitz-block linear systems arising in multivariate approximation theory
• scientific article; zbMATH DE number 4135298
• A fast algorithm for solving a Toeplitz system of equations

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)