Toward the Synthesis of Gauss Pivoting Code for Linear Systems Resolution : Application Mechanical Problems

14 pages•Published: October 11, 2018

Abstract

The purpose of this talk is primarily to introduce a new methodology to synthesize numerically accurate programs for the Gaussian elimination method in order to solve linear systems coming from mechanical problems. The synthesis is based on program transformation techniques and it is guided in its estimation of accuracy by interval arithmetic that computes the propagation of roundoff errors. Besides a discussion on numerical accuracy issues related to floating-points arithmetics and roundoff errors, we present our approach used to compute the error bound during the resolution process. Finally, some experimental results will be presented to prove the efficiency of our synthesizer tool and show that the specialized produced code to solve the family of systems given in input is far more accurate and faster than the standard implementation of the Gauss method.

Keyphrases: code synthesis, Gauss pivoting, ill-conditioning, linear systems, Mechanical problems, Numerical accuracy

In: Matthieu Martel, Nasrine Damouche and Julien Alexandre Dit Sandretto (editors). TNC'18. Trusted Numerical Computations, vol 8, pages 24--37

Links:	https://easychair.org/publications/paper/G4H6
	https://doi.org/10.29007/75kg