An eigensolution strategy for large systems

DOI10.1016/0045-7949(83)90166-9zbMath0499.73092OpenAlexW2087824144MaRDI QIDQ3965730

Edward L. Wilson, Tetsuji Itoh

Publication date: 1983

Published in: Computers & Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7949(83)90166-9

zbMATH Keywords

mode shapesnumerical algorithmsubspace iteration methodlarge bandwidthalternative to solution for exact eigenpairscalculate eigenpairs in groups near different shift pointsdirect superposition of Ritz vectors yields more accurate solutionevaluation of frequenciesgiven by square root of bandwidthgood approximation for optimum number of iteration vectorsvery large structural systems

Mathematics Subject Classification ID

Related Items (9)

A computational strategy for making complicated structural problems simple ⋮ Optimization formulations for the maximum nonlinear buckling load of composite structures ⋮ On compliance and buckling objective functions in topology optimization of snap-through problems ⋮ Nonlinear buckling optimization of composite structures considering ``worst shape imperfections ⋮ Block subspace projection preconditioned conjugate gradient method in modal structural analysis ⋮ Nonlinear buckling optimization of composite structures ⋮ The accelerated power method ⋮ An enhanced formulation of error bound in subspace iteration method ⋮ Eigensolution of nonclassically damped structures by complex subspace iteration

This page was built for publication: An eigensolution strategy for large systems