Evaluating Non-Analytic Functions of Matrices
Nir Sharon, Yoel Shkolnisky

TL;DR
This paper analyzes how the smoothness of a function and the matrix's properties affect the convergence of Chebyshev polynomial expansions used to evaluate matrix functions.
Contribution
It provides new bounds on convergence rates linking function smoothness and matrix diagonalizability, with numerical illustrations.
Findings
Convergence rates depend on function smoothness and matrix diagonalizability.
Derived bounds clarify the relation between function properties and expansion convergence.
Numerical examples validate the theoretical analysis.
Abstract
The paper revisits the classical problem of evaluating for a real function and a matrix with real spectrum. The evaluation is based on expanding in Chebyshev polynomials, and the focus of the paper is to study the convergence rates of these expansions. In particular, we derive bounds on the convergence rates which reveal the relation between the smoothness of and the diagonalizability of the matrix A. We present several numerical examples to illustrate our analysis.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Optimization Algorithms Research · Mathematical Inequalities and Applications
