This minisymposium will highlight recent advances in the use of linear algebra to reveal the intrinsic combinatorial structure of matrices described by graphs and digraphs; and the use of graph theory in developing deeper algebraic and analytic theory for matrices that incorporates the underlying structure of the matrix.

Sebi Cioaba, University of Delaware, The spectral radius and the diameter of connected graphs
Geir Dahl, University of Oslo, Norway, Majorization permutahedra and (0,1)-matrices
Shaun Fallat, University of Regina, Canada, Why are minimum rank of graph problems interesting? (In my opinion)
Miriam Farber, Technion - Israel Institute of Technology, On the connection between weighted graphs and independence number
Willem Haemers, Tilburg University, Graphs cospectral with Kneser graphs
Leslie Hogben, Iowa State University, Average minimum rank of graphs of fixed order
Charlie Johnson, College of William and Mary, Eigenvalues, Multiplicities and Graphs: An Update
Raphael Loewy, Technion-Israel Institute of Technology, The minimum rank of a graph containing a k-clique
Vladimir Nikiforov, University of Memphis, USA, Cut-norms and spectra of matrices
Carlos Saiago, Universidade Nova de Lisboa, Portugal, Eigenvalues and ordered multiplicities for matrices associated with a graph
Dragan Stevanovic, University of Primorska, Slovenia, Integral, square-integral graphs and perfect state transfer

Avi Berman, Principles and tools in teaching linear algebra
Jane Day, Mathematics Department San Jose State University. What Have I Learned?
Edgar Espinosa, TBA
Guershon Harel, TBA
Boris Koichu, Technion - Israel Institute of Technology. The use of Classroom Response Systems (clickers) in teaching linear algebra: Still more questions than answers
Sang-Gu Lee, Sungkyunkwan University, Korea. Contents of Linear Algebra with Sage and Mobile Sage environment
Steve Leon, The second undergraduate level course in linear algebra
Edgard Possani, Instituto Tecnológico Autónomo de México. Using an economics model for teaching linear algebra
Gil Strang, TBA
Frank Uhlig, Questions about Teaching, Teaching Mathematics and Teaching Linear Algebra

Ravi Bapat, Indian Statistical Institute New Delhi, India. On the mean first passage matrix of a simple random walk on a tree
Iddo Ben Ari, University of Connecticut, Storrs, USA. Probabilistic Approach to Perron Root, the Group Inverse, and Applications
Jeffrey Hunter, Auckland University of Technology and Masey University, New Zealand. Coupling and Mixing in Markov Chains
Ali Jadbabaie, TBA
Eugene Seneta, University of Sydney, Australia. Non-negative matrix products and John Hajnal (1924-2008)
Raymond Sze, The Hong Kong Polytechnic University, Kowloon, Hong Kong. On The Inverse Mean First Passage Matrix Problem And The Inverse M--Matrix Problem

Peter Benner, TU Chemnitz, Germany. A Newton-Galerkin-ADI Method for Large-Scale Algebraic Riccati Equations
Michele Benzi, Emory University, Atlanta. Computation of matrix functions arising in the analysis of complex networks
Dario Bini, University of Pisa, Italy. On the numerical solution of the matrix equation sum_{i=1}^k log(XA_i^{-1})=0
Delin Chu, National University of Singapore, Singapore. Inertia and Rank Characterizations of the Expressions A - BXB' - CYC' and A - BXC' +- CX'B'
Tobias Damm, University of Kaiserslautern, Germany. On different classes of Lyapunov equations
Lars Grasedyck, RWTH Aachen, Germany. Hierarchical and Multigrid Methods for Matrix and Tensor Equations
Stefan Güttel, University of Geneva, Switzerland. Krylov-enhanced parallel integrators for linear problems
Marlis Hochbruck, Karlsruhe Institute of Technology, Germany. Rational Approximation to Trigonometric Operators
Bruno Iannazzo, Università di Perugia, Italy. A binary powering Schur algorithm for computing primary matrix roots
Leonid Knizhnerman, Mathematical Modelling Department of Central Geophysical Expedition, Moscow, Russia. Error estimates for two rational Krylov subspace methods to solve the Lyapunov equation with a rank one right-hand side
Peter Lancaster, University of Calgary, Canada. Filters connecting quadratic systems
Wen-Wei Lin, National Chiao Tung University, Taiwan. Stabilizing complex symmetric solution of the equation X + A'X^{-1} A = Q arising in nano research
Federico Poloni, Scuola Normale Superiore, Pisa, Italy. Algorithms for nonnegative quadratic vector equations
Timo Reis, Berlin / TU Hamburg-Harburg, Germany. Lur'e Equations and Even Matrix Pencils
Ninoslav Truhar, University of Osijek, Croatia. Dimension reduction for damping optimization of linear vibrating systems
Krystyna Zietak, Wroclaw University of Technology, Poland. Algorithms for matrix functions

Nonnegative matrix theory is an important area of linear algebra that has been built up from the Perron-Frobenius Theorem and has largely been driven by applications. This minisymposium brings together individuals with experience and interests in classical nonnegative matrix theory, as well as in a variety of generalizations and applications.

