A CLUSTER SERIES EXPANSION TECHNIQUE FOR SOLVING VIBRATION PROBLEMS
✍ Scribed by P. ŽITŇAN
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 266 KB
- Volume
- 243
- Category
- Article
- ISSN
- 0022-460X
No coin nor oath required. For personal study only.
✦ Synopsis
A cluster series expansion technique for spectral solution of vibration problems is presented. In this technique the eigenfunction approximations are composed of clusters of single basis functions instead of the classical Fourier series of single basis functions. To realize the cluster expansion an alternating "xed-free subspace strategy is used to improve the coe$cients of the single basis functions inside the clusters. This strategy generates a family of m-step iterative algorithms solving large dense matrix eigenproblem of order m.n as a few dense matrix eigenproblems of order n#(m!1)l, where l denotes the number of computed eigenvalues. The computational behaviour of the proposed m-step algorithms is investigated by solving matrix eigenproblems up to the order 3600 by using the m-step algorithms for m"2, 3, 4, 5.
📜 SIMILAR VOLUMES
ABSTI~ACT : This paper establishes a clear procedure for the variational problem solution via the Walsh functions technique. First the Walsh functions are introduced and their properties briefly summarized. Then an operational matrix is derived for integration use. The variational problems are solve
A methodjtir the optimal control of linear time-varying systems with a quadratic cost jitnctional is proposed. The state and control variables are expanded in the shified Legendre series, and an algorithm is provided for approximating the system dynamics, boundary conditions and peyformance index. T
## Abstract A finite difference technique that incorporates a numerical mapping has been successfully applied to analyse both planar and axisymmetric Newtonian jets. A pressure gradient equation and a free‐surface slope equation have been derived for free‐surface iteration. The computation of press