Add to ORKGA perturbation analysis shows that if a numerically stable procedure is used to compute the matrix sign function, then it is competitive with conventional methods for computing invariant subspaces. Stability analysis of the Newton iteration improves an earlier result of Byers and confirms that ill-conditioned iterates may cause numerical instability. Numerical examples demonstrate the theoretical results
AbstractHowland has used the matrix sign function to separate the eigenvalues of a given matrix. The...
Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of...
Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of...
A perturbation analysis shows that if a numerically stable procedure is used to compute the matrix s...
A perturbation analysis shows that if a numerically stable procedure is used to compute the matrix s...
This paper uses a forward and backward error analysis to try to identify some classes of matrices fo...
. In this paper we present modified algorithms for computing deflating subspaces of matrix pencils b...
Invariant subspaces of structured matrices are sometimes better conditioned with respect to structur...
AbstractPerturbation expansions and new perturbation bounds for the matrix sign function are derived...
[EN] A general family of iterative methods including a free parameter is derived and proved to be co...
Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of...
We consider the Block Newton Method and a modification of it, the Block Rayleigh Quotient Iteration,...
The notion of invariant subspaces is useful in a number of theoretical and practical applications. ...
Any matrix with no nonpositive real eigenvalues has a unique square root for which every eigenvalue ...
A new backward stable, structure preserving method of complexity O(n^3) is presented for computing t...
AbstractHowland has used the matrix sign function to separate the eigenvalues of a given matrix. The...
Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of...
Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of...
A perturbation analysis shows that if a numerically stable procedure is used to compute the matrix s...
A perturbation analysis shows that if a numerically stable procedure is used to compute the matrix s...
This paper uses a forward and backward error analysis to try to identify some classes of matrices fo...
. In this paper we present modified algorithms for computing deflating subspaces of matrix pencils b...
Invariant subspaces of structured matrices are sometimes better conditioned with respect to structur...
AbstractPerturbation expansions and new perturbation bounds for the matrix sign function are derived...
[EN] A general family of iterative methods including a free parameter is derived and proved to be co...
Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of...
We consider the Block Newton Method and a modification of it, the Block Rayleigh Quotient Iteration,...
The notion of invariant subspaces is useful in a number of theoretical and practical applications. ...
Any matrix with no nonpositive real eigenvalues has a unique square root for which every eigenvalue ...
A new backward stable, structure preserving method of complexity O(n^3) is presented for computing t...
AbstractHowland has used the matrix sign function to separate the eigenvalues of a given matrix. The...
Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of...
Generalizing the notion of an eigenvector, invariant subspaces are frequently used in the context of...