Computation of Plain Unitary Rotations Transforming a General Matrix to Triangular Form
From MaRDI portal
Publication:3258097
DOI10.1137/0106004zbMath0087.11902OpenAlexW2069232849MaRDI QIDQ3258097
Publication date: 1958
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0106004
Related Items
A survey of the advances in the exploitation of the sparsity in the solution of large problems, Rank-adaptive structure-preserving model order reduction of Hamiltonian systems, A dual projective simplex method for linear programming, Sparse givens resolution of large system of linear equations: applications to image reconstruction, Householder Orthogonalization with a Nonstandard Inner Product, Fast deflation sparse principal component analysis via subspace projections, Deconstructing the Gel'fand-Yaglom method and vacuum energy from a theory space, Random orthogonal matrix simulation, Further properties of random orthogonal matrix simulation, Exact QR factorizations of rectangular matrices, Comparison of two pivotal strategies in sparse plane rotations, Hyper-spherical and elliptical stochastic cycles, A projective simplex algorithm using LU decomposition, Simple orbit determination using GPS based on a least-squares algorithm employing sequential Givens rotations, Fast implementation of direct robot kinematics with cordic systolic arrays, Verfahren für die Bestimmung von Eigenwerten und Eigenvektoren von symmetrisch nicht-hermiteschen Matrizen, On QR factorization updatings, The generalized triangular decomposition, Bemerkungen zum Verfahren von Hessenberg, The canonical coset decomposition of unitary matrices through Householder transformations, Diagonalization of complex symmetric matrices: generalized Householder reflections, iterative deflation and implicit shifts, A linearization of quantum channels
