Difference between revisions of "SIAM Student Chapter Seminar"

From UW-Math Wiki
Jump to: navigation, search
Line 16: Line 16:
 
!align="left" | title
 
!align="left" | title
 
|-
 
|-
|
+
| Sept 20, 4 PM
|
+
| [https://sites.google.com/view/julialindberg/home/ Julia Lindberg] (Electrical and Computer Engineering)
|
+
|''[[#Sept 20, Julia Lindberg (Electrical and Computer Engineering)|Polynomial system solving in applications]]''
 
|-
 
|-
 
|-
 
|-
Line 42: Line 42:
  
 
== Abstracts ==
 
== 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
  
 
<br>
 
<br>

Revision as of 08:46, 15 September 2021



Fall 2021

date speaker title
Sept 20, 4 PM Julia Lindberg (Electrical and Computer Engineering) Polynomial system solving in applications

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


Past Semesters