| 2013 | ||
|---|---|---|
| j18 | Ilias S. Kotsireas, Bernard Mourrain, Victor Y. Pan, Lihong Zhi: Preface. Theor. Comput. Sci. 479: 1-3 (2013) | |
| j17 | Zijia Li, Lihong Zhi: Computing the nearest singular univariate polynomials with given root multiplicities. Theor. Comput. Sci. 479: 150-162 (2013) | |
| j16 | Nan Li, Lihong Zhi: Verified error bounds for isolated singular solutions of polynomial systems: Case of breadth one. Theor. Comput. Sci. 479: 163-173 (2013) | |
| 2012 | ||
| j15 | Erich Kaltofen, Bin Li, Zhengfeng Yang, Lihong Zhi: Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients. J. Symb. Comput. 47(1): 1-15 (2012) | |
| j14 | Xiaoli Wu, Lihong Zhi: Determining singular solutions of polynomial systems via symbolic-numeric reduction to geometric involutive forms. J. Symb. Comput. 47(3): 227-238 (2012) | |
| j13 | Aurélien Greuet, Feng Guo, Mohab Safey El Din, Lihong Zhi: Global optimization of polynomials restricted to a smooth variety using sums of squares. J. Symb. Comput. 47(5): 503-518 (2012) | |
| j12 | Nan Li, Lihong Zhi: Computing the multiplicity structure of an isolated singular solution: Case of breadth one. J. Symb. Comput. 47(6): 700-710 (2012) | |
| j11 | Nan Li, Lihong Zhi: Computing Isolated Singular Solutions of Polynomial Systems: Case of Breadth One. SIAM J. Numerical Analysis 50(1): 354-372 (2012) | |
| c18 | Feng Guo, Erich Kaltofen, Lihong Zhi: Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions. ISSAC 2012: 195-202 | |
| c17 | Yue Ma, Lihong Zhi: Computing real solutions of polynomial systems via low-rank moment matrix completion. ISSAC 2012: 249-256 | |
| 2011 | ||
| c16 | Yue Ma, Lihong Zhi: The minimum-rank gram matrix completion via modified fixed point continuation method. ISSAC 2011: 241-248 | |
| 2010 | ||
| j10 | Mohab Safey El Din, Lihong Zhi: Computing Rational Points in Convex Semialgebraic Sets and Sum of Squares Decompositions. SIAM Journal on Optimization 20(6): 2876-2889 (2010) | |
| c15 | Feng Guo, Mohab Safey El Din, Lihong Zhi: Global optimization of polynomials using generalized critical values and sums of squares. ISSAC 2010: 107-114 | |
| c14 | Zijia Li, Zhengfeng Yang, Lihong Zhi: Blind image deconvolution via fast approximate GCD. ISSAC 2010: 155-162 | |
| c13 | Sharon Hutton, Erich Kaltofen, Lihong Zhi: Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method. ISSAC 2010: 227-234 | |
| i2 | Yue Ma, Lihong Zhi: The Minimum-Rank Gram Matrix Completion via Fixed Point Continuation Method. CoRR abs/1011.6495 (2010) | |
| 2009 | ||
| j9 | Greg Reid, Lihong Zhi: Solving polynomial systems via symbolic-numeric reduction to geometric involutive form. J. Symb. Comput. 44(3): 280-291 (2009) | |
| i1 | Mohab Safey El Din, Lihong Zhi: Computing rational points in convex semi-algebraic sets and SOS decompositions. CoRR abs/0910.2973 (2009) | |
| 2008 | ||
| j8 | Erich Kaltofen, John P. May, Zhengfeng Yang, Lihong Zhi: Approximate factorization of multivariate polynomials using singular value decomposition. J. Symb. Comput. 43(5): 359-376 (2008) | |
| j7 | Bin Li, Jiawang Nie, Lihong Zhi: Approximate GCDs of polynomials and sparse SOS relaxations. Theor. Comput. Sci. 409(2): 200-210 (2008) | |
| c12 | Erich Kaltofen, Bin Li, Zhengfeng Yang, Lihong Zhi: Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars. ISSAC 2008: 155-164 | |
| c11 | Xiaoli Wu, Lihong Zhi: Computing the multiplicity structure from geometric involutive form. ISSAC 2008: 325-332 | |
| 2007 | ||
| j6 | ||
| j5 | Dongxia Sun, Lihong Zhi: Structured Low Rank Approximation of a Bezout Matrix. Mathematics in Computer Science 1(2): 427-437 (2007) | |
| j4 | Bingyu Li, Zhuojun Liu, Lihong Zhi: A fast algorithm for solving the Sylvester structured total least squares problem. Signal Processing 87(10): 2313-2319 (2007) | |
| c10 | Erich Kaltofen, Zhengfeng Yang, Lihong Zhi: On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms. SNC 2007: 11-17 | |
| c9 | ||
| c8 | Erich Kaltofen, Bin Li, Kartik Sivaramakrishnan, Zhengfeng Yang, Lihong Zhi: Lower bounds for approximate factorizations via semidefinite programming: (extended abstract). SNC 2007: 203-204 | |
| c7 | Bin Li, Jiawang Nie, Lihong Zhi: Approximate GCDs of polynomials and SOS relaxation. SNC 2007: 205-206 | |
| 2006 | ||
| c6 | ||
| c5 | Erich Kaltofen, Zhengfeng Yang, Lihong Zhi: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. ISSAC 2006: 169-176 | |
| 2004 | ||
| j3 | Robert M. Corless, Stephen M. Watt, Lihong Zhi: QR factoring to compute the GCD of univariate approximate polynomials. IEEE Transactions on Signal Processing 52(12): 3394-3402 (2004) | |
| c4 | Gregory J. Reid, Jianliang Tang, Jianping Yu, Lihong Zhi: Hybrid Method for Solving New Pose Estimation Equation System. IWMM/GIAE 2004: 44-55 | |
| c3 | Shuhong Gao, Erich Kaltofen, John May, Zhengfeng Yang, Lihong Zhi: Approximate factorization of multivariate polynomials via differential equations. ISSAC 2004: 167-174 | |
| 2003 | ||
| c2 | Gregory J. Reid, Jianliang Tang, Lihong Zhi: A complete symbolic-numeric linear method for camera pose determination. ISSAC 2003: 215-223 | |
| 2000 | ||
| c1 | Yuzhen Huang, Wenda Wu, Hans J. Stetter, Lihong Zhi: Pseudofactors of multivariate polynomials. ISSAC 2000: 161-168 | |
| 1998 | ||
| j2 | ||
| 1997 | ||
| j1 | ||
Colors in the list of coauthors
Last update Wed May 22 17:28:53 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page