Abstract
It is possible to build algorithms for processes considered complicated. The practical difficulties associated with the execution of these processes derive from the fact that the algorithms often require an enormous number of operations, even if every single operation is simple. The more complex operations are performed by repetition of the simpler ones. This is one of the reasons why algorithms are associated with automatic calculating machines. The chapter describes: how to find the maximum value in an n-tuple of numerical data, the Euclidean Greatest Common Divisor, the Regular subdivision of a segment (with block diagram), Gauss elimination.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Bibliography
Adler, I.: Thinking Machines. The John Day Co., NewYork (1961)
Adler, I.: New Look at Geometry. Dover Publications Inc., New York (2012)
Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, Reading, Massachusetts (1974)
McCracken, D.D., Dorn, W.S.: Numerical Methods and Fortran Programming. John Wiley and Sons Inc., New York (1966)
Trakhtenbrot, B.A.: Algorithms and Automatic Computing Machines. D. C. Heath and Company, Boston (1963)
Ventre, A.: Algebra lineare e algoritmi. Zanichelli, Bologna (2021)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Ventre, A.G.S. (2023). Algorithms. In: Calculus and Linear Algebra. Springer, Cham. https://doi.org/10.1007/978-3-031-20549-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-031-20549-1_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-20548-4
Online ISBN: 978-3-031-20549-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)