Complexity Of Numerical Algorithms

Complexity of Numerical Algorithms is the theoretical measure of computational resources required by numerical algorithms to solve mathematical problems, distinguished by its focus on the efficiency and scalability of operations involving real or floating-point arithmetic.

474

Publications

37.6K

Citations

883

Authors

440

Institutions

Publications per year

2017–2026

64

Authors

883

  1. JD
    James Demmel

    University of California, Berkeley, United States

    7 publications · 591 citations

    7

    h-index

  2. VY
    Victor Y. Pan

    Lehman College, United States

    6 publications · 240 citations

    6

    h-index

  3. FA
    Felix Albu

    Valahia University of Targoviste, Romania

    6 publications · 134 citations

    6

    h-index

  4. SS
    Steve Smale

    City University of Hong Kong, Hong Kong SAR China

    5 publications · 1.7K citations

    5

    h-index

  5. JM
    Jean‐Michel Muller

    Centre National de la Recherche Scientifique, France

    5 publications · 104 citations

    5

    h-index

1–5 of 883

Venues

  1. SIAM Journal on Scientific Computing

    13 publications · 1.9K citations

    13

    h-index

  2. Mathematics of Computation

    MCOM · 12 publications · 1.2K citations

    12

    h-index

  3. SIAM Journal on Computing

    12 publications · 629 citations

    11

    h-index

  4. ACM Transactions on Mathematical Software

    TOMS · 11 publications · 441 citations

    11

    h-index

  5. IEEE Transactions on Computers

    10 publications · 334 citations

    10

    h-index

1–5