Elizabeth Bodine, Washington State University, USA. Spectrally arbitrary patterns over finite fields
Minerva Catral, Iowa State University, USA. Sign patterns that require or allow power-positivity
Abed Elhashash, Drexel University, USA. Matrix Functions Preserving Sets of Generalized Nonnegative Matrices
Dimitrios Noutsos, University of Ioannina, Greece. Nonnegative Jordan bases and characterization of eventually nonnegative matrices
Dale Olesky, University of Victoria, Victoria, BC Canada. Sign Patterns that Allow Eventual Positivity
Juan Peña, University of Zaragoza, Spain, Computations with totally nonnegative and sign-regular matrices
Helena Smigoc, University College Dublin, Dublin. Some constructive methods in the symmetric nonnegative inverse eigenvalue problem
Jeff Stuart, Pacific Lutheran University, Tacoma, Washington, USA. Graphs, Patterns and Powers - From Nonnegative Matrices to Nonpowerful Ray Patterns
Maria Elena Valcher, University of Padova, Italy. On the periodic stabilization of discrete-time positive switched systems
Amy Yielding, Eastern Oregon University, La Grande, OR. Spectrally arbitrary zero-nonzero patterns

Fabio Di Benedetto, University of Genova, Italy. Fifteen years of structured matrices
I Domanov, K.U. Leuven, An enhanced plane search scheme for complex-valued tensor decompositions
Froilan Dopico, Universidad Carlos III de Madrid, Spain. Structured perturbation theory of LDU factorization and accurate computations for diagonally dominant matrices
Yuli Eidelman, Tel Aviv University, Israel. Using quasiseparable structure for polynomial roots computations
Luca Gemignani, University of Pisa, Italy. Rank-structured matrix technology for solving non-linear equations
Carl Jagels, Hanover College, Hanover, IN, USA. Inverses of pentadiagonal recursion matrices
Nicola Mastronardi, Istituto per le Applicazioni del Calcolo, CNR, Bari, Italy. A fast algorithm for updating and downsizing the dominant kernel principal components
Silvia Noschese, Univeristy of Rome, "La Sapienza", Italy. Generalized circulant preconditioners for Toeplitz systems
Victor Pan, Lehman College, CUNY, USA. On the power of randomized preconditioning
Giuseppe Rodriguez, University of Cagliari, Italy. Designing a library for structured linear algebra computation
Ahmed Salam, University Lille Nord de France, France. On structure-preserving Arnoldi-like methods
Michael Stewart, Georgia State University, USA. Error Analysis of a Fast Algorithm for Quasiseparable Systems
Marc Van Barel, K.U. Leuven, Belgium. Unmixing of rational functions by tensor computations
Raf Vandebril, K.U. Leuven, Belgium. A multishift QR-algorithm for hermitian plus low rank matrices
Pavel Zhlobich, University of Connecticut, USA. Twisted Green's (CMV-like) matrices and their factorizations, Laurent polynomials and Digital Filter Structures.

This Mini Symposium will bring together Scientists who use Linear algebra and Multilinear Algebra in their respected fields. The focus is on problems arising in molecular biology, biomedicine and engineering. Most application is related to the processing of biological and chemical data, Drug Discovery, including biological sequences, gene expression data or gene networks, functional genomics, gene network reconstruction reconstruction and Neural Networks. The tools include but not limited to dimension reduction techniques such as Singular Value Decomposition (SVD), Generalized Singular Value Decomposition (GSVD),Principal component analysis (PCA), spectral clustering, Latent Semantic Indexing, Nonlinear Dimension reduction, Support Vector Machine(SVM). The mini symposium will address both deterministic and stochastic frameworks.

Lee Altenberg, University of Hawaii. Spectral Theorems of Karlin for Evolutionary Dynamics
Daniele Bertaccini, University of Rome "Tor Vergata". Linear algebra issues in a fast algorithm for a large scale nonlinear nonlocal model of the inner ear
Ignat Domanov, K.U.Leuven. Enhanced line search for blind channel identification based on the Parafac decomposition of cumulant tensors
Ernesto Estrada, University of Strathclyde Glasgow, UK. TBA
Shmuel Friedland, University of Illinois at Chicago. Phylogenic invariants and tensors of border rank 4 at most in C^{4\times 4\times 4}
David Hoyle, Manchester University, UK. Uses and behaviour of large sample covariances matrices in computational molecular biology with small sample sizes
Lek Heng Lim, University of California, Berkeley. Multiarray signal processing: tensor decomposition meets compressed sensing
Amir Niknejad, College of Mount saint Vincent, Riverdale, NY
Ivan Slapnicar, University of Split. On the spectra of Fibonacci-like operators and modeling invasions by fungal pathogens
Anatoli Torokhti, University of South Australia. Best matrix approximation: the case of filtering with variable memory
Jan Verschelde, University of Illinois at Chicago. Homotopies to solve Multilinear Systems
Marcus Weber, Konrad-Zuse-Zentrum fuer Informationstechnik, Berlin. PCCA+ and Spectral Clustering in Computational Drug Design

Fredholm's method to solve a particular integral equation in 1903, was probably the first written work on generalized inverses. In 1906, Moore formulated the generalized inverse of a matrix in an algebraic setting, which was published in 1920, and in the thirties von Neumann used generalized inverses in his studies of continuous geometries and regular rings. Kaplansky and Penrose, in 1955, independently showed that the Moore "reciprocal inverse" could be represented by four equations, now known as Moore-Penrose equations. A big expansion of this area came in the fifties, when C.R. Rao and J. Chipman made use of the connection between generalized inverses, least squares and statistics. Generalized inverses, as we know them presently, cover a wide range of mathematical areas, such as matrix theory, operator theory, c*-algebras, semi-groups or rings. They appear in numerous applications that include areas such as linear estimation, differential and difference equations, Markov chains, graphics, cryptography, coding theory, incomplete data recovery and robotics. The aim of this mini-symposium, is to gather researchers involved in the study of generalized inverses and to encourage the exchange of ideas.

Konstantin Avrachenkov, INRIA Sophia Antipolis, France. Analytic Perturbations of Generalized Inverses
Nieves Castro-González, Universidad Politécnica de Madrid, Spain. On group invertibility and representations for the group inverse of partitioned matrices
Dragana Cvetkovic-Ilic, University of Nis, Serbia. Representations and additive properties of the Drazin inverse
Tobias Damm, Fachbereich Mathematik, TU Kaiserslautern, Germany. A cancellation property of the Moore-Penrose inverse of triple products
Nebojsa C. Dincic, Faculty of Sciences and Mathematics, University of Nis, Serbia. New results concerning multiple reverse-order law
Esther Dopazo, Universidad Politécnica de Madrid, Spain. On deriving the Drazin inverse of a modified matrix
M. Celeste Gouveia, Department of Mahematics FCTUC, Universidade de Coimbra, Portugal. Generalized inverses on the solution of the Toeplitz-pencil Conjecture
Athanasios Karageorgos, University of Athens, Greece, On the calculation of different type of generalized inverses for a rectangular matrix using the Kronecker canonical form
Xavier Mary, Université de Paris Ouest - Nanterre La Défense (Paris X) France.On Generalized Inverses and Green's Relations
Dijana Mosic, Faculty of Sciences and Mathematics, University of Nis, Serbia. Recent results on generalized inverses
Athanasios Pantelous, Department of Mathematics, University of Liverpool, UK. The generalized inverse of the rectangular Vandermonde matrix
Pedro Patricio, Departamento de Matematica, Universidade do Minho, Braga, Portugal. Additive Drazin inverses
George P. H. Styan, McGill University Montreal, Canada. Magic generalized inverses
Néstor Javier Thome, Universidad Politécnica de Valencia, Spain.Nonnegative Drazin-projectors
Yimin Wei, Fudan University, PR China Condition numbers for the LS and Tikhonov regularization of discrete ill-posed problems

Inverse problems arise in many important applications, including medical imaging, microscopy, geophysics, and astrophysics. Because they often involve large scale, extremely ill-conditioned linear systems, linear algebra problems associated with inverse problems are extremely challenging to solve, both mathematically and computationally. Solution schemes require enforcing regularization, using for example prior information and/or by imposing constraints on the solution. In addition, matrix approximations and fast algorithms for structured matrices must be employed. The speakers in this minisymposium will report on recent research developments involving linear algebra aspects of inverse problems, including algorithms and other computational issues.

Zheng-Jian Bai, Xiamen University. Nonsmooth/Smoothing Optimization Approaches to Structured Inverse Quadratic Eigenvalue Problems
Johnathan Bardsley, University of Montana. Bayesian Hypermodels for Inverse Problems
Mario Bertero, Università di Genova. A survey of scaled gradient projected methods fo nonnegative image reconstruction
Julianne Chung, University of Maryland. Designing Optimal Filters for Ill-Posed Inverse Problems
Claudio Estatico, Università di Cagliari.Structured shift-variant imaging systems and invariant approximations via coordinate transformations
Dario Fasino, Università di Udine. Level set methods for the reconstruction of electrical conductivity by eddy current imaging
Ivan Gerace, Università di Perugia. Edge Preserving Regularization in Color Image Reconstruction
Thomas Huckle, Technische Universitaet Muenchen. Sparse Approximate Inverse Preconditioning for Smoothing and Regularization
Misha Kilmer, Tufts University. Edge Preserving Projection-based Regularization
Lothar Reichel, Kent State University. Iterative methods for Tikhonov Regularization
Rosemary Renaut, Arizona State University. Multisplitting for Regularized Least Squares
Fiorella Sgallari, Università di Bologna. Image restoration by Tikhonov regularization base on generalized Krylov subspace methods

Geometric modeling is the branch of applied mathematics devoted to methods and algorithms for mathematical description of shapes.
Two-dimensional models are of crucial interest in design, technical drawing and computer typography, while three-dimensional models are central to computer-aided-geometric-design (CAGD) and computer-aided-manufacturing (CAM), and widely used in many applied technical fields such as civil and mechanical engineering, architecture, geology, medical image processing, scientific visualization, entertainment. Moreover, since CAGD methods are main ingredients in Isogeometric analysis -- an emergent new paradigm for numerical treatment of PDEs which can be seen as a superset of FEMs -- it turns out that geometric modeling acquires some relevance also in this area.
The main goal of geometric modeling is to create and improve methods, and algorithms for curve and surface representations which is mainly achieved by means of suitable class of functions like splines, or refinable functions to which linear subdivision schemes are associated.
For both, the manipulation and the analysis of such a class of functions, several tools of linear algebra play a crucial role like those suited for structured matrices, totally positive matrices, polynomial equations or computation of joint spectral radius.
Therefore, aim of this mini-symposium is to gather scientist that, working on different aspects of curves ad surface modeling, face classical and new linear algebra problems and use linear algebra tools to move a step forward in their respective fields.

Maria Charina, TU-Dortmund, Germany. The 17-th Hilbert's problem and tight wavelet frames
Maria Antonia Cotronei, University of Reggio Calabria, Italy. An algebraic approach to the construction of multi-channel wavelet filters
Tor Dokken, SINTEF, Oslo, Norway. Approximate Implicitization and Approximate Null Spaces
Luca Gemignani, University of Pisa, Italy. Structured matrix methods for the construction of interpolatory subdivision masks
Nicola Guglielmi, University of L'Aquila, Italy. Computing the joint spectral radius in some subdivison schemes
Kurt Jetter, Universitaet Hohenheim, Germany. Nonnegative Subdivision Revisited
Claudia Moeller, Darmstadt University of Technology, Germany. Exact calculation of the JSR by depth first search on infinite trees
Serena Morigi, University of Bologna, Italy. Parallel interactive shape modelling and deformation using subdivision surfaces
Juan M. Peña, University of Zaragoza, Spain. Recent advances on the applications of totally nonnegative matrices to C.A.G.D.
Vladimir Protassov, Moscow State University, Russia. Computing the joint spectral characteristics of large matrices
Lucia Romani, University of Milano-Bicocca, Italy. Algebraic conditions on non-stationary subdivision symbols for exponential reproduction

The past two decades have witnessed a wide range of fundamental discoveries in quantum information science. These range from protocols revolutionizing public-key cryptography to novel algorithms and tools for communication, information processing, and simulation of physical systems. Even if the mathematical context of quantum information science is wide and multidisciplinary, linear algebra covers a major role, if not ubiquitous. In fact, by the standard formulation of quantum mechanics, physical states and their dynamics are both represented by matrices. The classification of quantum states, schemes for error-correcting codes, methods for allocating quantum resources, promising models of implementable computation, all need a vast number of linear algebraic notions and techniques. This minisymposium is intended as a workshop for strengthening communication between quantum information scientists and the linear algebra community. The minisymposium is a great occasion to present open problems and foster collaborations.

Milan Basic, University of Nis. Characterization of circulant graphs having perfect state transfer
Daniel Burgarth, Imperial College London. Indirect Hamiltonian Estimation
Aram Harrow, University of Bristol and Massachusetts Institute of Technology. A quantum algorithm for linear systems of equations
Marko Petkovic, University of Nis. Perfect state transfer in integral circulant graphs
Paolo Perinotti, University of Pavia, Italy. Higher-order functions in Quantum Theory
Ferenc Szollosi, Central European University, Budapest. Complex Hadamard matrices and combinatorial designs
Wojciech Tadej, Cardinal Stefan Wyszynski University. Continuous families of complex (generalized) Hadamard matrices
Andreas Winter, University of Bristol and National University of Singapore. Zero-error communication via quantum channels, non-commutative graphs and a quantum Lovasz theta function
Karol Zyczkowski, Jagiellonian University. Generalized numerical range as a versatile tool in the theory of quantum information

The purpose of this symposium is to stimulate researches in the area of matrix and operator inequalities and to provide an opportunity for mathematicians in the field to exchange ideas and share most recent developments and information.

Koenraad Audenaert, Royal Holloway, University of London, United Kingdom. On distance measures between positive semidefinite matrices and their applications in quantum information theory
J.C. Bourin, Universite de Franche-Comte, France. Matrix subadditivity inequalities
Roger Horn, University of Utah, USA. -(\sigma_1-\sigma_2)^4>=0
Faud Kittaneh, University of Jordan, Jordan. Jensen matrix inequalities and direct sums
Chi-Kwong Li, College of William and Mary, Williamsburg, USA. Operator Radii and Unitary Operators
Ren-Cang Li, University of Texas at Arlington, USA. Perturbation of Partitioned Hermitian Generalized Eigenvalue Problem
Yiu-Tung Poon, Iowa State University, USA. One Horse Racing Story, Two Card Games, and Three Matrix Theorems
Takashi Sano, Yamagata University, Japan. Loewner matrices and matrix convexity
Raymond Sze, Hong Kong Polytechnic University, Hong Kong. Inequalities in Construction of Higher Rank Numerical Ranges
Tin-Yau Tam, Auburn University, USA. Determinant and Pfaffian of sum of skew symmetric matrices
Fuzhen Zhang, Nova Southeastern University, Fort Lauderdale, USA. Revisiting a Permanent Conjecture on Positive Semidefinite Matrices
Xiaodong Zhang, Shanghai Jiaotong University, China. The Equality Cases for the Inequalities of Oppenheim and Schur for Positive Semi-definite Matrices

The theory of matrix and operator means is currently an active area of research. Investigations include the theoretical study of such means, various axiomatic and variational descriptions and characterizations, computational algorithms for their approximation, geometric interpretations and connections, and applications in a variety of settings. Recent advances include various approaches to define, study, and compute a variety of multivariable means. Applications include derivations of matrix and operator inequalities, finding closed formulas and approximating algorithms for the solution of symmetric and other matrix equations. Another active direction of research is the employing of means for the purpose of averaging, with applications including the averaging of data given in matrix form.

Sejong Kim (Jimmie Lawson), Louisiana State University, The Weighted Multivariable AGH-Mean
Yongdo Lim, Kyungpook National University, Weighted Bini-Meini-Poloni Geometric Means
Masatoshi Fujii, Osaka Kyoiku University, Operator inequalities related to weighted geometric means
Yuki Seo, Osaka Kyoiku University, Polya-Szego inequality for the chaotically geometric mean
J. C. Bourin, Universite de Franche-Comte, France, Interpolation, geometric mean and matrix Chebyshev inequalities
Koenraad Audenaert, University of London, Matrix Means in a Euclidean setting
Frank Hansen, University of Copenhagen, The tracial geometric mean in several variables and related trace inequalities
Masatoshi Ito, Maebashi Institute of Technology, Recent researches on generalized Furuta-type operator functions
Takayuki Furuta, Tokyo University of Science, Operator equations via an order preserving operator inequality
Mitsuru Uchiyama, Shimane University, Operator Monotone Functions, Positive Definite Kernels and Majorization
Takeaki Yamazaki, Kanagawa University, On properties of geometric mean of n-operators via Riemannian metric
Miklos Palfia, Budappest University of Tech. and Economics, Hermitian metrics and matrix means
Eunkyung Ahn, Kyungpook National University, Higher order geometric mean equations based on monotone and jointly homogeneous maps
Hosoo Lee, Kyungpook National University, Weighted Ando-Li-Mathias Geometric means
Fumio Hiai, Tohoku University, Operator log-convex functions and operator means

Max-algebra has existed as a form of linear algebra for almost half a century.
We have seen a massive development in this area especially in the last 15 years.
This is indicated by numerous papers published in leading journals, 5 books, and a good number of conferences or special sessions. This minisymposium provides state-of-the-art research presentations by established researchers in the field.

M. Akian, S. Gaubert and M. Sharify, Paris. Tropical approximation of matrix eigenvalues
M. Akian and P. Poncet, Paris. Representation of maxitive measures
R. Bacos and J.-J. Loiseau, Nantes. Supervisory control of a class of implicit systems
S. Gaubert, Paris and S. Sergeev, Birmingham. The level set method for the two-sided eigenproblem in max-plus algebra
M. Gavalec, J. Plavka, H.Tomaskova. Characterization of non-strictly-monotonous interval eigenvectors in max-min algebra.
A. Guterman, Moscow. Tropical rank and beyond
L. Hardouin, B. Cottenceau, Angers. On the dual product and the dual residuation over idempotent semiring of intervals
V. Kolokoltsov, Warwick. Nonlinear Markov games
W. McEneaney, San Diego. An idempotent approach to continuous-time stochastic control using projection operations
G. Merlet, Marseille. Max-plus linear systems
V. Nitica, West Chester, S. Sergeev, Birmingham. Convex structures and separation in max-min (fuzzy) algebra
A. Peperko, Ljubljana. On the maximum cycle geometric mean
J. Plavka, Kosice, M. Gavalec, Hradec Kralove and J.Polak, Kosice. Efficient algorithms for checking of the robustness and for computing the greatest eigenvector of a matrix in a fuzzy algebra
J.-P. Quadrat, Paris. Fundamental traffic diagrams: a maxplus point of view
K. Zimmermann, Prague and M. Gavalec, Hradec Kralove. Optimization problems under (max,min)-linear two-sided equality constraints.

A variety of applications in science and engineering lead to eigenvalue problems that are nonlinear in the eigenvalue parameter. This includes polynomial, rational, as well as genuinely nonlinear eigenvalue problems. In recent years, tremendous progress has been made in addressing such eigenvalue problems, both on the theoretical and the computational side. The purpose of this minisymposium is to survey these developments and point out new directions in this area. A range of topics will be covered, including linearization, perturbation theory, structure preservation, numerical methods and emerging applications such as photonic band structure calculation.

M. Al-Ammari, The University of Manchester, United Kingdom. Classification of Hermitian Matrix Polynomials with Real Eigenvalues of Definite Type
L. Boulton, Heriot-Watt University, United Kingdom. Eigenvalue enclosures for the Dirac operator
F. De Teran, Universidad Carlos III de Madrid, Spain. Linearizations of rectangular matrix polynomials
F. Dopico, Universidad Carlos III de Madrid, Spain. Generic spectral perturbation results for matrix polynomials
C. Engstroem, ETH Zurich, Switzerland. On nonlinear eigenvalue problems with applications to absorptive photonic crystals
D. Kressner, ETH Zurich, Switzerland. Computation and continuation of invariant pairs for polynomial and nonlinear eigenvalue problems
D. S. Mackey, Western Michigan University, Kalamazoo, USA. Spectral Equivalence and the Rank Theorem for Matrix Polynomials
N. Mackey, Western Michigan University, Kalamazoo, USA. Leave it to Smith: Canonical Forms for Structured Matrix Polynomials, Part II
C. Mehl, Technische Universitaet Berlin, Germany. Leave it to Smith: Canonical Forms for Structured Matrix Polynomials, Part I
V. Mehrmann, TU Berlin, Germany. Nonlinear eigenvalue problems in acoustic field computation
B. Meini, University of Pisa, Italy. A "shift-and-deflate" technique for matrix polynomials
F. Tisseur, The University of Manchester, United Kingdom. Structure Preserving Transformations for Quadratic Matrix Polynomials
H. Voss, Hamburg University of Technology, Germany. Nonlinear low rank modification of a symmetric eigenvalue problem

Spectral graph theory is a fast developing field in modern discrete mathematics with important applications in computer science, chemistry and operational research. By merging combinatorial techniques with algebraic and analytical methods it creates new approaches to hard discrete problems and gives new insights in classical Linear Algebra.
The proposed minisymposium will bring together leading researchers on graph spectra to present their recent results and to discuss new achievements and problems. This meeting will further increase collaboration and boost the development of the field.

Francesco Belardo, University of Messina, Italy. The structure of graphs with small M-indices
Turker Biyikoglu, Isik University, Istanbul, Turkey. Graphs of given order and size and minimal algebraic connectivity
Domingos Cardoso, Universidade de Aveiro, Portugal. Graph Eigenvalues in Combinatorial Optimization
Sebastian Cioaba, University of Delaware, USA. Decompositions of complete hypergraphs
Dragos Cvetkovic, Mathematical institute SANU, Belgrade, Serbia. Some topics on integral graphs
Nair M.M. de Abreu, Federal University of Rio de Janeiro, Brazil. Constructing infinite families of ALQ-integral graphs
Aleksandar Ilic, University of Nis, Serbia. Distance spectral radius of trees
Steve Kirkland, University of Ireland, Maynooth. Algebraic connectivity and vertex-deleted subgraphs
Josef Leydold, WU Vienna, Austria. Geometric nodal domains and extremal graphs with minimal k-th laplacian eigenvalue
Enide Andrade Martins, Universidade de Aveiro, Portugal. A generalization of Fiedler's lemma and some applications
Bojana Mihailovic, University of Belgrade, Serbia. Forbidden subgraphs for some classes of treelike reflexive graphs

Matrix computations with huge-size multilevel matrices, e.g. of order of 2 to power 100, are not easy to make feasible even with structure and supercomputers. However, the former seems much more essential for problems on that scale. Most important structure on that scale is related with separation of variables and eventually with tensors. Thus, successful matrix computations are becoming tensor computations. The purpose of this minisymposium is to present the state of the art in representation and approximation of tensors in higher dimensions. The accent is made on reent findings, in particular on the use of matrix methods for generalized unfolding matrices associated with tensors.

Cesar Caiafa, LABSP-Brain Science Institute, RIKEN, Japan. Approximation of High-Order Tensors by Partial Sampling: New Results and Algorithms
Pierre Comon, I3S, CNRS, Univ. of Nice Sophia-Antipolis. Computing structured tensor decompositions in polynomial time
Mike Espig, Max-Planck-Institut fuer Mathematik in den Naturwissenschaften, Germany. Optimization Problems in Contracted Tensor Networks
Christopher Hillar, Mathematical Sciences Research Institute, Berkeley, USA. Most Tensor Problems are NP Hard
Venera Khoromskaia, Max-Planck-Institute for Mathematics in the Sciences, Leipzig, Germany. Numerical solution of the Hartree-Fock equation in the multilevel tensor structured format
Boris Khoromskij, Max-Planck-Institute for Mathematics in the Sciences, Leipzig, Germany. Prospects of Quantics-TT Approximation in Scientific Computing
Ivan Oseledets, Institute of Numerical Mathematics, Russian Academy of Sciences, Moscow, Russia. Tensor train and QTT decompositions for high-dimensional tensors
Berkant Savas, The University of Texas at Austin, USA. Krylov subspace methods for tensor computations
D.V. Savostyanov, Institute of Numerical Mathematics, Russian Academy of Sciences, Moscow, Russia. New algorithms for Tucker approximation with applications to multiplication of tensor-structured matrices and vectors
Jan Schneider, Max-Planck-Institute for Mathematics in the Sciences, Leipzig, Germany. Generalized Cross Approximation for 3d-tensors
Eugene Tyrtyshnikov, Institute of Numerical Mathematics, Russian Academy of Sciences, Moscow, Russia. The future of tensor computations, or how to escape from the curse of dimensionality

J. C. Abderraman Marrero, Technical University of Madrid, Spain. ARepresentation of the Inverse of Tridiagonal Matrices with Nested Functions
H.R. Afshin, Vali-e-Asr University, Rafsanjan, Iran. Decomposition of Hilbert spaces
Rafig Agaev, Russian Academy of Sciences, Moscow, Russia. Which Digraphs with Ring Structure are Essentially Cyclic?
K. Aretaki, National Technical University of Athens, Greece. Investigating the Numerical Range and q-Numerical Range of Non Square Matrices
Antonio Aricò; Università di Cagliari, Italy. Structured matrix algorithms for solving the Marchenko integral equations
Ali Armandnejad, Vali-e-Asr University of Rafsanjan, Iran. Multivariate and directional majorization on M_{n,m}
Gorka Armentia, The Public University of Navarre, Pamplona, Spain. Second order pseudospectra of normal matrices
Harm Bart, Erasmus University, Rotterdam, The Netherlands. Spectral regularity of Banach algebras of operators with prescribed invariant subspaces and non-commutative Gelfand theory
Natalia Bebiano, CMC and University of Coimbra, Portugal. On the boundary of the Krein space tracial numerical range
Skander Belhaj, Université de Franche-Comté, France. Computing the block factorization of complex Hankel matrices: application to the Euclidean algorithm
Buket Benek Gursoy, National University of Ireland, Maynooth, Ireland. Matrix Polynomials in the Max Algebra; Eigenvalues, Eigenvectors and Inequalities
Enrico Bozzo, Università di Udine, Italy. The importance of a dummy paper
Janko Bracic, University of Ljubljana, Slovenia. Algebraic reflexivity for semigroups of operators
Isabel Brás, University of Aveiro, Portugal. Lorentzian Distance Matrices
Maria Isabel Bueno Cachadina, The University of California, Santa Barbara USA. On the gaps in the set of exponents of boolean primitive circulant matrices
Elisa M. Canete, Universidad de Sevilla, Spain. Naturally graded n-dimensional Leibiniz algebras of nilindex n-3
Miguel V. Carriegos, Universidad de León, Spain.The set of feedback assignable polynomials to a non-controllable single-input linear system
Ana Catarina S. Carapito, Universidade da Beira Interior, Portugal. Block-diagonal stability for switched systems
Paula Carvalho, Universidade de Aveiro, Portugal. (k, tau )-regular sets of circulant graphs
T.P. Cason, Université catholique de Louvain, Louvain-la-Neuve, Belgium. Iterative Methods for Low Rank Approximation of Graph Similarity Matrices
Hal Caswell, Woods Hole Oceanographic Institution, USA. Perturbation analysis of Markov chains: a matrix calculus approach
Pavel Chebotarev, Institute of Control Sciences, Russian Academy of Sciences, Russia. Graph Laplacians and Logarithmic Forest Distances
Mei-Qin Chen, Department of Mathematics and Computer Science, The Citadel, Charleston, USA. Eigenpairs of Adjacency Matrices of Balanced Signed Graphs
Wai-Leong Chooi, University of Malaya, Malaysia. On classical adjoint-commuting mappings between matrix algebras
Christos Chorianopoulos, National Technical University of Athens, Greece. A numerical range for rectangular matrices and matrix polynomials
Eric King-wah Chu, Monash University of Melbourne, Australia. Solution of Non-Symmetric Algebraic Riccati Equations from Transport Theory
Vadim N. Chugunov, Institute of Numerical Mathematics, Russian Academy of Sciences, Moscow, Russia. On normal Hankel matrices
Josep Clotet, Universitat Polit\`ecnica de Catalunya, Spain. A Lower Bound for the Distance from a Controllable Switched Linear System to an Uncontrollable One
John M. Conroy, Center for Computing Sciences, Bowie, MD USA. What's New? Matrix Methods for Extracting Update Summaries
Liliana Costa, University of Aveiro, Portugal. On the faces of faces of the tridiagonal Birkhoff polytope
Glória Cravo University of Madeira and CELC, Portugal. Matrices with Prescribed Characteristic Polynomials and Prescribed Entries
Henrique F. da Cruz, Universidade da Beira Interior, Covilha, Portugal. Pairs of matrices that preserve the value of a generalized matrix function on the set of the upper triangular matrices
Zoubir Dahmani, University of Mostaganem, Algeria. An algebraic method for solving some evolution problems
Achya Dax, Hydrological Service, Jerusalem, Israel. Inputing Missing Entries in a Data Matrix
Inmaculada de Hoyos, Universidad del Pais Vasco Vitoria-Gasteiz, Spain. Obtaining canonical forms associated with the problem of perturbation of one column of a controllable pair
Gregor Dolinar, University of Ljubljana, Slovenia. Preserving quasi-commutativity on self-adjoint operators
Stefano Fanelli, Università di Roma Tor Vergata, Italy. Rank-p corrections for box-constrained global optimization problems
Ajda Fosner, Gea College, Ljubljana, Slovenia.Commutativity preservers on matrix algebras
S. Furtado, University of Porto, and CELC, Portugal. On J-normal matrices with J'-normal principal submatrices
M. I. Garcia-Planas, Universitat Politècnica de Catalunya, Barcelona, Spain. Disturbance decoupling for singular systems by feedback and output injection
Maria T. Gassó, Universidad Politècnica de Valencia, Spain. Full Rank Factorization with Quasy Neville Elimination Process
Federico Greco, Università di Perugia, Italy. The Padé iterations for the matrix sign function and their reciprocals are optimal
Luka Grubisic, University of Zagreb, Croatia. Perturbation theory for block operator matrices and applications
Tung-Ming Huang, National Taiwan Normal University, Taipei, Taiwan. A Null Space Free Jacobi-Davidson Iteration for Three Dimensional Photonic Crystals
Dawie Janse van Rensburg, North-West University, Potchefstroom, South Africa. H-expansive matrices in indefinite inner product spaces and their invariant subspaces
Kyung-Won Kim, Sungkyunkwan University, Korea. The Development of Excel and Sage Math tools for Linear Algebra
André Klein, University of Amsterdam, The Nederlands. On a confluentVandermonde matrix polynomial.
Dorota Kubalinska, University of Bremen, Germany. Interpolation-based model order reduction for unstable LTI systems
Yueh-Cheng Kuo, National University of Kaohsiung, Taiwan. Solvability of regular pencils for quadratic inverse eigenvalue problem
B. Kuzma, University of Primorska, Koper, Slovenia. Jordan orthogonality homomorphisms on Hermitian matrices.
R. Lemos, University of Aveiro, Portugal. Trace inequalities for logarithms and powers of J-Hermitian Matrices
M.M. López-Cabeceira, University of León, Spain. Integer partitions and linear systems over the ring of real continuous functions defined on the unit circle
Vasco Moco Mano, University of Porto, Potugal. Generalized Krein Conditions on the Parameters of a Strongly Regular Graph
Ana Marco, Universidad de Alcalá, Spain. Accurate eigenvalues of Said-Ball-Vandermonde matrices
Agnieszka Miedlar, TU Berlin, Germany. Multi-way adaptive solution of parametric PDE eigenvalue problems
Marilena Mitrouli, University of Athens, Greece.On the growth factor for generalised orthogonal matrices
Juan M. Molera, Universidad Carlos III de Madrid, Spain.High Relative Accuracy Implicit Jacobi Algorithm forthe SVD
Danil Nemirovsky, INRIA Sophia Antipolis, France. Tensor approach to mixed high-order moments of absorbing Markov chains
Mechie Nkengla, University of Illinois, Chicago, USA.Computing Low Rank Approximations of Tensors
Vanni Noferini, University of Pisa, Italy. Exploiting structures in palindromic polynomial eigenvalue problems
Polona Oblak, University of Ljubljana, Slovenia. Commuting and noncommuting graphs of matrices over semirings
Francisco Pedroche, Universitat Politècnica de València, Spain. PageRank and Social Competences on Social Network Sites
Marta Penya, Universitat Politècnica de Catalunya, Barcelona, Spain. Computation of Canonical Forms and Miniversal Deformations of Bimodal Dynamical Systems
Aljosa Peperko, University of Ljubljana, Slovenia. On the spectral radius of non-negative matrices
Bor Plestenjak, University of Ljubljana Slovenia. Singular two-parameter eigenvalue problems and bivariate polynomial systems
Vladimir Protasov, Moscow State University, Russia.When several matrices share an invariant cone?
Panagiotis Psarrakos, National Technical University of Athens, Greece. The distance from a matrix polynomial to a prescribed multiple eigenvalue
Rachel Quinlan, National University of Ireland, Galway, Ireland. Minimum polynomials and spaces of matrices with special rank properties
Paula Rama, Universidade de Aveiro, Portugal. Integral graphs with regularity constraints
A.C.M Ran, Department of Mathematics, VU University, Amsterdam. The pair of operators T^[*]T and TT^[*]; J-dilations and canonical forms
M. Rozloznik, Czech Academy of Sciences, Prague, Czech Republic. Partitioned triangular tridiagonalization: rounding error analysis
Andres Saez-Schwedt, Universidad de Leon, Spain. Single-input systems over von Neumann regular rings
Ahmed Salam, Universit´ Lille Nord de France, France. On a structure-preserving Arnoldi-like methods
S.V. Savchenko, L.D. Landau Institute for Theoretical Physics, Russian Academy of Sciences, Moscow, Russia.Spectra and cycles of length m in regular tournaments of order n
Peter Semrl, University of Ljubljana, Slovenia. Adjacency preserving maps
Debora Sesana, University of Insubria, Como, Italy. Spectral features and asymptotic properties for g-circulants and g-Toeplitz sequences
Ivan Slapnicar, University of Split, Croatia. Jacobi-type algorithms for the Hamiltonian eigenvalue problem
Alicja Smoktunowicz, Warsaw University of Technology, Poland. Computational aspects of the Moore-Penrose inverse
Suvrit Sra, Max-Planck-Institute for biological Cybernetics, Tubingen, Germany. Solving Large-scale Non-negative Least Squares
David Strong, Pepperdine University, Malibu, CA, USA. The Sinkhorn-Knopp Fixed Point Problem with Patterned Matrices
Jan Swoboda, MAx-Planck-Institut fuer Mathematik, Bonn, Germany. Spectraloid operator polynomials, the approximate numerical range and an Enestrom-Kakeya theorem in Hilbert space
Sonia Tarragona, Universidad de León, Spain. Bifurcation analysis of eigenvalues of polynomial matrices smoothly depending on parameters
Nestor Javier Thome, Universidad Politecnica de Valencia, Spain. A class of matrices generalizing the idempotent ones
P. Tichy, Czech Academy of Sciences, Prague, Czech Republic. On efficient numerical approximation of the scattering amplitude
D. Triantafyllou, University of Athens, Greece. Computation of the greatest common divisor of polynomials through Sylvester matrices and applications in image deblurring
Francesco Tudisco, University of Rome "Tor Vergata", Italy. A preconditioning approach to the Google pagerank computing problem
Frank Uhlig, Auburn University, Auburn, AL, USA.Extreme Distance Field of Values Points: How toCompute?
Cornelis Van Der Mee, Università di Cagliari, Italy. Lyapunov Equation Methods for Solving the Matrix Nonlinear Schroedinger Equation
Paris Vassalos, Athens University of Economics and Business, Grece. Matrix algebras can be spectrally equivalent with ill conditioned Toeplitz matrices
David Watkins, Washington State University, USA. Francis's algorithm
James R. Weaver, University of West Florida, Pensacola, FL USA. Block Diagonalization for Matrices A and R when AR = RA or R^{-1}A and R^k = I
David Wenzel, Chemnitz University of Technology, Germany.Commutators with maximal Frobenius norm
H. K. Wimmer, Universitaet Wuerzburg, Germany. Hyperinvariant, characteristic and marked subspaces
Joab R. Winkler, The University of Sheffield, UK. Structured matrix methods for polynomial computations
Iwona Wróbel, Warsaw University of Technology, Poland. On the numerical range of companion matrices
Masahiro Yanagida, Tokyo University of Science, Japan. Matrix inequalities associated with the data processing inequality