Using approximate computing for the calculation of inverse matrix inline-formula tex-math notation="latex"$p$ th roots

Lass M, Kühne TD, Plessl C (2018)

Publication Type: Journal article

Publication year: 2018

Journal

IEEE Embedded Systems Letters Institute of Electrical and Electronics Engineers (IEEE)

Book Volume: 10

Pages Range: 33-36

Journal Issue: 2

DOI: 10.1109/LES.2017.2760923

Abstract

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.

Involved external institutions

Universität Paderborn DE Germany (DE)

How to cite

APA:

Lass, M., Kühne, T.D., & Plessl, C. (2018). Using approximate computing for the calculation of inverse matrix inline-formula tex-math notation="latex"$p$ th roots. IEEE Embedded Systems Letters, 10(2), 33-36. https://doi.org/10.1109/LES.2017.2760923

MLA:

Lass, Michael, Thomas D. Kühne, and Christian Plessl. "Using approximate computing for the calculation of inverse matrix inline-formula tex-math notation="latex"$p$ th roots." IEEE Embedded Systems Letters 10.2 (2018): 33-36.

BibTeX: Download