𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Computing the distance from a point to a helix and solving Kepler's equation

✍ Scribed by Yves Nievergelt


Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
439 KB
Volume
598
Category
Article
ISSN
0168-9002

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Chebyshev expansion on intervals with br
✍ John P. Boyd πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 976 KB

When two or more branches of a function merge, the Chebyshev series of u(Ξ») will converge very poorly with coefficients a n of T n (Ξ») falling as O(1/n Ξ± ) for some small positive exponent Ξ±. However, as shown in [J.P. Boyd, Chebyshev polynomial expansions for simultaneous approximation of two branc

Computing Weierstrass Semigroups and the
✍ A Campillo; J.I FarrΓ‘n πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 202 KB

We present an algorithm to compute the Weierstrass semigroup at a point P together with functions for each value in the semigroup, provided P is the only branch at in"nity of a singular plane model for the curve. As a byproduct, the method also provides us with a basis for the spaces L(mP) and the c

The Distance from l to a Subspace of Lp
✍ D. R. Lewis πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 242 KB

For ( p -2) (r-2)-=0 andB any n-dimensional subspaw of an Lppace, the BANAVH-MAWR distance from Z : to E' is at most cn"(1og n)P, where ct is the natural exponent a --I 1 1 1 =mas { -i. 1 , -I ) and fi depends on p nud r. 'For E and F normed spaces the BANACH-MAZUR distance from E to F is defined t