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.131zbMath0035.20501OpenAlexW1964365393MaRDI QIDQ5793073
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
Related Items (9)
Iterative refinement for symmetric eigenvalue decomposition ⋮ Structural sensitivity analysis via reduced-order analytical model ⋮ Iterative refinement of Schur decompositions ⋮ Sensitivity Enhancement for Structural Condition Assessment with Noisy Excitation or with Only Output ⋮ Updating the singular value decomposition ⋮ A quadratically convergent algorithm based on matrix equations for inverse eigenvalue problems ⋮ A block Gersgorin theorem ⋮ Un metodo iterativo per la ricerca degli autovalori e degli autovettori basato sulla teoria della perturbazione ⋮ A practical algorithm for the efficient computation of eigenvector sensitivities
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
