Using Approximate Computing for the Calculation of Inverse Matrix p-th Roots

03/07/2017
by   Michael Lass, et al.
0

Approximate computing has shown to provide new ways to improve performance and power consumption of error-resilient applications. While many of these applications can be found in image processing, data classification or machine learning, we demonstrate its suitability to a problem from scientific computing. Utilizing the self-correcting behavior of iterative algorithms, we show that approximate computing can be applied to the calculation of inverse matrix p-th roots which are required in many applications in scientific computing. Results show great opportunities to reduce the computational effort and bandwidth required for the execution of the discussed algorithm, especially when targeting special accelerator hardware.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset