World's Best Scientists 2026 revealed!
Numerical Algorithms
H-index 21

Numerical Algorithms

1017-1398

Published by: Springer

https://www.springer.com/journal/11075

Ranking & Metrics

Discipline name Position Best Scientists Publications D-Index
Mathematics 57 114 225 21
Computer Science 621 18 29 9

Additional Metrics

Number of Best Scientists*: 152
Documents by Best Scientists*: 262
Top 100 Ranked Scientists*: 10
SCIMAGO H-index: 80
SCIMAGO SJR: 0.859
Impact Factor: 2

Overview

Top Research Topics at Numerical Algorithms?

The primary areas of discussion in Numerical Algorithms are Numerical analysis, Theory of computation, Mathematical analysis, Applied mathematics and Algorithm. The concepts on Numerical analysis presented in the journal can also apply to other research fields, including Iterative method, Mathematical optimization, Algebra over a field, Nonlinear system and Discretization. Preconditioner is the primary subject of Iterative method works presented in the journal.

The main emphasis of it is the research on Nonlinear system, emphasizing the topic of Local convergence. Theory of computation research presented in it encompasses a variety of subjects, including Discrete mathematics, Combinatorics, Function (mathematics), Algebra and Computation. Topics in Mathematical analysis were tackled in line with various other fields like Eigenvalues and eigenvectors, Finite element method and Stability (probability).

In the journal, Rate of convergence, Linear system, Matrix (mathematics) and Interpolation are investigated in conjunction with one another to address concerns in Applied mathematics research.

  • Numerical analysis (66.36%)
  • Theory of computation (43.13%)
  • Mathematical analysis (36.60%)

What are the most cited papers published in the journal?

  • REGULARIZATION TOOLS: A Matlab package for analysis and solution of discrete ill-posed problems (1446 citations)
  • A multiprojection algorithm using Bregman projections in a product space (809 citations)
  • Numerical integration using sparse grids (781 citations)

Research areas of the most cited articles at Numerical Algorithms:

The published papers mainly deal with areas of study such as Numerical analysis, Mathematical analysis, Theory of computation, Applied mathematics and Algorithm. The journal publications focus on Numerical analysis but sometimes tackle the closely related topic of Nonlinear system which is concerned with Discretization. The most cited publications explore issues in Mathematical analysis which can be linked to other research areas like Matrix (mathematics), Finite element method and Stability (probability).

What topics the last edition of the journal is best known for?

  • Mathematical analysis
  • Numerical analysis
  • Complex number

The previous edition focused in particular on these issues:

The foci of Numerical Algorithms are Numerical analysis, Applied mathematics, Theory of computation, Algorithm and Nonlinear system. It features research on Numerical analysis in an attempt to reinforce studies in the field of Mathematical analysis. Topics in Applied mathematics explored in it were investigated in conjunction with research in Linear system, Boundary value problem, Iterative method, Rate of convergence and Lipschitz continuity.

Lipschitz continuity research discussed connects with the study of Variational inequality. The presented research on Theory of computation deals specifically with Hilbert space but it also addresses topics in Projection (linear algebra). It centers on topics in Finite element method, with a focus on Galerkin method.

The most cited articles from the last journal are:

  • Halpern-type iterative process for solving split common fixed point and monotone variational inclusion problem between Banach spaces (29 citations)
  • Evolutionary derivation of Runge–Kutta pairs for addressing inhomogeneous linear problems (12 citations)
  • Newton’s method with fractional derivatives and various iteration processes via visual analysis (11 citations)

Papers citation over time

A key indicator for each journal is its effectiveness in reaching other researchers with the papers published at that venue.

The chart below presents the interquartile range (first quartile 25%, median 50% and third quartile 75%) of the number of citations of articles over time.

The top authors publishing in Numerical Algorithms (based on the number of publications) are:

  • Lothar Reichel (37 papers) published 4 papers at the last edition, 1 more than at the previous edition,
  • Walter Gautschi (25 papers) published 2 papers at the last edition,
  • Ioannis K. Argyros (24 papers) absent at the last edition,
  • Claude Brezinski (23 papers) absent at the last edition,
  • John C. Butcher (23 papers) absent at the last edition.

The overall trend for top authors publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top authors.

Only papers with recognized affiliations are considered

The top affiliations publishing in Numerical Algorithms (based on the number of publications) are:

  • University of Zaragoza (43 papers) published 2 papers at the last edition, 1 more than at the previous edition,
  • Katholieke Universiteit Leuven (42 papers) published 1 paper at the last edition the same number as at the previous edition,
  • Kent State University (42 papers) published 4 papers at the last edition, 1 more than at the previous edition,
  • University of Auckland (36 papers) published 1 paper at the last edition,
  • Lanzhou University (34 papers) published 4 papers at the last edition, 1 less than at the previous edition.

The overall trend for top affiliations publishing in this journal is outlined below. The chart shows the number of publications at each edition of the journal for top affiliations.

Publication chance based on affiliation

The publication chance index shows the ratio of articles published by the best research institutions in the journal edition to all articles published within that journal. The best research institutions were selected based on the largest number of articles published during all editions of the journal.

The chart below presents the percentage ratio of articles from top institutions (based on their ranking of total papers).Top affiliations were grouped by their rank into the following tiers: top 1-10, top 11-20, top 21-50, and top 51+. Only articles with a recognized affiliation are considered.

During the most recent 2021 edition, 10.16% of publications had an unrecognized affiliation. Out of the publications with recognized affiliations, 7.42% were posted by at least one author from the top 10 institutions publishing in the journal. Another 7.77% included authors affiliated with research institutions from the top 11-20 affiliations. Institutions from the 21-50 range included 12.01% of all publications and 72.79% were from other institutions.

Returning Authors Index

A very common phenomenon observed among researchers publishing scientific articles is the intentional selection of journals they have already attended in the past. In particular, it is worth analyzing the case when the authors participate in the same journal from year to year.

The Returning Authors Index presented below illustrates the ratio of authors who participated in both a given as well as the previous edition of the journal in relation to all participants in a given year.

Returning Institution Index

The graph below shows the Returning Institution Index, illustrating the ratio of institutions that participated in both a given and the previous edition of the conference in relation to all affiliations present in a given year.

The experience to innovation index

Our experience to innovation index was created to show a cross-section of the experience level of authors publishing in a journal. The index includes the authors publishing at the last edition of a journal, grouped by total number of publications throughout their academic career (P) and the total number of citations of these publications ever received (C).

The group intervals were selected empirically to best show the diversity of the authors' experiences, their labels were selected as a convenience, not as judgment. The authors were divided into the following groups:

  • Novice - P < 5 or C < 25 (the number of publications less than 5 or the number of citations less than 25),
  • Competent - P < 10 or C < 100 (the number of publications less than 10 or the number of citations less than 100),
  • Experienced - P < 25 or C < 625 (the number of publications less than 25 or the number of citations less than 625),
  • Master - P < 50 or C < 2500 (the number of publications less than 50 or the number of citations less than 2500),
  • Star - P ≥ 50 and C ≥ 2500 (both the number of publications greater than 50 and the number of citations greater than 2500).

The chart below illustrates experience levels of first authors in cases of publications with multiple authors.

Top Publications

  • Analysis of spectral Hamiltonian boundary value methods (SHBVMs) for the numerical solution of ODE problems

    Pierluigi Amodio;Luigi Brugnano;Felice Iavernaro

    (2020)
    62 Citations
  • Weak and strong convergence theorems for solving pseudo-monotone variational inequalities with non-Lipschitz mappings

    Duong Viet Thong;Yekini Shehu;Olaniyi Samuel Iyiola

    (2020)
    50 Citations
  • An efficient projection-type method for monotone variational inequalities in Hilbert spaces

    Yekini Shehu;Xiao-Huan Li;Qiao-Li Dong

    (2020)
    49 Citations
  • Inertial relaxed CQ algorithms for solving a split feasibility problem in Hilbert spaces

    Daya Ram Sahu;Yeol Je Cho;Yeol Je Cho;Qiao-Li Dong;M. R. Kashyap

    (2021)
    42 Citations
  • A new algorithm for solving the split common null point problem in Hilbert spaces

    Simeon Reich;Truong Minh Tuyen

    (2020)
    40 Citations
  • New algorithms and convergence theorems for solving variational inequalities with non-Lipschitz mappings

    Simeon Reich;Duong Viet Thong;Qiao-Li Dong;Xiao-Huan Li

    (2021)
    39 Citations
  • α-robust error analysis of a mixed finite element method for a time-fractional biharmonic equation

    Chaobao Huang;Martin Stynes

    (2021)
    38 Citations
  • Inertial projection-type methods for solving pseudomonotone variational inequality problems in Hilbert space

    Simeon Reich;Duong Viet Thong;Prasit Cholamjiak;Luong Van Long

    (2021)
    37 Citations
  • New strong convergence theorem of the inertial projection and contraction method for variational inequality problems

    Duong Viet Thong;Yeol Je Cho;Yeol Je Cho

    (2020)
    37 Citations
  • Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing

    Yekini Shehu;Olaniyi Samuel Iyiola;Ferdinard U. Ogbuisi;Ferdinard U. Ogbuisi

    (2020)
    35 Citations

Related Online Degrees & Career Pathways

Pursuing a Computer Science degree online offers flexibility and access to numerous educational opportunities. Many students seek the least expensive online bachelor's degree options to minimize debt while still gaining valuable skills in programming, data analysis, and software development.

For those eager to enter the workforce quickly, exploring accelerated career programs can significantly reduce the time needed to graduate. These programs are designed to fast-track education without compromising on quality.

Career prospects for Computer Science graduates are promising, with the field consistently ranking among the most lucrative college degrees. High demand for tech professionals ensures competitive salaries and diverse job opportunities in software engineering, cybersecurity, and AI development.

Additionally, many accredited institutions now offer streamlined admissions processes, some even waiving fees. Finding colleges with free application fees can reduce upfront costs and make higher education more accessible.

Best Scientists Contributing to This Journal

Recently Published Articles