<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Torre_et_al_2018b</id>
		<title>Torre et al 2018b - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Torre_et_al_2018b"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Torre_et_al_2018b&amp;action=history"/>
		<updated>2026-05-06T08:12:25Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Torre_et_al_2018b&amp;diff=150379&amp;oldid=prev</id>
		<title>Rflores: Rflores moved page Draft Flores 689313206 to Torre et al 2018b</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Torre_et_al_2018b&amp;diff=150379&amp;oldid=prev"/>
				<updated>2020-01-30T01:17:06Z</updated>
		
		<summary type="html">&lt;p&gt;Rflores moved page &lt;a href=&quot;/public/Draft_Flores_689313206&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Flores 689313206&quot;&gt;Draft Flores 689313206&lt;/a&gt; to &lt;a href=&quot;/public/Torre_et_al_2018b&quot; title=&quot;Torre et al 2018b&quot;&gt;Torre et al 2018b&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 01:17, 30 January 2020&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Rflores</name></author>	</entry>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Torre_et_al_2018b&amp;diff=150378&amp;oldid=prev</id>
		<title>Rflores: Created page with &quot; == Abstract ==  Lambert’s problem is the two-point boundary-value problem resulting from a two-body orbital transfer between two position vectors in a given time. It lies a...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Torre_et_al_2018b&amp;diff=150378&amp;oldid=prev"/>
				<updated>2020-01-30T01:17:04Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  Lambert’s problem is the two-point boundary-value problem resulting from a two-body orbital transfer between two position vectors in a given time. It lies a...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
Lambert’s problem is the two-point boundary-value problem resulting from a two-body orbital transfer between two position vectors in a given time. It lies at the very heart of several fundamental astrodynamics and space engineering problems and, as such, it has attracted the interest of scientists over centuries. In this work, we revisit the solution of Lambert’s problem based on Levi-Civita regularization developed by Carles Simó in 1973. We offer an exhaustive derivation of the theory, including proofs of all the results and the formulae employed, and we extend the algorithm to deal with multi-revolution transfers. Then, after investigating a range of initial guess search techniques and testing different numerical methods to approximate the solution, we propose a procedure in which the initial guess is assigned very efficiently by querying a pre-defined interpolating table. Then, in order to achieve both speed and robustness, we combine Newton-Raphson with safety checks to avoid out of boundary deviations to approximate the solution. We validate the method through several tests and applications, and we assess its convergence and performance. The algorithm presents no singularities, converges in all realistic scenarios and its computational cost is comparable with state of the art algorithms.&lt;br /&gt;
&lt;br /&gt;
== Full document ==&lt;br /&gt;
&amp;lt;pdf&amp;gt;Media:Draft_Flores_689313206-1638-document.pdf&amp;lt;/pdf&amp;gt;&lt;/div&gt;</summary>
		<author><name>Rflores</name></author>	</entry>

	</feed>