Optimization of the forcing term for the solution of two-point boundary value problems (Q355817): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59015803, #quickstatements; #temporary_batch_1707303357582
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 00:03, 5 March 2024

scientific article
Language Label Description Also known as
English
Optimization of the forcing term for the solution of two-point boundary value problems
scientific article

    Statements

    Optimization of the forcing term for the solution of two-point boundary value problems (English)
    0 references
    0 references
    25 July 2013
    0 references
    Summary: We present a new numerical method for the computation of the forcing term of minimal norm such that a two-point boundary value problem admits a solution. The method relies on the following steps. The forcing term is written as a (truncated) Chebyshev series, whose coefficients are free parameters. A technique derived from automatic differentiation is used to solve the initial value problem, so that the final value is obtained as a series of polynomials whose coefficients depend explicitly on (the coefficients of) the forcing term. Then the minimization problem becomes purely algebraic and can be solved by standard methods of constrained optimization, for example, with Lagrange multipliers. We provide an application of this algorithm to the planar restricted three body problem in order to study the planning of low-thrust transfer orbits.
    0 references
    two-point boundary value problem
    0 references
    (truncated) Chebyshev series
    0 references
    automatic differentiation
    0 references
    Lagrange multipliers
    0 references
    algorithm
    0 references
    three body problem
    0 references
    low-thrust transfer orbits
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references