Testing the Quality of Algorithm Programs

Ivan V. Sergienko (), Valeriy K. Zadiraka () and Oleg M. Lytvyn ()
Additional contact information
Ivan V. Sergienko: National Academy of Sciences of Ukraine
Valeriy K. Zadiraka: National Academy of Sciences
Oleg M. Lytvyn: Ukrainian Engineering Pedagogics Academy

Chapter Chapter 6 in Elements of the General Theory of Optimal Algorithms, 2021, pp 281-335 from Springer

Abstract: Abstract This chapter outlines both the theoretical foundations of testing algorithms and programs, and practical (programs differ from algorithms by the presence of rounding errors). In particular, the subject and purposes of testing and the method of testing are covered. An important issue is the assembly of test kits and the implementation of the experiment. Examples of testing in the calculation of integrals from fast-oscillating functions are also given. One of the main problems of computational mathematics is search ε-solution of the problem for a given processor time. The connection of such characteristics of the computational algorithm as accuracy, memory, and speed is important.

Date: 2021
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-90908-6_6

Ordering information: This item can be ordered from
http://www.springer.com/9783030909086

DOI: 10.1007/978-3-030-90908-6_6

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().