Optimization of computations
From MaRDI portal
Publication:1905130
DOI10.1007/BF02366426zbMath0835.65161OpenAlexW2026441430MaRDI QIDQ1905130
V. K. Zadiraka, M. D. Babich, V. S. Mikhalevich, Ivan V. Sergienko
Publication date: 8 January 1996
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02366426
Analysis of algorithms and problem complexity (68Q25) Complexity and performance of numerical algorithms (65Y20)
Related Items (6)
Computer-based techniques for solving problems of applied and computational mathematics with given quality characteristics ⋮ Some approaches to the analysis of computation optimization problems ⋮ Some directions and results of research in mathematical programming and system analysis ⋮ Estimating the characteristics of the accuracy and computational complexity in approximate methods of global optimization of nonlinear functionals ⋮ A computing experiment in the problem of optimization of computations. I ⋮ Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday)
Cites Work
- Computer implementation of efficient discrete-convolution algorithms
- Strength of a graph and packing of trees and branchings
- An algorithm of approximate solution of systems of nonlinear equations
- Optimal attack and reinforcement of a network
- Parallel computations in linear algebra
- Family of algorithms for solving convex programming problems
- The polynomial solvability of convex quadratic programming
- Investigation of optimization methods and their applications
- Strength and reinforcement of a network and tree packing
- A Fast Parametric Maximum Flow Algorithm and Applications
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimization of computations