Add to ORKGAbstract. Let A be a diagonalizable matrix; so there is an invertible matrix T and a normal matrix D̂, such that T−1AT = D̂. A sharp bound for the constant κT = ‖T‖‖T −1 ‖ is suggested. Some applications of the obtained bound are also discussed
SIGLEAvailable from British Library Lending Division - LD:6184.6725(NAR--86) / BLDSC - British Libra...
Abstract. For an n n tridiagonal matrix we exploit the structure of its QR factorization to devise ...
For an $n \times n$ tridiagonal matrix we exploit the structure of its QR factorization to devis...
Abstract. Let A be a diagonalizable matrix; so there is an invertible matrix T and a normal matrix D...
AbstractIn this note we generalize an upper bound given in Guggenheimer et al. (College Math. J. 26(...
AbstractBy constructing a special similarity transformation matrix, an upper bound for the spectral ...
Several properties of matrix norms and condition numbers are described. The sharpness of the norm bo...
A new bound for the condition number of the matrix exponential is presented. Using the bound, we pro...
We explore the condition numbers of the nonlinear matrix equation Xp-A⁎eXA=I. Explicit expressions f...
AbstractA new bound for the condition number of the matrix exponential is presented. Using the bound...
A new bound for the condition number of the matrix exponential is presented. Using the bound, we pro...
New algorithms are developed for estimating the condition number of $f(A)b$, where $A$ is a matrix a...
New algorithms are developed for estimating the condition number of $f(A)b$, where $A$ is a matrix a...
A new bound for the condition number of the matrix exponential is presented. Using the bound, we pro...
AbstractThe purpose of this paper is to obtain some new lower and upper bounds on κ(A)+κ-1(A), where...
SIGLEAvailable from British Library Lending Division - LD:6184.6725(NAR--86) / BLDSC - British Libra...
Abstract. For an n n tridiagonal matrix we exploit the structure of its QR factorization to devise ...
For an $n \times n$ tridiagonal matrix we exploit the structure of its QR factorization to devis...
Abstract. Let A be a diagonalizable matrix; so there is an invertible matrix T and a normal matrix D...
AbstractIn this note we generalize an upper bound given in Guggenheimer et al. (College Math. J. 26(...
AbstractBy constructing a special similarity transformation matrix, an upper bound for the spectral ...
Several properties of matrix norms and condition numbers are described. The sharpness of the norm bo...
A new bound for the condition number of the matrix exponential is presented. Using the bound, we pro...
We explore the condition numbers of the nonlinear matrix equation Xp-A⁎eXA=I. Explicit expressions f...
AbstractA new bound for the condition number of the matrix exponential is presented. Using the bound...
A new bound for the condition number of the matrix exponential is presented. Using the bound, we pro...
New algorithms are developed for estimating the condition number of $f(A)b$, where $A$ is a matrix a...
New algorithms are developed for estimating the condition number of $f(A)b$, where $A$ is a matrix a...
A new bound for the condition number of the matrix exponential is presented. Using the bound, we pro...
AbstractThe purpose of this paper is to obtain some new lower and upper bounds on κ(A)+κ-1(A), where...
SIGLEAvailable from British Library Lending Division - LD:6184.6725(NAR--86) / BLDSC - British Libra...
Abstract. For an n n tridiagonal matrix we exploit the structure of its QR factorization to devise ...
For an $n \times n$ tridiagonal matrix we exploit the structure of its QR factorization to devis...