We develop a general theory of reflectors and block reflectors in a class of non-Euclidean
scalar product spaces generated by orthosymmetric scalar product matrices J. These J …

In this paper, we give the sensitivity analysis for an implicit Bunch form of the symplectic QR
factorization. In particular, we present some new first order normwise perturbation bounds …

In this note, the rigorous perturbation bounds for R factor of the implicit Bunch form of the
symplectic QR factorization under normwise perturbation are derived by using the block …

In this article, some new rigorous perturbation bounds for the SR decomposition under
normwise or componentwise perturbations for a given matrix are derived. Also, the explicit …

Full article: Perturbation analysis for the symplectic QR factorization Skip to Main Content Taylor
and Francis Online homepage Taylor and Francis Online homepage Access provided by The …

This work deals with a special incarnation of subspace iteration—spectral projection—in
order to solve Eigenproblems of standard or generalized form, given by Hermitian matrices …

Differential qd (dqd) algorithm with shifts is probably the fastest known algorithm which
computes eigenvalues of symmetric tridiagonal matrices with high relative accuracy. In this …

Our purpose in this work is to adapt the nonsymmetric Jacobi iteration to the special case of
Hamiltonian structure. We describe a way to compute a Hamiltonian Schur form by using …

In this paper we analyze the nearly optimal block diagonal scalings of the rows of one factor
and the columns of the other factor in the triangular form of the SR decomposition. The result …

Rotations are essential transformations in many parts of numerical linear algebra. In this
paper, it is shown that there exists a family of matrices unitary with respect to an …