Optimization of computations

This article examines some topics of optimization of computations, which have been discussed at 25 seminar-schools and symposia organized by the V.M. Glushkov Institute of Cybernetics of the Ukrainian Academy of Sciences since 1969. We describe the main directions in the development of computational mathematics and present some of our own results that reflect a certain design conception of speed-optimal and accuracy-optimal (or nearly optimal) algorithms for various classes of problems, as well as a certain approach to optimization of computer computations.

[1]  An algorithm of approximate solution of systems of nonlinear equations , 1982 .

[2]  Yu. V. Kapitonova,et al.  Theory of data structures and synchronous parallel computations , 1976 .

[3]  Henryk Wozniakowski,et al.  Information, Uncertainty, Complexity , 1982 .

[4]  Robert E. Tarjan,et al.  A Fast Parametric Maximum Flow Algorithm and Applications , 1989, SIAM J. Comput..

[5]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[6]  Viktor Mikhaĭlovich Glushkov,et al.  An Introduction to Cybernetics , 1957, The Mathematical Gazette.

[7]  N. Cameron.  Introduction to linear and convex programming , 1985 .

[8]  V. K. Zadiraka,et al.  Computer implementation of efficient discrete-convolution algorithms , 1994 .

[9]  M. D. Babich.  An approximation—Iteration method for solving nonlinear operator equations , 1991, Cybernetics and Systems Analysis.

[10]  N. Z. Shor,et al.  Family of algorithms for solving convex programming problems , 1979 .

[11]  N. Shor,et al.  New algorithms for constructing optimal circumscribed and inscribed ellipsoids , 1992 .

[12]  J. Tukey,et al.  An algorithm for the machine calculation of complex Fourier series , 1965 .

[13]  V. Zhurin,et al.  Introduction to the theory of difference schemes: A. A. Samarskii, 552p. Nauka, Editor-in-chief of physical-mathematical literature, Moscow, 1971☆ , 1973 .

[14]  N. Z. Shor,et al.  A minimization method using the operation of extension of the space in the direction of the difference of two successive gradients , 1971 .

[15]  Åke Björck,et al.  Numerical Methods , 2020, Markov Renewal and Piecewise Deterministic Processes.

[16]  Charles M. Rader,et al.  Number theory in digital signal processing , 1979 .

[17]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[18]  William H. Cunningham,et al.  Optimal attack and reinforcement of a network , 1985, JACM.

[19]  Henryk Wozniakowski,et al.  A general theory of optimal algorithms , 1980, ACM monograph series.

[20]  L. Kantorovich,et al.  Functional analysis in normed spaces , 1952 .

[21]  V. A. Trubin,et al.  Strength and reinforcement of a network and tree packing , 1991 .

[22]  G. Marchuk,et al.  CHISLENNYE METODY V TEORII PERENOSA NEITRONOV. (Numerical Methods in Neutron Transport Theory). , 1971 .

[23]  M. A. Krasnoselʹskii,et al.  Approximate Solution of Operator Equations , 1972 .

[24]  V. N. Faddeeva,et al.  Parallel computations in linear algebra , 1977 .

[25]  V. S. Mikhalevich,et al.  Sequential optimization algorithms and their application. Part I , 1965 .

[26]  L. Khachiyan,et al.  The polynomial solvability of convex quadratic programming , 1980 .