The Lanczos algorithm applied to Kron's method
β Scribed by N. S. Sehmi
- Publisher
- John Wiley and Sons
- Year
- 1986
- Tongue
- English
- Weight
- 992 KB
- Volume
- 23
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
β¦ Synopsis
In this paper Kron's primitive composite system matrix is shown to be reducible to a symmetric indefinite matrix. This matrix, although never formed explicitly, can then be transformed to a tridiagonal matrix of reduced order by the Lanczos algorithm. Eigenvalue solutions of this partially tridiagonalized matrix give very good approximations to the eigenvalues of the composite system. The method has multiplication counts which are over 90 per cent lower than when the (condensed) Kron matrix is solved by the Newton-Raphson iteration applied to the Kron scalar equation. Numerical examples illustrating the Kron-Lanczos method when solving for the natural frequencies of frames with large numbers of degrees of freedom are presented.
π SIMILAR VOLUMES
Kron's fundamental approach to the theory of electric networks, symbolized by the famous formula I' = AtY~E', applies equally well to electronic networks. In particular, the fundamental theory of The Matric Computor--an analytic machine for the solution of problems such as arise in the applications
discover The Benefits Of Applying Algorithms To Solve Scientific, Engineering, And Practical Problems Providing A Combination Of Theory, Algorithms, And Simulations, Handbook Of Applied Algorithms Presents An All-encompassing Treatment Of Applying Algorithms And Discrete Mathematics To Practi