Fast Multiplication of Matrices with Decay

Details Fast Multiplication of Matrices with Decay Fast Multiplication of Matrices with Decay

2010-11-15

arxiv.org/abs/1011.3534v1

Computer Science

Data Structures and Algorithms

Scientific paper

A fast algorithm for the approximate multiplication of matrices with decay is introduced; the Sparse Approximate Matrix Multiply (SpAMM) reduces complexity in the product space, a different approach from current methods that economize within the matrix space through truncation or rank reduction. Matrix truncation (element dropping) is compared to SpAMM for quantum chemical matrices with approximate exponential and algebraic decay. For matched errors in the electronic total energy, SpAMM is found to require fewer to far fewer floating point operations relative to dropping. The challenges and opportunities afforded by this new approach are discussed, including the potential for high performance implementations.

Affiliated with

Also associated with

No associations

Rating

Fast Multiplication of Matrices with Decay does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Fast Multiplication of Matrices with Decay, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast Multiplication of Matrices with Decay will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-463084