Stef Graillat

According to our database1, Stef Graillat authored at least 34 papers between 2005 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Hierarchical approach for deriving a reproducible unblocked LU factorization.
IJHPCA, 2019

2018
Numerical validation of compensated algorithms with stochastic arithmetic.
Applied Mathematics and Computation, 2018

An accurate algorithm for evaluating rational functions.
Applied Mathematics and Computation, 2018

2017
GPU-Accelerated Generation of Correctly Rounded Elementary Functions.
ACM Trans. Math. Softw., 2017

On the Robustness of the 2Sum and Fast2Sum Algorithms.
ACM Trans. Math. Softw., 2017

Resolving small random symmetric linear systems on graphics processing units.
The Journal of Supercomputing, 2017

Towards Reproducible Blocked LU Factorization.
Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium Workshops, 2017

2016
Accurate, validated and fast evaluation of elementary symmetric functions and its application.
Applied Mathematics and Computation, 2016

2015
Efficient Calculations of Faithfully Rounded l2-Norms of n-Vectors.
ACM Trans. Math. Softw., 2015

Numerical reproducibility for the parallel reduction on multi- and many-core architectures.
Parallel Computing, 2015

On the maximum relative error when computing integer powers by iterated multiplications in floating-point arithmetic.
Numerical Algorithms, 2015

Numerical Validation of Compensated Summation Algorithms with Stochastic Arithmetic.
Electr. Notes Theor. Comput. Sci., 2015

2014
On the maximum relative error when computing x^n in floating-point arithmetic.
CoRR, 2014

Reproducible and Accurate Matrix Multiplication.
Proceedings of the Scientific Computing, Computer Arithmetic, and Validated Numerics, 2014

2013
Accurate evaluation of the k-th derivative of a polynomial and its application.
J. Computational Applied Mathematics, 2013

Accurate and Fast Evaluation of Elementary Symmetric Functions.
Proceedings of the 21st IEEE Symposium on Computer Arithmetic, 2013

2012
Accurate summation, dot product and polynomial evaluation in complex floating point arithmetic.
Inf. Comput., 2012

Correctly rounding elementary functions on GPU
CoRR, 2012

Accurate computing elementary symmetric functions.
ACM Comm. Computer Algebra, 2012

Towards Solving the Table Maker's Dilemma on GPU.
Proceedings of the 20th Euromicro International Conference on Parallel, 2012

2011
Stochastic Arithmetic in Multiprecision.
Mathematics in Computer Science, 2011

2010
Verified error bounds for multiple roots of systems of nonlinear equations.
Numerical Algorithms, 2010

A Parallel Algorithm for Dot Product over Word-Size Finite Field Using Floating-Point Arithmetic.
Proceedings of the 12th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2010

2009
Accurate Floating-Point Product and Exponentiation.
IEEE Trans. Computers, 2009

A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008
Rounding Errors.
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008

Accurate simple zeros of polynomials in floating point arithmetic.
Computers & Mathematics with Applications, 2008

Error-Free Transformation in Rounding Mode toward Zero.
Proceedings of the Numerical Validation in Current Hardware Architectures, 2008

2007
Pseudozero Set of Real Multivariate Polynomials.
Mathematics in Computer Science, 2007

Real and complex pseudozero sets for polynomials with applications.
ITA, 2007

2006
Improving the compensated Horner scheme with a fused multiply and add.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

Pseudozero set of interval polynomials.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

2005
A note on a nearest polynomial with a given root.
ACM SIGSAM Bulletin, 2005

Compensated Horner Scheme.
Proceedings of the Algebraic and Numerical Algorithms and Computer-assisted Proofs, 2005


  Loading...