Computational Complexity and Numerical Stability of Linear Problems

zbMath1192.65173arXiv0906.0687MaRDI QIDQ3567819

Noam Shomron, O. V. Holtz

Publication date: 17 June 2010

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

zbMATH Keywords

Fourier transformgroup algebrasnumerical stabilityQR decompositionroundoff errormatrix inversionSylvester equationwreath productarithmetic complexitytensor ranktensorsbilinear algorithmsmatrix multiplicationmultiplicative complexityLU decompositionSchur formrank revealing decompositionarithmetic operationsborder rankStrassen's algorithmasymptotic complexitybit operationsclassical model of arithmetic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Roundoff error (65G50) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity and performance of numerical algorithms (65Y20) Numerical linear algebra (65Fxx)

Uses Software

• ScaLAPACK

This page was built for publication: Computational Complexity and Numerical Stability of Linear Problems