Abstract We show that SIESTA, the simplest iterative extension of the Sturm/Triggs algorithm, descends an error function. However, we prove that SIESTA does not converge to usable results. The iterative extension of Mahamud et al. has similar problems, and experiments with “balanced” iterations show that they can fail to converge. We present CIESTA, an algorithm which avoids these problems. It is identical to SIESTA except for one extra, simple stage of computation. We prove that CIESTA descends an error and approaches fixed points. Under weak assumptions, it converges. The CIESTA error can be minimized using a standard descent method such as Gauss–Newton, combining quadratic convergence with the advantage of minimizing in the projective depths.


    Access

    Download


    Export, share and cite



    Title :

    Iterative Extensions of the Sturm/Triggs Algorithm: Convergence and Nonconvergence


    Contributors:


    Publication date :

    2006-01-01


    Size :

    14 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Iterative Extensions of the Sturm/Triggs Algorithm: Convergence and Nonconvergence

    Oliensis, J. / Hartley, R. | British Library Conference Proceedings | 2006


    Convergence Criteria for Iterative Processes

    PAL G. BERGAN AND RAY W. CLOUGH | AIAA | 1972


    Sturm im Computer

    Opel,Ruesselsheim,DE | Automotive engineering | 1989


    Sturm und Drang

    Mutschler, Stefan | IuD Bahn | 2003


    Navigieren im Sturm

    Erlat, Michael | IuD Bahn | 2004