Write in a clean editor, then format for International Journal of Computer Mathematics in one click — DocuGuru applies the official Taylor & Francis template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
International Journal of Computer Mathematics is a peer-reviewed journal published by Taylor & Francis, covering Numerical methods for differential equations, Differential Equations and Numerical Methods, Matrix Theory and Algorithms. Over its lifetime it has published 5,949 papers, which have received 62,597 citations.
| Publisher | Taylor & Francis |
|---|---|
| Reference style | Numbered (Vancouver/NLM) Numbered — [1], [2] in the text 1. Smith A, Jones B, Lee C. A representative article title. International Journal of Computer Mathematics. 2023;12(3):45–58.
Formats any DOI in International Journal of Computer Mathematics style. No sign-up. |
| Publishes research in | Numerical methods for differential equations Differential Equations and Numerical Methods Matrix Theory and Algorithms Fractional Differential Equations Solutions Advanced Numerical Methods in Computational Mathematics |
| ISSN | 0020-7160 |
| Citation impact (2-yr) | 1.89 |
| h-index | 73 |
| i10-index | 1,717 |
| Top institutions publishing here | Loughborough University |
| Journal website | www.tandfonline.com |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
"Computer vision and pattern recognition." , 84(9), pp. 1265–1266 Additional informationNotes on contributorsNanning Zheng Email: nnzheng@mail.xjtu.edu.cn George Loizou Email: george@dcs.bbk.ac.uk Xuguang Lan Email: xglan@aiar.xjtu.edu.cn Xuelong Li Email: xuelong_li@ieee.org
Click to increase image sizeClick to decrease image size *Here and in what follows f≈g indicates that the differencef—g is bounded, while f∼g indicates that the ratio f:g approaches one Notes *Here and in what follows f≈g indicates that the differencef—g is bounded, while f∼g indicates that the ratio f:g approaches one
A method of generating non-linear transformations for increasing the rate and expanding the domain of convergence of sequences is presented. These transformations represent in a certain sense a generalization of the well-known transformations due to Shanks, and in many cases are more efficient. The transformations would seem to have important application in computing results from…
Abstract This paper presents experimental results on the major benchmarking functions used for performance evaluation of Genetic Algorithms (GAs). Parameters considered include the effect of population size, crossover probability, mutation rate and pseudorandom generator. The general computational behavior of two basic GAs models, the Generational Replacement Model (GRM) and the Steady State Replacement Model (SSRM)…
This paper deals with the numerical approximation of differential equations of fractional order by means of predictor–corrector algorithms. A linear stability analysis is performed and the stability regions of different methods are compared. Furthermore the effects on stability of multiple corrector iterations are verified.
