Results 11 to 20 of about 26,950 (290)
Кібернетика та комп'ютерні технологіїIntroduction. The main attention is paid to the need to take into account estimates of rounding errors when solving problems of transcomputational complexity.
Valerii Zadiraka, Inna Shvidchenko
doaj +2 more sources
Algorithm for Calculating Primary Spectral Density Estimates Using FFT and Analysis of its Accuracy
Кібернетика та комп'ютерні технології, 2022 Introduction. Fast algorithms for solving problems of spectral and correlation analysis of random processes began to appear mainly after 1965, when the algorithm of fast Fourier transform (FFT) entered computational practice.
Olena Kolomys, Liliya Luts
doaj +1 more source
Code Calibration of the Eurocodes
Applied Sciences, 2021 This article addresses the process to optimally select safety factors and characteristic values for the Eurocodes. Five amendments to the present codes are proposed: (1) The load factors are fixed, γG = γQ, by making the characteristic load of the ...
Tuomo Poutanen
doaj +1 more source
Accounting for Round-Off Errors When Using Gradient Minimization Methods
Algorithms, 2022 This paper discusses a method for taking into account rounding errors when constructing a stopping criterion for the iterative process in gradient minimization methods.
Dmitry Lukyanenko +2 more
doaj +1 more source
An Improved Magnetic Field Method to Locate the Grounding Conductor
Sensors, 2023 The location of the grounding grid conductors is critical for performing corrosion diagnosis and maintenance work. An improved magnetic field differential method to locate the unknown grounding grid based on truncation errors and the round-off errors ...
Fan Yang +4 more
doaj +1 more source
Statistical Analysis of Rounded Data: Measurement Errors vs Rounding Errors [PDF]
Journal of Mathematical Sciences, 2018 Consider the measurements in which the discretization step is constant and without loss of generality is equal to 1. The measured value \(X\) is rounded to the closest integer \(X^*\) according to the rule \(X^*=[X+0.5]\) where \([x]\) is the integer part of \(x\). Measurements of the quantity \(\mu\) are considered as i.i.d. random samples \(X_1,\dots,
Ushakov, Nikolai, Ushakov, Vladimir G.
openaire +2 more sources
Computer Technology for Construction ε-Solution of the Problem
Кібернетика та комп'ютерні технології, 2023 Introduction. Issues of selection and construction of computing resources and methods of their effective use to calculate an approximate solution of the problem with the given accuracy in a limited processor time are considered.
Valerii Zadiraka, Inna Shvidchenko
doaj +1 more source
Models of Computer Calculations
Кібернетика та комп'ютерні технології, 2022 Introduction. The complexity of computational algorithms for solving typical problems of computational, applied, and discrete mathematics is analyzed from the perspective of the theory of computation, depending on the computer architecture and the used ...
Valerii Zadiraka +2 more
doaj +1 more source
Algorithms, 2023 The paper proposes a parallel algorithm for solving large overdetermined systems of linear algebraic equations with a dense matrix. This algorithm is based on the use of a modification of the conjugate gradient method, which is able to take into account ...
Dmitry Lukyanenko
doaj +1 more source
Symmetric and Asymmetric Rounding [PDF]
, 2006 If rounded data are used in estimating moments and regression coefficients, the estimates are typically more or less biased. The purpose of the paper is to study the bias inducing effect of rounding, which is also seen when population moments instead of ...
Ahmad, A. S. +3 more
core +1 more source