Abstract. This paper gives sensitivity analyses by two approaches for L and U in the factor-ization A = LU for general perturbations in A which are sufficiently small in norm. By the matrix-vector equation approach, we derive the condition umbers for the L and U factors. By the matrix equation approach we derive corresponding condition estimates. We show how partial pivoting and complete pivoting affect the sensitivity of the LU factorization. AMS subject classification: 15A23, 65F35
Many of the currently popular ‘block algorithms’ are scalar algorithms in which the operations have ...
AbstractBy a block representation of LU factorization for a general matrix introduced by Amodio and ...
[[abstract]]We consider permutations of any given squared matrix and the generalized LU(r) factoriza...
In this paper we derive perturbation theorems for the LU and QR factors. Moreover, bounds for $\kapp...
Matrix factorizations are among the most important and basic tools in numerical linear algebra. Pert...
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usu...
A new backward error analysis of LU factorization is presented. It allows do obtain a sharper up...
AbstractFor a unique factorization of a matrix B, the effect of sparsity or other structure on measu...
This work introduces a new perturbation bound for the L factor of the LDU factorization of (row) di...
In a recent paper, Chang and Paige have shown that the usual perturbation bounds for Cholesky facto...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
We present a new method for the a priori approximation of the order of magnitude of the entries in t...
We present a new method for the a priori approximation of the orders of magnitude of the entries in ...
AbstractA sensitivity analysis is made for solutions to linear equation systems involving M-matrices...
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 ...
AbstractBy a block representation of LU factorization for a general matrix introduced by Amodio and ...
[[abstract]]We consider permutations of any given squared matrix and the generalized LU(r) factoriza...
In this paper we derive perturbation theorems for the LU and QR factors. Moreover, bounds for $\kapp...
Matrix factorizations are among the most important and basic tools in numerical linear algebra. Pert...
We combine the idea of the direct LU factorization with the idea of the pivoting strategy in the usu...
A new backward error analysis of LU factorization is presented. It allows do obtain a sharper up...
AbstractFor a unique factorization of a matrix B, the effect of sparsity or other structure on measu...
This work introduces a new perturbation bound for the L factor of the LDU factorization of (row) di...
In a recent paper, Chang and Paige have shown that the usual perturbation bounds for Cholesky facto...
AbstractResults are given concerning the LU factorization of H-matrices, and Gaussian elimination wi...
We present a new method for the a priori approximation of the order of magnitude of the entries in t...
We present a new method for the a priori approximation of the orders of magnitude of the entries in ...
AbstractA sensitivity analysis is made for solutions to linear equation systems involving M-matrices...
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 ...
AbstractBy a block representation of LU factorization for a general matrix introduced by Amodio and ...
[[abstract]]We consider permutations of any given squared matrix and the generalized LU(r) factoriza...