Some approaches to the analysis of computation optimization problems

DOI10.1007/BF02366492zbMATH Open0875.65143OpenAlexW1978855243MaRDI QIDQ1364039FDOQ1364039

V. K. Zadiraka, I. V. Sergienko, M. D. Babich

Publication date: 26 October 1997

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02366492

zbMATH Keywords

mathematical programmingmeasure of accuracyreconstruction of functionsstatistical data processingcomputer algorithmsoptimizations of computations

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Title not available (Why is that?)
• Integral equations with constraints and their solution methods
• Title not available (Why is that?)
• Title not available (Why is that?)
• Optimization of computations
• Title not available (Why is that?)
• An algorithm of approximate solution of systems of nonlinear equations
• Title not available (Why is that?)
• Approximate method for separation of solutions of nonlinear operator equations
• Optimization of a class of information compression algorithms
• Fast multiplication of long numbers using FFT
• Set problems in analysis and design of control systems
• Computational complexity of integrating ordinary differential equations
• Optimal zone coding using the slant transform
• Macroparallelism and the decomposition of algorithms
• Title not available (Why is that?)

Cited In (1)

• A computing experiment in the problem of optimization of computations. I

This page was built for publication: Some approaches to the analysis of computation optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1364039)