next up previous Next: About this document ... Up: benches Previous: Difficult problems

  • La page de J-P. Merlet
  • J-P. Merlet home page
  • La page Présentation de HEPHAISTOS
  • HEPHAISTOS home page
  • La page "Présentation" de l'INRIA
  • INRIA home page

    Bibliography

    1
    Bellido A.M.
    Construction of iteration functions for the simultaneous computation of the solutions of equations and algebraic systems.
    Numerical Algorithms, 6(3-4):315-351, 1992.

    2
    Collins C.L.
    Forward kinematics of planar parallel manipulators in the Clifford algebra of $P^2$.
    Mechanism and Machine Theory, 37(8):799-813, Août 2002

    3
    Di Gregorio R.
    Analytic form solution of the forward position analysis of three-legged parallel mechanisms generating SR-PS-RS structures.
    Mechanism and Machine Theory, 41(9):1062-1071, Septembre 2006

    4
    Dietmaier P.
    The Stewart-Gough platform of general geometry can have 40 real postures.
    In ARK, pages 7-16, Strobl, 29 Juin-4 Juillet, 1998

    5
    D.R. Myatt.
    Advanced global optimisation for mission analysis and design.
    Research Report ESA contract AO4532/18138/04/NL/MV, ESA, 2004.

    6
    Floudas C.A. and others .
    Handbook of Test Problems in Local and Global Optimization.
    Kluwer, 1999.

    7
    Kearfott R.B.
    Some tests of generalized bisection.
    ACM Trans. on Mathematical Software, 13(3):197-220, Septembre 1987

    8
    Luksan L. and Vleck J.
    Sparse and partially separable test problems for unconstrained and equality constrained optimization.
    Research Report 767, Institute of Computer Science, Academy of Sciences of the Czeck Republic, Janvier 1999

    9
    Moré J.J., Garbow B.S., and Hillstrom K.E.
    Testing unconstrained optimization software.
    ACM Trans. Math. Software, 7(1):136-140, Mars 1981

    10
    Pramanik S.
    Kinematic synthesis of a six-member mechanism for automotive steering.
    ASME J. of Mechanical Design, 124(4):642-645, Décembre 2002

    11
    Rump S.M.
    Verification methods for dense and sparse systems of equations.
    In Topics in Validated Computations-Studies in Computational Mathematics, pages 63-136. Elsevier, 1994.

    12
    Stoutemyer D.R.
    Useful computations need useful number.
    ACM Communications in Coomputer Algebra, 41(3):75-99, 2007.

    13
    Van Hentenryck P., Michel L., and Benhamou F.
    Newton - Constraint Programming over non-linear Constraints.
    Scientific Programming, 1997.

    14
    Xu Z-B., Zhang J-S., and Wang W.
    A cell exclusion algorithm for determining all the solutions of a nonlinear system of equations.
    Appl. Math. Comput., 80(2):181-208, Décembre 1996

    15
    Yamamura K., Kawata H., and Tokue A.
    Interval solution of nonlinear equations using linear programming.
    BIT, 38(1):186-199, 1998.

    16
    Zufiris P.J. and Guttalu R.S.
    A computational method for finding all roots of a vector function.
    Appl. Math. Comput., 35(1):13-59, Janvier 1990

    jean-pierre merlet