An Algorithm for Computing Reducing Subspaces by Block Diagonalization
DOI10.1137/0716028zbMATH Open0413.65034OpenAlexW2069092055MaRDI QIDQ3048151FDOQ3048151
G. W. Stewart, Connice A. Bavely
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
eigenvaluesnumerical examplesalgorithmJordan normal formFortran codeblockdiagonal formHouseholder-Qr techniquequasi triangular formreal non symmetric matrix
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Canonical forms, reductions, classification (15A21)
Cited In (30)
- On estimating the condition of eigenvalues and eigenvectors
- Verified Error Bounds for All Eigenvalues and Eigenvectors of a Matrix
- Numerical methods and questions in the organization of calculus. XII. Transl. from the Russian
- Solving SDGE models: a new algorithm for the Sylvester equation
- Computing enclosures for the inverse square root and the sign function of a matrix
- Orthogonal polynomial expansions for the matrix exponential
- \(H_\infty\) sampled-data synthesis and related numerical issues
- Verified error bounds for solutions of Sylvester matrix equations
- A note on a method to compute the asymptotic Distribution of the sample second order moments of dynamic linear normal variables
- Fast verified computation for the matrix principal \(p\)th root
- Newton's method for solving parametric linear quadratic control problems
- Computational algorithms for linear control systems: a brief survey
- Fast verified computation for the solution of the T-congruence Sylvester equation
- Simulation process of flexible multibody systems with non-modal model order reduction techniques
- Pseudospectra of linear matrix pencils by block diagonalization
- Component Matrices of a Square Matrix and Their Properties
- Fast enclosure for a matrix inverse square root
- Jordan-Schur algorithms for computing the matrix exponential
- Title not available (Why is that?)
- Fast verified computation for solutions of continuous-time algebraic Riccati equations
- On swapping diagonal blocks in real Schur form
- A matrix function solution for the scaled boundary finite-element equation in statics
- On the unitary block-decomposability of 1-parameter matrix flows and static matrices
- Spectral methods for volatility derivatives
- The numerical Jordan form
- Verified computation of matrix gamma function
- Strong NP-completeness of a matrix similarity problem
- Computing Enclosures for the Matrix Exponential
- Fast enclosure for solutions of Sylvester equations
- Methods and algorithms of solving spectral problems for polynomial and rational matrices
Uses Software
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)