AbstractWe study an average condition number and an average loss of precision for the solution of linear equations and prove that the average case is strongly related to the worst case. This holds if the perturbations of the matrix are measured in Frobenius or spectral norm or componentwise. In particular, for the Frobenius norm we show that one gains about log2n+0.9 bits on the average as compared to the worst case, n being the dimension of the system of linear equations
Several properties of matrix norms and condition numbers are described. The sharpness of the norm bo...
AbstractComponentwise and normwise condition numbers of an m-tuple root x0 of a polynomial p(x) that...
AbstractA new bound for the condition number of the matrix exponential is presented. Using the bound...
AbstractWe study an average condition number and an average loss of precision for the solution of li...
AbstractA perturbation result concerning the upper and lower bounds on relative errors of solutions ...
International audienceIn this paper we are interested in computing linear least squares (LLS) condit...
AbstractIn this paper the statistical properties of problems that occur in numerical linear algebra ...
In this paper, we address the accuracy of the results for the overdetermined full rank linear least ...
We consider the cost of estimating an error bound for the computed solution of a system of linear eq...
International audienceLet A be an nxm matrix with m>n, and suppose that the underdetermined linear s...
In this paper, we address the accuracy of the results for the overdetermined full rank linear least ...
This article study the average conditioning for a random underdetermined polynomial system. The expe...
AbstractInequalities between some norms of rectangular matrices and the corresponding relationships ...
AbstractAssuming exact arithmetic, rigorous componentwise error bounds are given for the solution of...
AbstractA natural extension of the notion of condition number of a matrix to the class of all finite...
Several properties of matrix norms and condition numbers are described. The sharpness of the norm bo...
AbstractComponentwise and normwise condition numbers of an m-tuple root x0 of a polynomial p(x) that...
AbstractA new bound for the condition number of the matrix exponential is presented. Using the bound...
AbstractWe study an average condition number and an average loss of precision for the solution of li...
AbstractA perturbation result concerning the upper and lower bounds on relative errors of solutions ...
International audienceIn this paper we are interested in computing linear least squares (LLS) condit...
AbstractIn this paper the statistical properties of problems that occur in numerical linear algebra ...
In this paper, we address the accuracy of the results for the overdetermined full rank linear least ...
We consider the cost of estimating an error bound for the computed solution of a system of linear eq...
International audienceLet A be an nxm matrix with m>n, and suppose that the underdetermined linear s...
In this paper, we address the accuracy of the results for the overdetermined full rank linear least ...
This article study the average conditioning for a random underdetermined polynomial system. The expe...
AbstractInequalities between some norms of rectangular matrices and the corresponding relationships ...
AbstractAssuming exact arithmetic, rigorous componentwise error bounds are given for the solution of...
AbstractA natural extension of the notion of condition number of a matrix to the class of all finite...
Several properties of matrix norms and condition numbers are described. The sharpness of the norm bo...
AbstractComponentwise and normwise condition numbers of an m-tuple root x0 of a polynomial p(x) that...
AbstractA new bound for the condition number of the matrix exponential is presented. Using the bound...