首页 | 本学科首页   官方微博 | 高级检索  
     


An algorithm for the local exhaustive search for alternatives in an essentially non-linear eigenvalue problem
Authors:Ye.I. Mikhailovskii  Yu.V. Tulubenskaya
Affiliation:1. Vaxjo University, 351 95 Vaxjo, Sweden;2. Department of Mathematics, Technion–Israel Institute of Technology, 32000 Haifa, Israel
Abstract:An algorithm for the local exhaustive search for alternatives, which enable one to reduce the number of auxiliary linear eigenvalue problems that must be solved is illustrated using the example of the problem of the supercritical behaviour of a longitudinally compressed rod at the interface of two dissimilar Winkler media. The basic principle of the algorithm consists of developing a qualitatively adequate natural form based on a complete exhaustive search for alternatives on a “widely spaced” grid with further subsequent doubling of the number of its nodes and exhaustively searching for alternatives only in the region of the roots of the natural form.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号