Rational Function Computation

Rational Function Computation is a computational method in symbolic algebra that manipulates ratios of polynomials to perform exact arithmetic, simplification, and evaluation within algorithmic frameworks.

592

Publications

21.9K

Citations

977

Authors

514

Institutions

Publications per year

2017–2026

53

Authors

977

  1. EK
    Erich Kaltofen

    North Carolina State University, United States

    10 publications · 409 citations

    10

    h-index

  2. SC
    Shaoshi Chen

    Johannes Kepler University of Linz, Austria

    8 publications · 270 citations

    8

    h-index

  3. JM
    Jean‐Michel Muller

    Centre National de la Recherche Scientifique, France

    6 publications · 301 citations

    6

    h-index

  4. AB
    Adhemar Bultheel

    KU Leuven, Belgium

    6 publications · 136 citations

    6

    h-index

  5. HB
    H. Bernhard Schlegel

    Wayne State University, United States

    5 publications · 941 citations

    5

    h-index

1–5 of 977

Venues

  1. Journal of Symbolic Computation

    13 publications · 585 citations

    13

    h-index

  2. SIAM Journal on Numerical Analysis

    11 publications · 436 citations

    11

    h-index

  3. Linear Algebra and its Applications

    11 publications · 190 citations

    10

    h-index

  4. arXiv (Cornell University)

    Repository · 10 publications · 230 citations

    10

    h-index

  5. Mathematics of Computation

    MCOM · 9 publications · 325 citations

    9

    h-index

1–5