Chebyshev series expansion of inverse polynomials

@article{Mathar2006ChebyshevSE,
  title={Chebyshev series expansion of inverse polynomials},
  author={Richard J. Mathar},
  journal={Journal of Computational and Applied Mathematics},
  year={2006},
  volume={196},
  pages={596-607}
}
  • R. Mathar
  • Published 22 March 2004
  • Mathematics
  • Journal of Computational and Applied Mathematics
Rigorous uniform approximation of D-finite functions using Chebyshev expansions
TLDR
This work considers the application of classical numerical methods based on a new view of a classical numerical method going back to Clenshaw, combined with a functional enclosure method to compute good uniform approximations of D-finite functions together with rigorous error bounds.
Rigorous Polynomial Approximations and Applications
TLDR
Several applications are presented: one from standard functions implementation in mathematical libraries (libm), another regarding the computation of Chebyshev series expansions solutions of linear ODEs with polynomial coefficients, and an automatic process for function evaluation with guaranteed accuracy in reconfigurable hardware.
Differential equation description and Chebyshev approximation of linear time‐invariant circuits
TLDR
An example of an analogue filter verifies the effectiveness and accuracy of the proposed approximation algorithm and elaborates on the selection process of the order number and the time step length of the Chebyshev expansion according to the demanded truncation error.
Sparse approximate inverses of Gramians and impulse response matrices of large-scale interconnected systems
TLDR
The proposed approximation methodology is computationally feasible for interconnected systems with an extremely large number of local subsystems and opens the door to the development of novel methods for distributed estimation, identification and control of large-scale interconnected systems.
Sparse solution of the Lyapunov equation for large-scale interconnected systems
A survey on Christoffel–Darboux-type identities of Chebyshev polynomials
In this paper, we construct some new Christoffel–Darboux-type identities for Chebyshev polynomials of four kinds. We obtain these types of identities for the derivatives of Chebyshev polynomials.
3D Objects Indexing Using Chebyshev Polynomial
TLDR
A numeric calculation of the coefficients of Chebyshev polynomial with maximum precision is proposed for the search of similar 3D objects to a request object model and to minimize the processing time in the large database.
Distributed dynamic load identification based on shape function method and polynomial selection technique
Abstract A new approach based on shape function method of moving least square fitting (SFM_MLSF) and polynomial selection technique is proposed in this paper for distributed dynamic load
Nonlinear Blind Compensation for Array Signal Processing Application
TLDR
A novel nonlinear blind compensation algorithm aims at the nonlinearity mitigation of array receiver and its spurious-free dynamic range (SFDR) improvement, which will be more precise to estimate the parameters of target signals such as their two-dimensional directions of arrival (2-D DOAs).
Moving Horizon Estimation for Large-Scale Interconnected Systems
TLDR
A novel, distributed MHE method that estimates the state of a local subsystem using only local input-output data is developed by approximating a solution of the MHE problem using the Chebyshev approximation method.
...
1
2
...

References

SHOWING 1-10 OF 60 REFERENCES
The minimality properties of chebyshev polynomials and their lacunary series
  • J. Mason
  • Mathematics, Computer Science
    Numerical Algorithms
  • 2008
TLDR
An extended set of (real) results are given for Chebyshev polynomial minimality in suitably weighted Hölder norms on [−1, 1], as well as (L∞ minimax properties, and bestL1 sufficiency requirements based on ChebysHEv interpolation).
Some estimates of the coefficients in the Chebyshev series expansion of a function
This result is not considered to be very satisfactory. In Sections 2 and 3, we shall consider this problem again, using the method of steepest descents to give an asymptotic estimate for an . In the
The determination of the Chebyshev approximating polynomial for a differentiable function
If f(x) is continuous over any interval, which we may take, without loss of generality, to be the interval — 1 ^ x á 1, there exists a unique polynomial Pn*(x), of given maximum degree n, which is
Construction of rational and negative powers of a formal series
Some methods are described for the generation of fractional and negative powers of any formal series, such as Poisson series or Chebyshev series. It is shown that, with the use of the three
Laurent-Padé approximants to four kinds of Chebyshev polynomial expansions. Part I. Maehly type approximants
TLDR
Padé-Chebyshev approximants are developed not only to first, but also to second, third and fourth kind ChebysheV polynomial series, based throughout on Laurent series representations of the Maehly type.
The evaluation and estimation of the coefficients in the Chebyshev series expansion of a function
Recent investigations have considered the application of Chebyshev series to finding numerical solutions to frequently occurring problems. The quadrature problem has been considered by Clenshaw and
Inverting Polynomials and Formal Power Series
TLDR
It is shown that computing the nth coefficient of the inverse of a general formal power series requires at least ${n / 2}$ nonscalar operations, and that a corresponding lower bound of $s + {{(n + 1)} / {2 - 1}}$ exists.
A Chebyshev polynomial method for line integrals with singularities
TLDR
A Chebyshev polynomial method for the calculation of line integrals along curves with Cauchy principal value or Hadamard finite part singularities, and makes use of a mapping property of the Hadamards finite part operator to calculate the value of the integral.
Algorithm 277: Computation of Chebyshev series coefficients
modification of the classical least squares method is utilized to approximate a solution to the system of nonlinear equations of condition. After every iteration, the statistic E squared is computed
Expansion of hypergeometric functions in series of other hypergeometric functions
In a previous paper (1) one of us developed an expansion for the con- fluent hypergeometric function in series of Bessel functions. A different expansion of the same kind given by Buchholz (2) was
...
1
2
3
4
5
...