Search Results - analysis of algorithms). f.2.1 numerical algorithms and problems (computations on matrices*

  • Showing 1 - 3 results of 3
Refine Results
  1. 1

    Introducing: The Libflame Library for Dense Matrix Computations by Van Zee, Field, Chan, Ernie, van de Geijn, Robert, Quintana, Enrique, Quintana-Orti, Gregorio

    ISSN: 1521-9615, 1558-366X
    Published: IEEE 2019
    “… While we did not know it when we started, these techniques appear to solve many of the programmability problems that now face us with the advent of multicore and many-core architectures…”
    Get full text
    Journal Article
  2. 2

    Division-free computation of subresultants using Bezout matrices by Kerber, Michael

    ISSN: 0020-7160, 1029-0265
    Published: Abingdon Taylor & Francis 01.12.2009
    “…We present an algorithm to compute the subresultant sequence of two polynomials that completely avoids division in the ground domain, generalizing an algorithm given by Abdeljaoued et al. [J. Abdeljaoued, G. Diaz-Toca, and L…”
    Get full text
    Journal Article
  3. 3

    Complexity results for some eigenvector problems by Eiter, Thomas, Gottlob, Georg

    ISSN: 0020-7160, 1029-0265
    Published: Abingdon Gordon and Breach Science Publishers 2000
    “…We consider the computation of eigenvectors over the integers, where each component x i satisfies for an integer b…”
    Get full text
    Journal Article