SIAM Student Chapter Seminar: Difference between revisions
Jump to navigation
Jump to search
Elsorensen (talk | contribs) mNo edit summary |
Elsorensen (talk | contribs) mNo edit summary |
||
| Line 41: | Line 41: | ||
|- | |- | ||
| Oct 18, 4 PM | | Oct 18, 4 PM | ||
| | | 6104 Social Sciences | ||
| [https://jasonltorchinsky.github.io/ Jason Tochinsky] (Math) | | [https://jasonltorchinsky.github.io/ Jason Tochinsky] (Math) | ||
| | | | ||
| Line 57: | Line 57: | ||
|- | |- | ||
| Dec 6, 4 PM | | Dec 6, 4 PM | ||
| | | Ingraham 214 | ||
| [https://sites.google.com/view/hongxuchen/ Hongxu Chen](Math) | | [https://sites.google.com/view/hongxuchen/ Hongxu Chen](Math) | ||
|} | |} | ||
Revision as of 13:36, 21 September 2021
- When: Mondays at 4 PM
- Where: See list of talks below
- Organizers: Evan Sorensen
- Faculty advisers: Jean-Luc Thiffeault, Steve Wright
- To join the SIAM Chapter mailing list: email siam-chapter+join@g-groups.wisc.edu.
Fall 2021
| date and time | location | speaker | title |
|---|---|---|---|
| Sept 20, 4 PM | Ingraham 214 | Julia Lindberg (Electrical and Computer Engineering) | Polynomial system solving in applications |
| Sept 27, 4 PM, | Zoom (refreshments and conference call in 307) | William Cocke (US Army) | |
| Oct 4, 2:45 PM | TBA | Anjali Nair (Math) | |
| Oct 11, 4 PM, | Zoom (refreshments and conference call in 307) | Kurt Ehlert (Trading Strategy Developer at Auros) | |
| Oct 18, 4 PM | 6104 Social Sciences | Jason Tochinsky (Math) | |
| Oct 25, 4 PM, | Zoom (refreshments and conference call in 307) | Patrick Bardsley (Machine Learning Engineer at Cirrus Logic) | |
| Nov 8, 4 PM, | Zoom (refreshments and conference call in 307) | Liban Mohammed(Machine Learning Engineer at MITRE) | |
| Dec 6, 4 PM | Ingraham 214 | Hongxu Chen(Math) |
Abstracts
Sept 20, Julia Lindberg (Electrical and Computer Engineering)
Polynomial systems arise naturally in many applications in engineering and the sciences. This talk will outline classes of homotopy continuation algorithms used to solve them. I will then describe ways in which structures such as irreducibility, symmetry and sparsity can be used to improve computational speed. The efficacy of these algorithms will be demonstrated on systems in power systems engineering, statistics and optimization