Fast matrix multiplication is stable

13 years 11 months ago

Download www.cs.berkeley.edu

We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix multiplication, Numer. Math. 36 (1980), 63

James Demmel, Ioana Dumitriu, Olga Holtz, Robert K

Real-time Traffic

Algorithms | CORR 2006 | Education | Matrix Multiplication | Recursive Matrix Multiplication |

claim paper

Related Content

» Fast linear algebra is stable

» Complemental Use of Multiple Cameras for Stable Tracking of Multiple Markers

» Fast ContextFree Parsing Requires Fast Boolean Matrix Multiplication

» Fast contextfree grammar parsing requires fast boolean matrix multiplication

» Fast and Stable YAST Algorithm for Principal and Minor Subspace Tracking

» Recursive Array Layouts and Fast Matrix Multiplication

» Dynamic Programming and Fast Matrix Multiplication

» A Fast Scalable Universal Matrix Multiplication Algorithm on DistributedMemory Concurrent ...

» Recursive Array Layouts and Fast Parallel Matrix Multiplication

Post Info
More Details (n/a)

Added	11 Dec 2010
Updated	11 Dec 2010
Type	Journal
Year	2006
Where	CORR
Authors	James Demmel, Ioana Dumitriu, Olga Holtz, Robert Kleinberg

Comments (0)

Sciweavers

Fast matrix multiplication is stable

Algorithms | CORR 2006 | Education | Matrix Multiplication | Recursive Matrix Multiplication |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers