A new backward error analysis of LU factorization is presented. It allows do obtain a sharper upper bound for the forward error and a new definition of the growth factor that we compare with the well known Wilkinson growth factor for some classes of matrices. Numerical experiments show that the new growth factor is often of order approximately log(2)n whereas Wilkinson's growth factor is of order n or root n
LU decomposition is a fundamental in linear algebra. Numerous tools exists that provide this importa...
In this paper we derive perturbation theorems for the LU and QR factors. Moreover, bounds for $\kapp...
AbstractAn almost sharp overall a priori bound is given for ‖A − LLT‖F, where L is the computed Chol...
A new backward error analysis of LU factorization is presented. It allows do obtain a sharper up...
AbstractBy a block representation of LU factorization for a general matrix introduced by Amodio and ...
Abstract. Assuming standard floating-point arithmetic (in base β, precision p) and barring underflow...
International audienceWe present new algorithms to detect and correct errors in the lower-upper fact...
Abstract. This paper gives sensitivity analyses by two approaches for L and U in the factor-ization ...
Matrix factorizations are among the most important and basic tools in numerical linear algebra. Pert...
In this paper error bounds are derived for a first order expansion of the LU factorization of a pert...
Many of the currently popular ‘block algorithms’ are scalar algorithms in which the operations have ...
International audienceThe process of finding the solution of a linear system of equations is often t...
We consider ill-conditioned linear systems $Ax =$ b that are to be solved iteratively, and assume t...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
Existing definitions of backward error and condition number for linear systems do not cater to struc...
LU decomposition is a fundamental in linear algebra. Numerous tools exists that provide this importa...
In this paper we derive perturbation theorems for the LU and QR factors. Moreover, bounds for $\kapp...
AbstractAn almost sharp overall a priori bound is given for ‖A − LLT‖F, where L is the computed Chol...
A new backward error analysis of LU factorization is presented. It allows do obtain a sharper up...
AbstractBy a block representation of LU factorization for a general matrix introduced by Amodio and ...
Abstract. Assuming standard floating-point arithmetic (in base β, precision p) and barring underflow...
International audienceWe present new algorithms to detect and correct errors in the lower-upper fact...
Abstract. This paper gives sensitivity analyses by two approaches for L and U in the factor-ization ...
Matrix factorizations are among the most important and basic tools in numerical linear algebra. Pert...
In this paper error bounds are derived for a first order expansion of the LU factorization of a pert...
Many of the currently popular ‘block algorithms’ are scalar algorithms in which the operations have ...
International audienceThe process of finding the solution of a linear system of equations is often t...
We consider ill-conditioned linear systems $Ax =$ b that are to be solved iteratively, and assume t...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
Existing definitions of backward error and condition number for linear systems do not cater to struc...
LU decomposition is a fundamental in linear algebra. Numerous tools exists that provide this importa...
In this paper we derive perturbation theorems for the LU and QR factors. Moreover, bounds for $\kapp...
AbstractAn almost sharp overall a priori bound is given for ‖A − LLT‖F, where L is the computed Chol...