Now showing items 1-1 of 1

    • Computing lower rank approximations of matrix polynomials 

      Giesbrecht, Mark; Haraldson, Joseph; Labahn, George (Elsevier, 2020-05)
      Given an input matrix polynomial whose coefficients are floating point numbers, we consider the problem of finding the nearest matrix polynomial which has rank at most a specified value. This generalizes the problem of ...


      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages