Fourier Transform and Other Quadratic Problems Under Interval Uncertainty

authored by

Oscar Galindo, Christopher Ibarra, Vladik Kreinovich, Michael Beer

Abstract

In general, computing the range of a quadratic function on given intervals is NP-hard. Recently, a feasible algorithm was proposed for computing the range of a specific quadratic function—square of the modulus of a Fourier coefficient. For this function, the rank of the quadratic form—i.e., the number of nonzero eigenvalues—is 2. In this paper, we show that this algorithm can be extended to all the cases when the rank of the quadratic form is bounded by a constant.

Organisation(s)

Institute for Risk and Reliability

External Organisation(s)

University of Texas at El Paso

Type

Contribution to book/anthology

Pages

251-256

No. of pages

6

Publication date

04.01.2023

Publication status

Published

Peer reviewed

Yes

ASJC Scopus subject areas

Computer Science (miscellaneous), Control and Optimization, Decision Sciences (miscellaneous), Economics, Econometrics and Finance (miscellaneous), Control and Systems Engineering, Automotive Engineering, Social Sciences (miscellaneous)

Electronic version(s)

https://doi.org/10.1007/978-3-031-16415-6_37 (Access: Closed)