Corpus ID: 119166292

Numerical Schubert Calculus via the Littlewood-Richardson Homotopy Algorithm

@article{Leykin2018NumericalSC,
  title={Numerical Schubert Calculus via the Littlewood-Richardson Homotopy Algorithm},
  author={Anton Leykin and Abraham Mart{\'i}n del Campo and Frank Sottile and Ravi Vakil and Jan Verschelde},
  journal={arXiv: Algebraic Geometry},
  year={2018}
}
  • Anton Leykin, Abraham Martín del Campo, +2 authors Jan Verschelde
  • Published 2018
  • Mathematics, Computer Science
  • arXiv: Algebraic Geometry
  • We describe the Littlewood-Richardson homotopy algorithm, which uses numerical continuation to compute solutions of Schubert problems on Grassmannians and is based on the geometric Littlewood-Richardson rule. We provide algorithmic details and discuss its mathematical aspects. We also give an efficient formulation of Schubert problems in local Stiefel coordinates as systems of equations. 

    Figures, Tables, and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 51 REFERENCES

    Introduction to Numerical Continuation Methods

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Schubert calculus

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    A geometric Littlewood-Richardson rule, Annals of Mathematics

    • R. Vakil
    • Second Series
    • 2006
    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    Pole assignment by output feedback

    VIEW 6 EXCERPTS
    HIGHLY INFLUENTIAL

    M

    • M. Sankar
    • Edinburgh Medical and Surgical Journal
    • 1824
    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Numerical Schubert Calculus

    VIEW 3 EXCERPTS

    Pole Placement by Static Output Feedback for Generic Linear Systems

    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL

    Pole assignment by output feedback, Three Decades of Mathematical Systems Theory (H

    • C. I. Byrnes
    • Nijmeijer and J. M. Schumacher, eds.), Lecture Notes in Control and Inform. Sci.,
    • 1989
    VIEW 8 EXCERPTS
    HIGHLY INFLUENTIAL