Search Results - "f.2.1[analysis of algorithms and problems complexity"

  • Showing 1 - 4 results of 4
Refine Results
  1. 1
    Cover Image

    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…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  2. 2
    Cover Image

    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. We address various problems in this…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Cover Image

    Systolic givens factorization of dense rectangular matrices by Cosnard, Michel, Robert, Yves

    ISSN: 0020-7160, 1029-0265
    Published: Abingdon Gordon and Breach Science Publishers 01.01.1988
    “…Given an m by n dense matrix A(m≧n) we consider parallel algorithms to compute its orthogonal factorization via Givens rotations. First we describe an…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  4. 4
    Cover Image

    Block LU decompositon of a band matrix on a systolic array by Robert, Yves

    ISSN: 0020-7160, 1029-0265
    Published: Gordon and Breach Science Publishers 01.01.1985
    “…After a brief discussion on systolic arrays for band matrix LU or QR decomposition, we introduce a new systolic array for the block 2x2 LU decompositon of a…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: