- This event has passed.
LANS Seminar
November 17, 2021 @ 10:30 - 11:30 CST
Seminar Title: Probability-One Homotopy Algorithms—How to Solve Hard Problems by Making Them Harder
Speaker: Layne T. Watson, Professor, Departments of Computer Science, Mathematics, and Aerospace and Ocean Engineering, Virginia Polytechnic Institute & State University
Date/Time: November 17, 2021 / 10:30 AM – 11:30 AM
Location: See meeting URL on the cels-seminars website (requires Argonne login)
Host: Tyler Chang
Description: The theory for probability-one (also known as globally convergent) homotopy algorithms was developed in the 1970s, with software and broad application following in the remainder of the 20th century. Initially a mere curiosity, these algorithms evolved into a now standard tool in the nonlinear equation solving toolbox, and for some applications, are the preferred tool. The initial skepticism was partially due to the appearance that homotopy methods make hard problems even harder. This talk will sketch the theory, mathematical software, and applications of globally convergent homotopy algorithms.
Please note that the meeting URL for this event can be seen on the cels-seminars website, which requires an Argonne login.