𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two alternatives for the cubic algorithm

✍ Scribed by Efim A Galperin

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
393 KB
Volume
126
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The cubic algorithm
The cubic algorithm
✍ Efim A. Galperin πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 304 KB
Dykstraβ€²s Alternating Projection Algorit
Dykstraβ€²s Alternating Projection Algorithm for Two Sets
✍ H.H. Bauschke; J.M. Borwein πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 768 KB

We analyze Dykstra's algorithm for two arbitrary closed convex sets in a Hilbert space. Our technique also applies to von Neumann's algorithm. Various convergence results follow. An example allows one to compare qualitative and quantitative behaviour of the two algorithms. We discuss the case of fin

The integer cubic algorithm
The integer cubic algorithm
✍ Efim A. Galperin πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 625 KB
The fast cubic algorithm
The fast cubic algorithm
✍ E.A. Galperin πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 944 KB
Cubic spline algorithms for orientation
Cubic spline algorithms for orientation interpolation
✍ I. G. Kang; F. C. Park πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 217 KB

This article presents a class of spline algorithms for generating orientation trajectories that approximately minimize angular acceleration. Each algorithm constructs a twice-di erentiable curve on the rotation group SO(3) that interpolates a given ordered set of rotation matrices at speciΓΏed knot t