AbstractComponentwise rounding-error and perturbation bounds for the Cholesky and LDLT factorizations are derived. The precision of the computed Cholesky and LDLT factorizations is given
This paper proposes, analyzes, and numerically tests methods to assure the existence of incomplete C...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
AbstractRounding error bounds of the Forsythe and the Clenshaw–Smith algorithm for the evaluation of...
AbstractComponentwise rounding-error and perturbation bounds for the Cholesky and LDLT factorization...
AbstractAn almost sharp overall a priori bound is given for ‖A − LLT‖F, where L is the computed Chol...
In this paper error bounds are derived for a first order expansion of the LU factorization of a pert...
Abstract. Assuming standard floating-point arithmetic (in base β, precision p) and barring underflow...
Let the positive definite matrix A have a Cholesky factorization A = RTR. For a given vector x suppo...
In a recent paper, Chang and Paige have shown that the usual perturbation bounds for Cholesky facto...
Matrix factorizations are among the most important and basic tools in numerical linear algebra. Pert...
This paper presents some numerical simulations of rounding errors produced during evaluation of Cheb...
International audienceLet $u$ denote the relative rounding error of some floating-point format. Rece...
Let H be a symmetric positive de nite matrix. Consider solving the linear system Hx = b using Choles...
AbstractIn a detailed study of the accuracy of the Cholesky method for solving least squares equatio...
The largest dense linear systems that are being solved today are of order $n = 10^7$. Single precis...
This paper proposes, analyzes, and numerically tests methods to assure the existence of incomplete C...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
AbstractRounding error bounds of the Forsythe and the Clenshaw–Smith algorithm for the evaluation of...
AbstractComponentwise rounding-error and perturbation bounds for the Cholesky and LDLT factorization...
AbstractAn almost sharp overall a priori bound is given for ‖A − LLT‖F, where L is the computed Chol...
In this paper error bounds are derived for a first order expansion of the LU factorization of a pert...
Abstract. Assuming standard floating-point arithmetic (in base β, precision p) and barring underflow...
Let the positive definite matrix A have a Cholesky factorization A = RTR. For a given vector x suppo...
In a recent paper, Chang and Paige have shown that the usual perturbation bounds for Cholesky facto...
Matrix factorizations are among the most important and basic tools in numerical linear algebra. Pert...
This paper presents some numerical simulations of rounding errors produced during evaluation of Cheb...
International audienceLet $u$ denote the relative rounding error of some floating-point format. Rece...
Let H be a symmetric positive de nite matrix. Consider solving the linear system Hx = b using Choles...
AbstractIn a detailed study of the accuracy of the Cholesky method for solving least squares equatio...
The largest dense linear systems that are being solved today are of order $n = 10^7$. Single precis...
This paper proposes, analyzes, and numerically tests methods to assure the existence of incomplete C...
AbstractThe error propagation characteristics of the polynomial evaluation schemes of Horner, Clensh...
AbstractRounding error bounds of the Forsythe and the Clenshaw–Smith algorithm for the evaluation of...
DOI
Add to ORKG