An Algorithm for Computing Reducing Subspaces by Block Diagonalization

DOI10.1137/0716028MaRDI QIDQ3048151zbMATHOpenAlexFDO

Authors Connice A. Bavely, G. W. Stewart

Publication date 1979

Published in SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0716028

zbMATH Keywords

eigenvaluesnumerical examplesalgorithmJordan normal formFortran codeblockdiagonal formHouseholder-Qr techniquequasi triangular formreal non symmetric matrix

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Canonical forms, reductions, classification (15A21)

Cited in

(30)

• A note on a method to compute the asymptotic Distribution of the sample second order moments of dynamic linear normal variables
• Solving SDGE models: a new algorithm for the Sylvester equation
• Computational algorithms for linear control systems: a brief survey
• scientific article; zbMATH DE number 6890177 (Why is no real title available?)
• Spectral methods for volatility derivatives
• Fast verified computation for solutions of continuous-time algebraic Riccati equations
• Jordan-Schur algorithms for computing the matrix exponential
• Orthogonal polynomial expansions for the matrix exponential
• Methods and algorithms of solving spectral problems for polynomial and rational matrices
• Computing enclosures for the inverse square root and the sign function of a matrix
• On estimating the condition of eigenvalues and eigenvectors
• Newton's method for solving parametric linear quadratic control problems
• Fast verified computation for the matrix principal \(p\)th root
• Computing enclosures for the matrix exponential
• Component matrices of a square matrix and their properties
• Simulation process of flexible multibody systems with non-modal model order reduction techniques
• Strong NP-completeness of a matrix similarity problem
• Fast enclosure for solutions of Sylvester equations
• Fast verified computation for the solution of the T-congruence Sylvester equation
• Verified Error Bounds for All Eigenvalues and Eigenvectors of a Matrix
• Pseudospectra of linear matrix pencils by block diagonalization
• \(H_\infty\) sampled-data synthesis and related numerical issues
• The numerical Jordan form
• A matrix function solution for the scaled boundary finite-element equation in statics
• On swapping diagonal blocks in real Schur form
• Verified error bounds for solutions of Sylvester matrix equations
• On the unitary block-decomposability of 1-parameter matrix flows and static matrices
• Verified computation of matrix gamma function
• Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
• Fast enclosure for a matrix inverse square root

Describes a project that uses

Uses Software

• EISPACK
• HQR3

This page was built for publication: An Algorithm for Computing Reducing Subspaces by Block Diagonalization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3048151)