Calculation of double-lunar swingby trajectories: Part 2: Numerical solutions in the restricted problem of three bodies

The double-lunar swingby trajectory is a method for maintaining alignment of an Earth satellite's line of apsides with the Sun-Earth line. From a Keplerian point of view, successive close encounters with the Moon cause discrete, instantaneous changes in the satellite's eccentricity and semimajor axis. Numerical solutions to the planar, restricted problem of three bodies as double-lunar swingby trajectories are identified. The method of solution is described and the results compared to the Keplerian formulation

Some new efficient multipoint iterative methods for solving nonlinear systems of equations

It is attempted to put forward a new multipoint iterative method of sixth-order convergence for approximating solutions of nonlinear systems of equations. It requires the evaluation of two vector-function and two Jacobian matrices per iteration. Furthermore, we use it as a predictor to derive a general multipoint method. Convergence error analysis, estimating computational complexity, numerical implementation and comparisons are given to verify applicability and validity for the proposed methods.This research was supported by Islamic Azad University - Hamedan Branch, Ministerio de Ciencia y Tecnologia MTM2011-28636-C02-02 and Universitat Politecnica de Valencia SP20120474.Lotfi, T.; Bakhtiari, P.; Cordero Barbero, A.; Mahdiani, K.; Torregrosa Sánchez, JR. (2015). Some new efficient multipoint iterative methods for solving nonlinear systems of equations. International Journal of Computer Mathematics. 92(9):1921-1934. https://doi.org/10.1080/00207160.2014.946412S1921193492

On the matrix square root via geometric optimization

This paper is triggered by the preprint "\emph{Computing Matrix Squareroot via Non Convex Local Search}" by Jain et al. (\textit{\textcolor{blue}{arXiv:1507.05854}}), which analyzes gradient-descent for computing the square root of a positive definite matrix. Contrary to claims of~\citet{jain2015}, our experiments reveal that Newton-like methods compute matrix square roots rapidly and reliably, even for highly ill-conditioned matrices and without requiring commutativity. We observe that gradient-descent converges very slowly primarily due to tiny step-sizes and ill-conditioning. We derive an alternative first-order method based on geodesic convexity: our method admits a transparent convergence analysis ($< 1$ page), attains linear rate, and displays reliable convergence even for rank deficient problems. Though superior to gradient-descent, ultimately our method is also outperformed by a well-known scaled Newton method. Nevertheless, the primary value of our work is its conceptual value: it shows that for deriving gradient based methods for the matrix square root, \emph{the manifold geometric view of positive definite matrices can be much more advantageous than the Euclidean view}.Comment: 8 pages, 12 plots, this version contains several more references and more words about the rank-deficient cas

A Class of Steffensen-Type Iterative Methods for Nonlinear Systems

A class of iterative methods without restriction on the computation of Fréchet derivatives including multisteps for solving systems of nonlinear equations is presented. By considering a frozen Jacobian, we provide a class of m-step methods with order of convergence m+1. A new method named as Steffensen-Schulz scheme is also contributed. Numerical tests and comparisons with the existing methods are included

Une approche par l’analyse algébrique effectivedes systèmes linéaires sur des algèbres de Ore

The purpose of this paper is to present a survey on the effective algebraic analysis approach to linear systems theory with applications to control theory and mathematical physics. In particular, we show how the combination of effective methods of computer algebra - based on Gröbner basis techniques over a class of noncommutative polynomial rings of functional operators called Ore algebras - and constructive aspects of module theory and homological algebra enables the characterization of structural properties of linear functional systems. Algorithms are given and a dedicated implementation, called OreAlgebraicAnalysis, based on the Mathematica package HolonomicFunctions, is demonstrated.Le but de ce papier est de présenter un état de l’art d’une approche par l’analyse algébrique effective de la théorie des systèmes linéaires avec des applications à la théorie du contrôle et à la physique mathématique.En particulier, nous montrons comment la combinaison des méthodes effectives de calcul formel - basées sur lestechniques de bases de Gröbner sur une classe d’algèbres polynomiales noncommutatives d’opérateurs fonctionnels appelée algèbres de Ore - et d’aspects constructifs de théorie des modules et d’algèbre homologique permet lacaractérisation de propriétés structurelles des systèmes linéaires fonctionnels. Des algorithmes sont donnés et uneimplémentation dédiée, appelée OREALGEBRAICANALYSIS, basée sur le package Mathematica HOLONOMIC-FUNCTIONS, est présenté

Minimum-lap-time optimisation and simulation

The paper begins with a survey of advances in state-of-the-art minimum-time simulation for road vehicles. The techniques covered include both quasi-steady-state and transient vehicle models, which are combined with trajectories that are either pre-assigned or free to be optimised. The fundamentals of nonlinear optimal control are summarised. These fundamentals are the basis of most of the vehicular optimal control methodologies and solution procedures reported in the literature. The key features of three-dimensional road modelling, vehicle positioning and vehicle modelling are also summarised with a focus on recent developments. Both cars and motorcycles are considered