Topic
Sylvester's law of inertia
About: Sylvester's law of inertia is a research topic. Over the lifetime, 1097 publications have been published within this topic receiving 25758 citations.
Papers published on a yearly basis
Papers
More filters
Book•
[...]
01 Jan 1960
TL;DR: In this article, the Second Edition Preface is presented, where Maximization, Minimization, and Motivation are discussed, as well as a method of Hermite and Quadratic Form Index.
Abstract: Foreword Preface to the Second Edition Preface 1. Maximization, Minimization, and Motivation 2. Vectors and Matrices 3. Diagonalization and Canonical Forms for Symmetric Matrices 4. Reduction of General Symmetric Matrices to Diagonal Form 5. Constrained Maxima 6. Functions of Matrices 7. Variational Description of Characteristic Roots 8. Inequalities 9. Dynamic Programming 10. Matrices and Differential Equations 11. Explicit Solutions and Canonical Forms 12. Symmetric Function, Kronecker Products and Circulants 13. Stability Theory 14. Markoff Matrices and Probability Theory 15. Stochastic Matrices 16. Positive Matrices, Perron's Theorem, and Mathematical Economics 17. Control Processes 18. Invariant Imbedding 19. Numerical Inversion of the Laplace Transform and Tychonov Regularization Appendix A. Linear Equations and Rank Appendix B. The Quadratic Form of Selberg Appendix C. A Method of Hermite Appendix D. Moments and Quadratic Forms Index.
3,471 citations
[...]
TL;DR: In this paper, an adaptive robot control algorithm is derived, which consists of a PD feedback part and a full dynamics feed for the compensation part, with the unknown manipulator and payload parameters being estimated online.
Abstract: A new adaptive robot control algorithm is derived, which consists of a PD feedback part and a full dynamics feedfor ward compensation part, with the unknown manipulator and payload parameters being estimated online. The algorithm is computationally simple, because of an effective exploitation of the structure of manipulator dynamics. In particular, it requires neither feedback of joint accelerations nor inversion of the estimated inertia matrix. The algorithm can also be applied directly in Cartesian space.
2,033 citations
[...]
TL;DR: In this article, an implicit time stepping algorithm that furnishes a canonical extension of the classical Newmark algorithm to the rotation group (SO(3)) is developed, which reduces exactly to the plane formulation, leading to a configuration-dependent nonsymmetric tangent inertia matrix.
Abstract: The dynamics of a fully nonlinear rod model, capable of undergoing finite bending, shearing, and extension, is considered in detail. Unlike traditional nonlinear structural dynamics formulations, due to the effect of finite rotations the deformation map takes values in r 3 × SO(3), which is a differentiable manifold and not a linear space. An implicit time stepping algorithm that furnishes a canonical extension of the classical Newmark algorithm to the rotation group (SO(3)) is developed. In addition to second-order accuracy, the proposed algorithm reduces exactly to the plane formulation. Moreover, the exact linearization of the algorithm and associated configuration update is obtained in closed form, leading to a configuration-dependent nonsymmetric tangent inertia matrix. As a result, quadratic rate of convergence is attained in a Newton-Raphson iterative solution strategy. The generality of the proposed formulation is demonstrated through several numerical examples that include finite vibration, centrifugal stiffening of a fast rotating beam, dynamic instability and snap-through, and large overall motions of a free-free flexible beam. Complete details on implementation are given in three appendices.
555 citations
[...]
TL;DR: In this article, a robust nonlinear control law for n-link robot manipulators is derived using the Lyapunov-based theory of guaranteed stability of uncertain systems, where the uncertainty bounds needed to derive the control law and to prove uniform ultimate boundedness of the tracking error depend only on the inertial parameters of the robot.
Abstract: A simple robust nonlinear control law for n-link robot manipulators is derived using the Lyapunov-based theory of guaranteed stability of uncertain systems. The novelty of this result lies in the fact that the uncertainty bounds needed to derive the control law and to prove uniform ultimate boundedness of the tracking error depend only on the inertial parameters of the robot. In previous results of this type, the uncertainty bounds have depended not only on the inertia parameters but also on the reference trajectory and on the manipulator state vector. The presented result also removes previous assumptions regarding closeness in norm of the computed inertia matrix to the actual inertial matrix. The design used thus provides the simplest such robust design available to date. >
362 citations
[...]
TL;DR: These experimental results demonstrate that the adaptive controller enjoys essentially the same level of robustness to unmodelled dynamics as a PD controller, yet achieves much better tracking accuracy than either PD or computed-torque schemes.
Abstract: Earlier work (Slotine and Li, 1986) exploits the particular structure of manipulator dynamics to develop a simple, globally convergent adaptive algorithm for trajectory control problems. The algorithm does not require measurements or estimates of the manipulator's joint accelerations, nor inversion of the estimated inertia matrix. This paper demonstrates the approach on a high-speed 2 d.o.f. semi-direct-drive robot. It shows that the manipulator mass properties, assumed to be initially unknown, can be precisely estimated within the first half second of a typical run. Similarly, the algorithm allows large loads of unknown mass properties to be precisely manipulated. Further, these experimental results demonstrate that the adaptive controller enjoys essentially the same level of robustness to unmodelled dynamics as a PD controller, yet achieves much better tracking accuracy than either PD or computed-torque schemes. Its superior performance for high speed operations, in the presence of parameter uncertainties, and its relative computational simplicity, make it a attractive option both to address complex industrial tasks, and to simplify high-level programming of more standard operations.
360 citations