ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE - Journal - Bridge of Knowledge

Your account

login

Search

ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE

ISSN:

0098-3500

eISSN:

1557-7295

Disciplines
(Field of Science):

  • automation, electronics, electrical engineering and space technologies (Engineering and Technology)
  • information and communication technology (Engineering and Technology)
  • biomedical engineering (Engineering and Technology)
  • mechanical engineering (Engineering and Technology)
  • computer and information sciences (Natural sciences)

Ministry points: Help

Ministry points - current year
Year Points List
Year 2024 200 Ministry scored journals list 2024
Ministry points - previous years
Year Points List
2024 200 Ministry scored journals list 2024
2023 200 Ministry Scored Journals List
2022 200 Ministry Scored Journals List 2019-2022
2021 200 Ministry Scored Journals List 2019-2022
2020 200 Ministry Scored Journals List 2019-2022
2019 200 Ministry Scored Journals List 2019-2022
2018 50 A
2017 50 A
2016 50 A
2015 50 A
2014 45 A
2013 45 A
2012 45 A
2011 45 A
2010 32 A

Model:

Hybrid - transformation agreement

Points CiteScore:

Points CiteScore - current year
Year Points
Year 2023 5
Points CiteScore - previous years
Year Points
2023 5
2022 5.4
2021 4.4
2020 3.7
2019 4.8
2018 7.2
2017 5.8
2016 5.1
2015 4.5
2014 6.7
2013 6.2
2012 5.5
2011 4.8

Impact Factor:

Log in to see the Impact Factor.

Sherpa Romeo:

https://v2.sherpa.ac.uk/id/publication/10684

Papers published in journal

Filters

total: 1

  • Category
  • Year
  • Options

clear Chosen catalog filters disabled

Catalog Journals

Year 2015
  • Complex Root Finding Algorithm Based on Delaunay Triangulation
    Publication

    - ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE - Year 2015

    A simple and flexible algorithm for finding zeros of a complex function is presented. An arbitrary-shaped search region can be considered and a very wide class of functions can be analyzed, including those containing singular points or even branch cuts. The proposed technique is based on sampling the function at nodes of a regular or a self-adaptive mesh and on the analysis of the function sign changes. As a result, a set of candidate points...

    Full text available to download

seen 739 times