Matrix methods. An introduction to algebraic complexity

zbMath1087.65041arXiv1604.00795MaRDI QIDQ1414899

Jounaïdi Abdeljaoued, Henri Lombardi

Publication date: 8 December 2003

Published in: Mathématiques \& Applications (Berlin) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.00795

zbMATH Keywords

algorithmsmatrix methodstextbookparallel computationalgebraic complexityfast matrix multiplicationfast polynomial multiplication

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Parallel numerical computation (65Y05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Complexity and performance of numerical algorithms (65Y20) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Research exposition (monographs, survey articles) pertaining to linear algebra (15-02)

Related Items

Inversion Modulo Zero-Dimensional Regular Chains, Formal reduction of singular linear differential systems using eigenrings: a refined approach, Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases