Abstract
We review the theory of optimal polynomial and rational Chebyshev approximations, and Zolotarev's formula for the sign function over the range (\epsilon \leq |z| \leq1). We explain how rational approximations can be applied to large sparse matrices efficiently by making use of partial fraction expansions and multi-shift Krylov space solvers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have