This paper deals with the orthogonal projection (in the Frobenius sense) AN of the identity matrix I onto the matrix subspace AS (A ? Rn×n, S being an arbitrary subspace of Rn×n). Lower and upper bounds on the normalized Frobenius condition number of matrix AN are given. Furthermore, for every matrix subspace S ? Rn×n, a new index bF (A, S), which generalizes the normalized Frobenius condition number of matrix A, is defined and analyzed..
The Frobenius normal form of a matrix is an important tool in analyzing its properties. When a matri...
We define in the space of n × m matrices of rank n, n ≤ m, the condition Riemannian structure as fol...
The spectral radius of a matrixAis the maximum norm of alleigenvalues ofA. In previous work we alrea...
We analyze the best approximation (in the Frobenius sense) to the identity matrix in an arbitrary m...
AbstractWe give an alternative method for computing the matrixargminA−PF,where ∥·∥F is the Frobenius...
In this article, new upper and lower bounds for the spectral condition number are obtained. These bo...
AbstractIn this note we generalize an upper bound given in Guggenheimer et al. (College Math. J. 26(...
AbstractThe condition number (relative to the Frobenius norm) of the n × n matrix Pn = [pi−1(xj)]i, ...
AbstractThe condition numbers described by Stewart, Todd, and others for a matrix A are given by the...
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduc...
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduc...
We present some lower bounds for the Frobenius condition number of a positive definite matrix depen...
Abstract In even dimensions, the orthogonal projection onto the two dimensional space of second orde...
AbstractA list of seventy conditions on an n × n complex matrix A, equivalent to its being normal, p...
We present some lower bounds for the Frobenius condition number of a positive definite matrix depend...
The Frobenius normal form of a matrix is an important tool in analyzing its properties. When a matri...
We define in the space of n × m matrices of rank n, n ≤ m, the condition Riemannian structure as fol...
The spectral radius of a matrixAis the maximum norm of alleigenvalues ofA. In previous work we alrea...
We analyze the best approximation (in the Frobenius sense) to the identity matrix in an arbitrary m...
AbstractWe give an alternative method for computing the matrixargminA−PF,where ∥·∥F is the Frobenius...
In this article, new upper and lower bounds for the spectral condition number are obtained. These bo...
AbstractIn this note we generalize an upper bound given in Guggenheimer et al. (College Math. J. 26(...
AbstractThe condition number (relative to the Frobenius norm) of the n × n matrix Pn = [pi−1(xj)]i, ...
AbstractThe condition numbers described by Stewart, Todd, and others for a matrix A are given by the...
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduc...
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduc...
We present some lower bounds for the Frobenius condition number of a positive definite matrix depen...
Abstract In even dimensions, the orthogonal projection onto the two dimensional space of second orde...
AbstractA list of seventy conditions on an n × n complex matrix A, equivalent to its being normal, p...
We present some lower bounds for the Frobenius condition number of a positive definite matrix depend...
The Frobenius normal form of a matrix is an important tool in analyzing its properties. When a matri...
We define in the space of n × m matrices of rank n, n ≤ m, the condition Riemannian structure as fol...
The spectral radius of a matrixAis the maximum norm of alleigenvalues ofA. In previous work we alrea...