In this paper we describe how to swap two 2 × 2 blocks in a real Schur form and a generalized real Schur form. We pay special attention to the numerical stability of the method. We also illustrate the stability of our approach by a series of numerical tests
Adams-Moulton methods for k = 2 and k = 3 were constructed together with their c...
AbstractWe firstly consider the block dominant degree for I-(II-)block strictly diagonally dominant ...
The understanding of the space of symmetric functions is gained through the study of its bases. Cert...
In this paper we describe how to swap two 2 × 2 blocks in a real Schur form and a generalized real S...
© 2019 Elsevier B.V. In this paper we describe how to swap two 2 × 2 blocks in a real Schur form and...
We present a direct algorithm for computing an orthogonal similarity transformation which interchang...
Block algorithms for reordering a selected set of eigenvalues in a standard or generalized Schur for...
AbstractA generalization of the method of Chu et al. [D. Chu, X. Liu, V. Mehrmann, A numerical metho...
The generalized Schur algorithm (GSA) is a fast method to compute the Cholesky factorization of a wi...
In Matlab, there exists a standard command to generate a real Schur form, and another command transf...
In Matlab, there exists a standard command to generate a real Schur form, and another command transf...
AbstractWe discuss a new version of an existing algorithm for reordering the eigenvalues on the diag...
. An algorithm for reduction of a regular matrix pair (A; B) to block Hessenberg-triangular form is...
Abstract. Recently Chu, Liu, and Mehrmann developed an O(n 3) structure preserving method for comput...
This paper provides an error analysis of the generalized Schur algorithm of Kailath and Chun [SIAM J...
Adams-Moulton methods for k = 2 and k = 3 were constructed together with their c...
AbstractWe firstly consider the block dominant degree for I-(II-)block strictly diagonally dominant ...
The understanding of the space of symmetric functions is gained through the study of its bases. Cert...
In this paper we describe how to swap two 2 × 2 blocks in a real Schur form and a generalized real S...
© 2019 Elsevier B.V. In this paper we describe how to swap two 2 × 2 blocks in a real Schur form and...
We present a direct algorithm for computing an orthogonal similarity transformation which interchang...
Block algorithms for reordering a selected set of eigenvalues in a standard or generalized Schur for...
AbstractA generalization of the method of Chu et al. [D. Chu, X. Liu, V. Mehrmann, A numerical metho...
The generalized Schur algorithm (GSA) is a fast method to compute the Cholesky factorization of a wi...
In Matlab, there exists a standard command to generate a real Schur form, and another command transf...
In Matlab, there exists a standard command to generate a real Schur form, and another command transf...
AbstractWe discuss a new version of an existing algorithm for reordering the eigenvalues on the diag...
. An algorithm for reduction of a regular matrix pair (A; B) to block Hessenberg-triangular form is...
Abstract. Recently Chu, Liu, and Mehrmann developed an O(n 3) structure preserving method for comput...
This paper provides an error analysis of the generalized Schur algorithm of Kailath and Chun [SIAM J...
Adams-Moulton methods for k = 2 and k = 3 were constructed together with their c...
AbstractWe firstly consider the block dominant degree for I-(II-)block strictly diagonally dominant ...
The understanding of the space of symmetric functions is gained through the study of its bases. Cert...
DOI
Add to ORKG