Computational Complexity and Numerical Stability of Linear Problems Export

@article{citeulike:4746150, abstract = {We survey classical and recent developments in numerical linear algebra, focusing on two issues: computational complexity, or arithmetic costs, and numerical stability, or performance under roundoff error. We present a brief account of the algebraic complexity theory as well as the general error analysis for matrix multiplication and related problems. We emphasize the central role played by the matrix multiplication problem and discuss historical and modern approaches to its solution.}, archivePrefix = {arXiv}, author = {Holtz, Olga and Shomron, Noam}, citeulike-article-id = {4746150}, citeulike-linkout-0 = {http://arxiv.org/abs/0906.0687}, citeulike-linkout-1 = {http://arxiv.org/pdf/0906.0687}, day = {3}, eprint = {0906.0687}, keywords = {article, linearalgebra, matrix}, month = {Jun}, posted-at = {2009-06-04 17:21:59}, priority = {2}, title = {Computational Complexity and Numerical Stability of Linear Problems}, url = {http://arxiv.org/abs/0906.0687}, year = {2009} }

TY - JOUR ID - citeulike:4746150 L3 - citeulike-article-id:4746150 N2 - We survey classical and recent developments in numerical linear algebra, focusing on two issues: computational complexity, or arithmetic costs, and numerical stability, or performance under roundoff error. We present a brief account of the algebraic complexity theory as well as the general error analysis for matrix multiplication and related problems. We emphasize the central role played by the matrix multiplication problem and discuss historical and modern approaches to its solution. TI - Computational Complexity and Numerical Stability of Linear Problems KW - article KW - linearalgebra KW - matrix AU - Holtz, Olga AU - Shomron, Noam PY - 2009/Jun/03/ UR - http://arxiv.org/abs/0906.0687 ER -