Some results in fixed point error analysis of the Bruun-FTT algorithm
From MaRDI portal
Recommendations
- On the Fixed-Point Accuracy Analysis of FFT Algorithms
- Stability and error estimates of fully discrete schemes for the Brusselator system
- A unified fixed point result along with error estimation and propagation in the fixed point iteration
- An error bound for fixed-point iterations
- Analysis of the BFGS Method with Errors
- Fixed point error analysis of the normalized ladder algorithm
- An error analysis for a certain class of iterative methods
- scientific article; zbMATH DE number 5829215
- Numerical analysis of fixed point algorithms in the presence of hardware faults
- Fixed-point error analysis of the QR-recursive least square algorithm
Cited in
(8)- The equivalence of decimation in time and decimation in frequency in FFT computations
- Comments on ``Fixed-point error analysis of fast Hartley transform
- Synthesis of mechanisms for single and hybrid tasks using differential evolution
- Arithmetic errors in the sub-band FFT: Derivation of error equations and simulation results
- Error analysis of Good-Winograd algorithm assuming correlated truncation errors
- Control of the optimum synthesis process of a four-bar linkage whose point on the working member generates the given path
- Fixed-point error analysis of fast Hartley transform
- On the optimum synthesis of a four-bar linkage using differential evolution and method of variable controlled deviations
This page was built for publication: Some results in fixed point error analysis of the Bruun-FTT algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4275211)