You need to enable JavaScript to run this app.
Fields
Live
Video Archive
Workshop on Linear Computer Algebra and Symbolic-Numeric Computation
October 26-31, 2015
Also show talks that have no video currently available (1)
Date/time
Sort by date/time...
oldest first
newest first
Speaker
Title
Monday October 26
9:00 am
Francois Le Gall
Overview of the recent progress on matrix multiplication
Watch
Monday October 26
9:55 am
Clément Pernet (Université Grenoble-Alpes)
High performance dense linear algebra: arithmetic, algorithms and their parallelization
Watch
Monday October 26
11:10 am
Justin Thaler (Yahoo Labs)
A Crash Course on Fast Interactive Proofs
Watch
Monday October 26
1:45 pm
Jean-Guillaume Dumas (Université de Grenoble Alpes)
Essentially Optimal Certificates in Linear Algebra
Watch
Monday October 26
2:40 pm
Bernhard Beckermann (Université de Lille)
On rational functions without spurious poles
Watch
Monday October 26
4:00 pm
George Labahn (University of Waterloo)
Order bases, kernel bases and their use in fast polynomial matrix arithmetic
Watch
Tuesday October 27
9:00 am
Riccardo Murri (Universität Zurich)
The "Rheinfall" parallel algorithm for Gaussian Elimination
Watch
Tuesday October 27
9:55 am
Jeremy Johnson (Drexel University)
The Probability that Block Wiedemann Correctly Computes Invariant factors
Watch
Tuesday October 27
11:10 am
Mark Giesbrecht (University of Waterloo)
Quasideterminants, Degree Bounds and Algorithms for Matrices of Differential and Difference Polynomials
Watch
Tuesday October 27
1:45 pm
Daniel Steffy (Oakland University)
Symbolic-numeric computation of cutting planes for integer programming
Watch
Tuesday October 27
2:20 pm
Lap Chi Lau
Fast matrix rank algorithms and applications
Watch
Wednesday October 28
9:00 am
Gary Miller (Carnegie Mellon University)
Solving Large Optimization Problems using Spectral Graph Theory
Watch
Wednesday October 28
9:55 am
Vincent Neiger (ENS Lyon)
Fast computation of minimal interpolation bases with arbitrary weights
Watch
Wednesday October 28
11:10 am
Ziad Sultan (laboratoire Jean Kuntzmann)
Adaptive and generic parallel //computation of echelon forms
Watch
Wednesday October 28
1:45 pm
Gregory Bard (University of Wisconsin---Stout)
Exploring the Extended Linearization Algorithm (or XL Algorithm) for Solving Polynomial Systems of Equations, with Remarks toward NP-Completeness
Watch
Wednesday October 28
2:20 pm
Arne Storjohann (University of Waterloo)
Some recent techniques for faster linear algebra
Watch
Thursday October 29
9:00 am
Anton Leykin (Georgia Tech)
Toward a numerical description of a complex affine scheme
Watch
Thursday October 29
9:55 am
Ioannis Emiris (University of Athens)
Sparse implicitization by interpolation matrices
Watch
Thursday October 29
11:10 am
Daniel Lichtblau (Wolfram Research)
Issues in Blind Deconvolution via Computer Algebra (A Tale from the Dark Side)
Watch
Thursday October 29
1:45 pm
Didier Henrion (Centre national de la recherche scientifique (CNRS))
SPECTRA: solving exactly linear matrix inequalities
Watch
Thursday October 29
2:40 pm
Nan Li (Tianjin University)
Verified Solutions of Polynomial Systems
Watch
Friday October 30
9:00 am
Ilias Kotsireas (Wilfrid Laurier University)
Birds and Frogs: polynomial and matrix questions from design theory
Watch
Friday October 30
9:55 am
Rob Corless
Optimal Backward Error and the Leaky Bucket
Watch
Friday October 30
11:10 am
Mohab Safey El Din
Bit complexity for quadratic minimization problems: the generic case
Watch
Friday October 30
1:45 pm
Zhengfeng Yang (East China Normal University)
Error-correcting sparse interpolation of multivariate function
Watch
Friday October 30
2:40 pm
Joseph Haraldson (University of Waterloo)
Computing Approximate GCRDs of Differential Operators
Watch
Saturday October 31
9:55 am
Michael Sagraloff (Max Planck Institute for Informatics)
On Recent Progress in Polynomial Root Finding
Watch
Saturday October 31
11:10 am
Daniel Roche (U.S. Naval Academy)
Sparse floats
Watch