This paper proposes a unique optimization approach for estimating the minimax rational approximation and its application for evaluating matrix functions. Our method enables the extension to generalized rational approximations and has the flexibility of adding constraints. In particular, the latter allows us to control specific properties preferred in matrix function evaluation. For example, in the case of a normal matrix, we can guarantee a bound over the condition number of the matrix, which one needs to invert for evaluating the rational matrix function. We demonstrate the efficiency of our approach for several applications of matrix functions based on direct spectrum filtering
In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a li...
Computing rational minimax approximations can be very challenging when there are singularities on or...
Author files.International audienceComputing rational minimax approximations can be very challenging...
This study examines the various considerations which are made when a function is approximated by a r...
A rational approximation (that is, approximation by a ratio of two polynomials) is a flexible altern...
This paper presents an efficient method for computing approximations for general matrix functions ba...
In this paper, we develop an optimization-based approach to multivariate Chebyshev approximation on ...
Implements the algorithm of Remez (1962) for polynomial minimax approximation and of Cody et al. (19...
To appear in the proceedings of the 30th IEEE Symposium on Computer Arithmetic (ARITH-30), Portland ...
We develop algorithms that construct robust (i.e., reliable for a given tolerance and scaling indepe...
A. Interpolation and Approximation The problem with which we are concerned is that of finding some f...
In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a li...
Computing rational minimax approximations can be very challenging when there are singularities on or...
Author files.International audienceComputing rational minimax approximations can be very challenging...
This study examines the various considerations which are made when a function is approximated by a r...
A rational approximation (that is, approximation by a ratio of two polynomials) is a flexible altern...
This paper presents an efficient method for computing approximations for general matrix functions ba...
In this paper, we develop an optimization-based approach to multivariate Chebyshev approximation on ...
Implements the algorithm of Remez (1962) for polynomial minimax approximation and of Cody et al. (19...
To appear in the proceedings of the 30th IEEE Symposium on Computer Arithmetic (ARITH-30), Portland ...
We develop algorithms that construct robust (i.e., reliable for a given tolerance and scaling indepe...
A. Interpolation and Approximation The problem with which we are concerned is that of finding some f...
In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a li...
Computing rational minimax approximations can be very challenging when there are singularities on or...
Author files.International audienceComputing rational minimax approximations can be very challenging...