IMPROVEMENT OF AN APPROXIMATE SET OF LATENT ROOTS AND MODAL COLUMNS OF A MATRIX BY METHODS AKIN TO THOSE OF CLASSICAL PERTURBATION THEORY
From MaRDI portal
Publication:5793073
DOI10.1093/QJMAM/1.1.131zbMATH Open0035.20501OpenAlexW1964365393MaRDI QIDQ5793073FDOQ5793073
Publication date: 1948
Published in: The Quarterly Journal of Mechanics and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/qjmam/1.1.131
Cited In (9)
- A quadratically convergent algorithm based on matrix equations for inverse eigenvalue problems
- Sensitivity Enhancement for Structural Condition Assessment with Noisy Excitation or with Only Output
- A block Gersgorin theorem
- Structural sensitivity analysis via reduced-order analytical model
- Iterative refinement for symmetric eigenvalue decomposition
- Iterative refinement of Schur decompositions
- A practical algorithm for the efficient computation of eigenvector sensitivities
- Updating the singular value decomposition
- Un metodo iterativo per la ricerca degli autovalori e degli autovettori basato sulla teoria della perturbazione
This page was built for publication: IMPROVEMENT OF AN APPROXIMATE SET OF LATENT ROOTS AND MODAL COLUMNS OF A MATRIX BY METHODS AKIN TO THOSE OF CLASSICAL PERTURBATION THEORY
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5793073)
