High order symmetric algorithms for nonlinear dynamical systems with non-holonomic constraints
Based on the Lagrange–d’Alembert principle and a modified Lagrange–d’Alembert principle, two kinds of symmetric algorithms with arbitrary high order are proposed for non-holonomic systems. The modified Lagrange–d’Alembert principle is constructed by adding an augment term to the Lagrange–d’Alembert...
Uloženo v:
| Vydáno v: | Mathematics and computers in simulation Ročník 212; s. 524 - 547 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.10.2023
|
| Témata: | |
| ISSN: | 0378-4754, 1872-7166 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | Based on the Lagrange–d’Alembert principle and a modified Lagrange–d’Alembert principle, two kinds of symmetric algorithms with arbitrary high order are proposed for non-holonomic systems. The modified Lagrange–d’Alembert principle is constructed by adding an augment term to the Lagrange–d’Alembert principle, so that the non-holonomic constraints can be directly derived from variation. The high order algorithms are constructed by: (1) choosing control points to approximate generalized coordinates and Lagrange multipliers; (2) performing quadrature rules to approximate integrals; (3) choosing constraint points to satisfy non-holonomic constraints. The order of the presented algorithms is investigated numerically. The main factors to affect the accuracy of proposed algorithm were analyzed. Furthermore, the numerical algorithms are proven to be symmetric and can satisfy non-holonomic constraints with high precision. |
|---|---|
| ISSN: | 0378-4754 1872-7166 |
| DOI: | 10.1016/j.matcom.2023.05.016 |