Zhengfeng Yang

Works (4)

Updated: July 5th, 2023 15:54

2018 article

Sparse Polynomial Interpolation With Arbitrary Orthogonal Polynomial Bases

Imamoglu, E., Kaltofen, E. L., & Yang, Z. (2018, July 11). Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, pp. 223–230.

By: E. Imamoglu  n, E. Kaltofen n  & Z. Yang*

Contributors: E. Imamoglu  n, E. Kaltofen n  & Z. Yang*

topics (OpenAlex): Numerical Methods and Algorithms; Polynomial and algebraic computation; Coding theory and cryptography
TL;DR: These algorithms deterministically recover the sparse representation in the First, Second, Third and Fourth Kind Chebyshev representation from exactly t + B evaluations, and generalize to bases whose ChebysHEv recurrences have parametric scalars. (via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: February 25, 2019

2007 article

Approximate factorization of multivariate polynomials using singular value decomposition

Kaltofen, E., May, J. P., Yang, Z., & Zhi, L. (2007, December 5). Journal of Symbolic Computation, Vol. 43, pp. 359–376.

By: E. Kaltofen n , J. May*, Z. Yang* & L. Zhi *

Contributors: E. Kaltofen n , J. May*, Z. Yang* & L. Zhi *

author keywords: multivariate polynomial factorization; approximate factorization; singular value decomposition; numerical algebra; Gauss-Newton optimization
topics (OpenAlex): Numerical Methods and Algorithms; Digital Filter Design and Implementation; Polynomial and algebraic computation
TL;DR: These algorithms are based on a generalization of the differential forms introduced by W. Ruppert and S. Gao to many variables, and use singular value decomposition or structured total least squares approximation and Gauss-Newton optimization to numerically compute the approximate multivariate factors. (via Semantic Scholar)
Sources: Web Of Science, ORCID, NC State University Libraries
Added: August 6, 2018

2007 article

On exact and approximate interpolation of sparse rational functions

Kaltofen, E., & Yang, Z. (2007, July 29). Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, pp. 203–210.

By: E. Kaltofen n  & Z. Yang n

Contributors: E. Kaltofen n  & Z. Yang n

topics (OpenAlex): Advanced Numerical Analysis Techniques; Digital Filter Design and Implementation; Numerical Methods and Algorithms
TL;DR: Five new algorithms for sparse rational function interpolation algorithm in the hybrid symbolic-numeric setting when the black box for the function returns real and complex values with noise are presented and analyzed. (via Semantic Scholar)
Sources: NC State University Libraries, ORCID, NC State University Libraries
Added: August 6, 2018

2007 conference paper

On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms

International Workshop on Symbolic-Numeric Computation: Proceedings. New York: ACM Press.

By: E. Kaltofen , Z. Yang & L. Zhi

Source: NC State University Libraries
Added: August 6, 2018

Citation Index includes data from a number of different sources. If you have questions about the sources of data in the Citation Index or need a set of data which is free to re-distribute, please contact us.

Certain data included herein are derived from the Web of Science© and InCites© (2026) of Clarivate Analytics. All rights reserved. You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.