Dedicated to Gérard Meurant on the occasion of his 60th birthday Abstract. We consider the triangular factorization of matrices in single-precision arithmetic and show how these factors can be used to obtain a backward stable solution. Our aim is to obtain double-precision accuracy even when the system is ill-conditioned. We examine the use of iterative refinement and show by example that it may not converge. We then show both theoretically and practically that the use of FGMRES will give us the result that we desire with fairly mild conditions on the matrix and the direct factorization. We perform extensive experiments on dense matrices using MATLAB and indicate how our work extends to sparse matrix factorization and solution
On many current and emerging computing architectures, single-precision calculations are at least twi...
We present the design and testing of an algorithm for iterative refinement of the solution of linear...
Abstract. Multiplicative backward stability results are presented for two algorithms which compute t...
Motivated by the demand in machine learning, modern computer hardware is increas- ingly supporting r...
What is the fastest way to solve a linear system $Ax= b$ in arithmetic of a given precision when $A$...
Iterative refinement is a well-known technique for improving the quality of an approximate solution ...
Abstract—The aim of the paper is to analyze the potential of the mixed precision iterative refinemen...
Today's floating-point arithmetic landscape is broader than ever. While scientific computing has tra...
The behaviour of PCG methods for solving a finite difference or finite element positive definite lin...
International audienceThe standard LU factorization-based solution process for linear systems can be...
We propose a general algorithm for solving a $n\times n$ nonsingular linear system $Ax = b$ based on...
We consider the solution of a linear system of equations using the GMRES iterative method. In [3], a...
It is well established that mixed precision algorithms that factorize a matrix at a precision lower...
We analyze when it is possible to compute the singular values and singular vectors of a matrix with ...
Abstract. We investigate how extra-precise accumulation of dot products can be used to solve ill-con...
On many current and emerging computing architectures, single-precision calculations are at least twi...
We present the design and testing of an algorithm for iterative refinement of the solution of linear...
Abstract. Multiplicative backward stability results are presented for two algorithms which compute t...
Motivated by the demand in machine learning, modern computer hardware is increas- ingly supporting r...
What is the fastest way to solve a linear system $Ax= b$ in arithmetic of a given precision when $A$...
Iterative refinement is a well-known technique for improving the quality of an approximate solution ...
Abstract—The aim of the paper is to analyze the potential of the mixed precision iterative refinemen...
Today's floating-point arithmetic landscape is broader than ever. While scientific computing has tra...
The behaviour of PCG methods for solving a finite difference or finite element positive definite lin...
International audienceThe standard LU factorization-based solution process for linear systems can be...
We propose a general algorithm for solving a $n\times n$ nonsingular linear system $Ax = b$ based on...
We consider the solution of a linear system of equations using the GMRES iterative method. In [3], a...
It is well established that mixed precision algorithms that factorize a matrix at a precision lower...
We analyze when it is possible to compute the singular values and singular vectors of a matrix with ...
Abstract. We investigate how extra-precise accumulation of dot products can be used to solve ill-con...
On many current and emerging computing architectures, single-precision calculations are at least twi...
We present the design and testing of an algorithm for iterative refinement of the solution of linear...
Abstract. Multiplicative backward stability results are presented for two algorithms which compute t...