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