A counterexample showing the semi-explicit Lie-Newmark algorithm is not variational

Mathematics – Numerical Analysis

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages, 5 figures

Scientific paper

This paper presents a counterexample to the conjecture that the semi-explicit Lie-Newmark algorithm is variational. As a consequence the Lie-Newmark method is not well-suited for long-time simulation of rigid body-type mechanical systems. The counterexample consists of a single rigid body in a static potential field, and can serve as a test of the variational nature of other rigid-body integrators.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A counterexample showing the semi-explicit Lie-Newmark algorithm is not variational does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A counterexample showing the semi-explicit Lie-Newmark algorithm is not variational, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A counterexample showing the semi-explicit Lie-Newmark algorithm is not variational will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-57312

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.