arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.00505math.NAcs.NAcs.RO
收藏

广义刚体运动离散Euler-Arnold方程的求解

Solving the Discrete Euler-Arnold Equations for the Generalized Rigid Body Motion

Coimbra Polytechnic–ISEC(科英布拉理工学院);Center for Mathematics, University of Coimbra(科英布拉大学数学中心);Institute for Systems and Robotics (LARSyS)(系统与机器人研究所);Instituto Superior Técnico, University of Lisbon(里斯本大学高等技术学院)

Joao R. Cardoso, Pedro Miraldo

摘要:

我们提出了三种迭代法求解Moser-Veselov方程,这是在离散的欧拉-阿诺德微分方程控制的广义刚体的运动。首先,我们制定的问题作为一个最优化问题正交约束,并证明了目标函数是凸的。然后,利用黎曼流形上的优化技术,设计了三个可行的算法。第一种方法使用Bregman方法分割正交约束,而另外两种方法是最速下降类型。第二种方法使用Cayley变换来保持约束和Barzilai-Borwein步长,而第三种方法涉及测地线,其中步长由Armijo规则计算。最后,通过一组数值实验比较了两种算法的性能,结果表明,第一种算法在精度和迭代次数方面性能最优.这些迭代法的一个重要优点是,即使在文献中可用的直接法的适用条件不满足时,它们也能工作。

英文摘要:

We propose three iterative methods for solving the Moser-Veselov equation, which arises in the discretization of the Euler-Arnold differential equations governing the motion of a generalized rigid body. We start by formulating the problem as an optimization problem with orthogonal constraints and proving that the objective function is convex. Then, using techniques from optimization on Riemannian manifolds, the three feasible algorithms are designed. The first one splits the orthogonal constraints using the Bregman method, whereas the other two methods are of the steepest-descent type. The second method uses the Cayley-transform to preserve the constraints and a Barzilai-Borwein step size, while the third one involves geodesics, with the step size computed by Armijo's rule. Finally, a set of numerical experiments are carried out to compare the performance of the proposed algorithms, suggesting that the first algorithm has the best performance in terms of accuracy and number of iterations. An essential advantage of these iterative methods is that they work even when the conditions for applicability of the direct methods available in the literature are not satisfied.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