Rank-structured QR for Chebyshev rootfinding

10/22/2020
by   Angelo Casulli, et al.
0

We consider the computation of roots of polynomials expressed in the Chebyshev basis. We extend the QR iteration presented in [Eidelman, Y., Gemignani, L., and Gohberg, I., Numer. Algorithms, 47.3 (2008): pp. 253-273] introducing an aggressive early deflation strategy, and showing that the rank-structure allows to parallelize the algorithm avoiding data dependencies which would be present in the unstructured QR. The method exploits the particular structure of the colleague linearization to achieve quadratic complexity and linear storage requirements. The (unbalanced) QR iteration used for Chebyshev rootfinding does not guarantee backward stability on the polynomial coefficients, unless the vector of coefficients satisfy ‖ p‖≈ 1, an hypothesis which is almost never verified for polynomials approximating smooth functions. Even though the presented method is mathematically equivalent to the latter algorithm, we show that exploiting the rank structure allows to guarantee a small backward error on the polynomial, up to an explicitly computable amplification factor γ̂_1(p), which depends on the polynomial under consideration. We show that this parameter is almost always of moderate size, making the method accurate on several numerical tests, in contrast with what happens in the unstructured unbalanced QR. We also discuss the connection between the size of this amplification factor and the existence of a good balancing. This provides some insight on why the accuracy of our method is often very close to balanced QR iteration.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/09/2019

Structured backward errors in linearizations

A standard approach to compute the roots of a univariate polynomial is t...
research
04/23/2021

Bounds-constrained polynomial approximation using the Bernstein basis

A fundamental problem in numerical analysis and approximation theory is ...
research
01/15/2020

Min-Max Elementwise Backward Error for Roots of Polynomials and a Corresponding Backward Stable Root Finder

A new measure called min-max elementwise backward error is introduced fo...
research
04/29/2020

On the Existence of Algebraically Natural Proofs

For every constant c > 0, we show that there is a family {P_N, c} of pol...
research
05/27/2021

Tensor numerical method for optimal control problems constrained by an elliptic operator with general rank-structured coefficients

We introduce tensor numerical techniques for solving optimal control pro...
research
03/21/2020

Backward Error Measures for Roots of Polynomials

We analyze different measures for the backward error of a set of numeric...
research
08/11/2018

Fast RodFIter for Attitude Reconstruction from Inertial Measurements

Attitude computation is of vital importance for a variety of application...

Please sign up or login with your details

Forgot password? Click here to reset