Search Results - "Complexity and performance of numerical algorithms"

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

    Randomization, relaxation, and complexity in polynomial equation solving : Banff International Research Station workshop on Randomization, Relaxation, and Complexity, February 28-March 5, 2010, Banff, Ontario, Canada by Randomization, relaxation, and complexity, Gurvits, Leonid, Pébay, Philippe, Rojas, J. Maurice, Thompson, David

    ISBN: 9780821852286, 0821852280
    Published: Providence, R.I American Mathematical Society 2011
    “…This volume corresponds to the Banff International Research Station Workshop on Randomization, Relaxation, and Complexity, held from February 28-March 5, 2010…”
    Get full text
    eBook Book
    Save to List
    Saved in:
  2. 2
    Cover Image

    A Parallel Adaptive Coupling Algorithm for Systems of Differential Equations by Garbey, M., Tromeur-Dervout, D.

    ISSN: 0021-9991, 1090-2716
    Published: Elsevier Inc 01.07.2000
    Published in Journal of computational physics (01.07.2000)
    “…In this paper we address the challenge of metacomputing with two distant parallel computers linked by a slow network and running the numerical approximation of…”
    Get full text
    Journal Article
    Save to List
    Saved in:
  3. 3
    Cover Image

    Separable asymptotic cost of evaluating elementary functions by Favati, P., Lotti, G., Menchi, O., Romani, F.

    ISSN: 1017-1398, 1572-9265
    Published: New York Springer Nature B.V 01.08.2000
    Published in Numerical algorithms (01.08.2000)
    “…The computational cost, in the bit model of computation, of the evaluation of a real function in a point is analyzed, when the number d of correct digits of…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: