Quasiseparable matrices is a relatively new class of rank-structured matrices that naturally arise in many applications of numerical analysis. Examples include interpolation by polynomials, factorization of moment matrices, polynomial root finding. We will talk specifically about their application in solving partial differential equations and PDE-constrained optimal control problems. We will show that for a certain class of problems the use of quasiseparable matrices techniques leads to system solvers of asymptotically linear complexity in the dimension of the system. The talk aims to give a gentle introduction to quasiseparable matrices theory and does not assume any familiarity with the topic.
Current 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
