• Plenary Speakers
  • Ravindra Bapat (LAMA Lecturer)
    (Indian Statistical Institute, Delhi, INDIA)
     
    Title: Squared distance matrix of a tree
    Abstract: Let $G$ be a connected graph with vertex set $V(G) = \{1, \ldots, n\}.$
    The distance between vertices $i,j \in V(G),$ denoted $d(i,j),$ is defined to be the minimum length (the number of edges) of a path from $i$ to $j.$
    ... more
  • Peter Benner
    (Max Planck Institute Magdeburg, GERMANY)
     
    Title: Solving Large-Scale Matrix Equations: Recent Progress and New Applications
    Abstract: We discuss the numerical solution of matrix equations that lead to Kronecker tensor structured coefficient matrices when re-written as a standard linear system of the form Ax=b. The prototypes of these equations are Lyapunov and Sylvester equations and
    ... more
  • Dario Bini (LAA Lecturer)
    (University of Pisa, ITALY)
     
    Title: Exploiting matrix structures in polynomial eigenvalue problems: computational issues
    Abstract: The polynomial eigenvalue problem, that is computing the solutions of the equation $\det A(x)=0$ where $A(x)=\sum_{i=0}^d x^iA_i$ and $A_i$ are $n\times n$ matrices, is investigated from the computational point of view in the framework of structured
    ... more
  • Shaun Fallat (Taussky-Todd Lecturer)
    (University of Regina, CANADA)
     
    Title: On the eigenvalues of positive matrices:In the spirit of Taussky Unification
    Abstract: In 1958, Olga Taussky-Todd suggested an exploration into possible unified treatments of a number of properties shared by various notions of "positive matrices." For instance, item 4 in her original list, sought explanations about the fact that both positive
    ... more
  • Andreas Frommer (SIAG/LA Lecturer)
    (University of Wuppertal, GERMANY) SIAG/LA
     
    Title: Arnoldi approximation for matrix functions: how to restart and when to stop
    Abstract: The Arnoldi approximation is a popular -- and sometimes the only feasible -- way to compute f(A)b for a function f, a square matrix A and a vector b when A is large and sparse. Even in the symmetric case, the full Arnoldi (Lanczos) basis has to be stored unless the
    ... more
  • Stephane Gaubert
    (INRIA, Domaine de Voluceau, FRANCE)
     
    Title: FROM TROPICAL LINEAR ALGEBRA TO ZERO-SUM GAMES
    Abstract: Recently, some relations have appeared between tropical algebra, linear programming, Perron-Frobenius theory, and zero-sum games. This talk is devoted to these relations and to their consequences.
    ... more
  • Chi-Kwong Li
    (College of William and Mary, USA)
     
    Title: Some matrix techniques, results, and problems in quantum information science
    Abstract: Some recent results and useful matrix techniques in quantum information science will be described. A general framework covering a number of topics including quantum entanglement, quantum measurements, quantum tomography, quantum error correction, etc.
    ... more
  • Yongdo Lim
    (Sung Kyun Kwan University, KOREA)
     
    Title: Monotonicity of the Karcher mean
    Abstract: The Karcher or least squares mean has recently become an important tool for the averaging and study of positive definite matrices. The important question of the monotonicity (multivariable Loewner-Heinz inequality) of this mean, conjectured by Bhatia and
    ... more
  • Panayiotis Psarrakos
    (National Technical University of Athens, GREECE)
     
    Title: Travelling from matrices to matrix polynomials
    Abstract: The study of matrix polynomials of higher degree has attracted considerable attention in recent years. The interest has been motivated by a wide range of applications of polynomial eigenvalue problems in areas such as differential equations, systems theory,
    ... more
  • Vladimir Sergeichuk
    (Institute of Mathematics, Kiev, UKRAINE)
     
    Title: Classification problems for systems of forms and linear mappings.
    Abstract: A method of reducing the problem of classifying systems of forms and linear mappings to the problem of classifying systems of linear mappings was developed in [V.V. Sergeichuk, Classification problems for systems of forms and linear mappings, Math.
    ... more
  • Bernd Sturmfels
    (University of California-Berkeley, USA)
     
    Title: Beyond Linear Algebra
    Abstract: Linear algebra is the foundation of scientific computing and its numerous applications. Yet, the world is non-linear. In this lecture we argue that it pays off to work with models that are described by non-linear polynomials, while still taking advantage of the power ... more
  • Tin-Yau Tam
    (Auburn University, USA)
     
    Title: Some matrix asymptotic results and their Lie counterparts
    Abstract: We will discuss some recent asymptotic results in matrix space and their extensions in Lie group, namely, (1) Beurling-Gelfand-Yamamoto's theorem and the generalization of Huang and Tam; (2) QR and Iwasawa asymptotic results of Huang and Tam,
    ... more