Abstract
In numerical analysis, Newton-Raphson method is a root-finding algorithm which generates iterative approximations to the zeroes (or roots) of a real-valued function. This paper describes in a detailed way the mathematical background around the iterative method of Newton-Raphson for systems with two equations. Next, an algorithmic implementation of the iterative method of Newton-Raphson for systems with two equations is developed in Pascal Programming Language, to represent the steps of this method with a procedural programming language with special emphasis on the use of computing in the scientific area of mathematics.
Publisher
Salud, Ciencia y Tecnologia
Reference18 articles.
1. J.M. McNamee: "Numerical Methods for Roots of Polynomials - Part I", Elsevier (2007).
2. J.M. McNamee and Victor Pan: "Numerical Methods for Roots of Polynomials - Part II", Elsevier (2013).
3. Triantafyllou, S. A. (2022). Constructivist Learning Environments. Proceedings of The 5th International Conference on Advanced Research in Teaching and Education, 2022. https://www.doi.org/10.33422/5th.icate.2022.04.10
4. Triantafyllou, S.A. (2023). A Quantitative Research About MOOCs and EdTech Tools for Distance Learning. In: Auer, M.E., El-Seoud, S.A., Karam, O.H. (eds) Artificial Intelligence and Online Engineering. REV 2022. Lecture Notes in Networks and Systems, vol 524. Springer, Cham. https://doi.org/10.1007/978-3-031-17091-1_52
5. Triantafyllou, S.A. (2022). TPACK and Toondoo Digital Storytelling Tool Transform Teaching and Learning. In: Florez, H., Gomez, H. (eds) Applied Informatics. ICAI 2022. Communications in Computer and Information Science, vol 1643. Springer, Cham. https://doi.org/10.1007/978-3-031-19647-8_24