 | | Journal of Applied
Mathematics and Mechanics
Russian Academy of Sciences | | Founded
in January 1936
(Translated from 1958)
Issued 6 times a year
ISSN 0021-8928
(print version) |
Archive of Issues
| Total articles in the database: | | 10482 |
| In Russian (ΟΜΜ): | | 9683
|
| In English (J. Appl. Math. Mech.): | | 799 |
|
| << Previous article | Volume 74, Issue 2 / 2010 | Next article >> |
| Ye.I. Mikhailovskii and Yu.V. Tulubenskaya, "An algorithm for the local exhaustive search for alternatives in an essentially non-linear eigenvalue problem," J. Appl. Math. Mech. 74 (2), 214-222 (2010) |
| Year |
2010 |
Volume |
74 |
Issue |
2 |
Pages |
214-222 |
| Title |
An algorithm for the local exhaustive search for alternatives in an essentially non-linear eigenvalue problem |
| Author(s) |
Ye.I. Mikhailovskii (Syktyvkar, Russia, emich@inbox.ru)
Yu.V. Tulubenskaya (Syktyvkar, Russia) |
| 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. |
| Received |
15 January 2008 |
| Link to Fulltext |
|
| << Previous article | Volume 74, Issue 2 / 2010 | Next article >> |
|
 If you find a misprint on a webpage, please help us correct it promptly - just highlight and press Ctrl+Enter
|
|
Russian 
English