Fast Convolution and Fast Fourier Transform under Interval Uncertainty
Explore this paper's citation graph
Summary
This paper shows how to provide asymptotically accurate ranges for y(t) in time O(n · log(n) in this paper, and formulation of the problem Convolution is important.
- Type
- article
- Published
- 2009-01-01
- Cited by
- 0
- References
- 27
- Access
- Open access
- OpenAlex
- https://openalex.org/W39925740
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:115851259
Keywords
Convolution (computer science), Fast Fourier transform, Interval (graph theory), Computation, Mathematics
References
- Sharpness in Interval Computations
- Applied Interval Analysis
- Arithmetiken für komplexe Kreise
- Fast and Parallel Interval Arithmetic
- On Average Bit Complexity of Interval Arithmetic
- Computational Complexity and Feasibility of Data Processing and Interval Computations
- Fuzzy sets and fuzzy logic
- Applied Interval Analysis: With Examples in Parameter and State Estimation, Robust Control and Robotics
- INTRODUCTION TO CLASSICAL AND MODERN OPTICS
- A First Course in Fuzzy Logic
- Operations on fuzzy numbers
- A note on the extension principle for fuzzy sets
- Introduction to Algorithms
- Introduction to Algorithms
- Galactic and Extra-Galactic Radio Astronomy
- EXTENDED CIRCULAR ARITHMETIC, PROBLEMS AND RESULTS
- Heat Transfer: Study guide
- Einschließungsmengen von Polynom-Nullstellen
- Nested Intervals and Sets: Concepts, Relations to Fuzzy Sets, and Applications
- Komplexe Kreisarithmetik
Cited by
No citing papers recorded for this paper.
Related papers
- A Faster Algorithm for Computing the Sum of p-Boxes
- Fast Computation of a Complex Quadratic Form
- Fast parallel multi-point evaluation of sparse polynomials
- Solving underdetermined systems with error-correcting codes
- Approximate sparse recovery: optimizing time and measurements
- Multiple-precision zero-finding methods and the complexity of elementary function evaluation