Workshops Period III.

June 19, 20, 21

III.1 : Numerical Linear Algebra

Room 105 (corridor 44-54)

Organizers : 

Speakers

Semi-plenary speakers

To be announced.

Invited speakers

Preliminary program

This schedule is preliminary and could be updated.

Monday, June 19
14:00 ~ 14:30 Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Singular Value Approximation
Cameron Musco - University of Massachusetts Amherst, USA
14:30 ~ 15:00 XTrace: Making the most of every sample in stochastic trace estimation
Joel Tropp - Caltech, USA
15:00 ~ 15:30 Solving the Parametric Eigenvalue Problem by Taylor Series and Chebyshev Expansion
Thomas Mach - University of Potsdam, Germany
15:30 ~ 16:00 Perfect Shifted QR for Rank Structured Pencils
Raf Vandebril - KU Leuven, Belgium
16:30 ~ 17:00 Speeding up Krylov subspace methods for matrix functions via randomization
Alice Cortinovis - Stanford University, United States
17:00 ~ 17:30 Gradient-Type Subspace Iteration Methods for Symmetric Eigen-Problem
Yousef Saad - University of Minnesota, USA
17:30 ~ 18:00 The limit empirical spectral distribution of random matrix polynomials
Vanni Noferini - Aalto University, Finland
Tuesday, June 20
14:00 ~ 14:30 On the Effectiveness of Single Vector Krylov Methods for Low-Rank Approximation
Christopher Musco - New York University,
14:30 ~ 15:00 Condition numbers related to low-rank matrix approximation
Nick Vannieuwenhoven - KU Leuven, Belgium
15:00 ~ 15:30 A nested divide-and-conquer method for tensor Sylvester equations with positive definite hierarchically semiseparable coefficients
Leonardo Robol - University of Pisa, Italy
15:30 ~ 16:00 Structured matrix recovery from matrix-vector products
Alex Townsend - Cornell University, United States
16:30 ~ 17:00 Randomization techniques for solving linear systems of equations and eigenvalue problems
Laura Grigori - EPFL, Switzerland
17:00 ~ 17:30 A new backward error analysis framework for GMRES
Bastien Vieublé - The University of Manchester, United Kingdom
17:30 ~ 18:00 Construction of Lobatto and Kronrod rules from orthogonal Laurent polynomials
Carl Jagels - Hanover College, United States
18:00 ~ 18:30 Are randomized NLA algorithms numerically stable?
Yuji Nakatsukasa - University of Oxford, United Kingdom
Wednesday, June 21
14:00 ~ 14:30 On the optimal value for the conditioning of the eigenvector problem
Carlos Beltrán - Universidad de Cantabria, Spain
14:30 ~ 15:00 Avoiding discretization issues for nonlinear eigenvalue problems
Matthew Colbrook - University of Cambridge, UK
15:00 ~ 15:30 Strongly minimal self-conjugate linearizations for polynomial and rational matrices
Froilán Dopico - Universidad Carlos III de Madrid, Spain
15:30 ~ 16:00 Randomized matrix-free quadrature
Tyler Chen - New York University, USA
16:30 ~ 17:00 Role extraction for digraphs via neighbourhood pattern similarity
Giovanni Barbarino - aalto university, Finland
17:00 ~ 17:30 What part of a numerical problem is ill-conditioned?
Nick Dewaele - KU Leuven, Belgium
17:30 ~ 18:00 Randomized Contour Integral Methods for Eigenvalue Problems
Agnieszka Miedlar - Virginia Tech, United States of America
Posters

 

All abstracts

View all abstracts of this workshop.