What do sparse interpolation, padé approximation, gaussian quadrature and tensor decomposition have in common?
Abstract
References
Recommendations
From quotient-difference to generalized eigenvalues and sparse polynomial interpolation
SNC '07: Proceedings of the 2007 international workshop on Symbolic-numeric computationThe numerical quotient-difference algorithm,or the qd-algorithm, can be used for determining the poles of a meromorphic function directly from its Taylor coeffcients. We show that the poles computed in the qd-algorithm, regardless of their ...
The two-point Padé approximation problem and its Hankel vector
AbstractThe two-point Padé approximation problem is to find a ratio of two coprime polynomials with some constraints on their degrees to approximate a function whose power series expansions at the origin and at infinity are given. In this paper, we ...
Multivariate Padé approximation
Special issue on numerical analysis in the 20th century vol. 1: approximation theory
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
- General Chairs:
- Ioannis Z. Emiris,
- Lihong Zhi,
- Publications Chair:
- Angelos Mantzaflaris
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Tutorial
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 57Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in