Jingzhong Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jingzhong Zhang has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Yong Feng
Laboratory of Computer Reasoning and Trustworthy Computation University of Electronic Science and Technology of China 610054 Chengdu China
5 shared publications Chen Jing-Wei
Laboratory of Computer Reasoning and Trustworthy Computation University of Electronic Science and Technology of China 610054 Chengdu China
1 shared publication- Jia Xu
College of Computer Science and Technology Southwest University for Nationalities 610041 Chengdu Sichuan PR China
1 shared publication - Jianguo Jiang
School of Mathematics, Liaoning Normal University, Dalian 116029, China
1 shared publication - Jingwei Chen
Chongqing Key Laboratory of Secure Computing for Biology, Chongqing Institute of Green and Intelligent Technology, CAS, Chongqing, China
1 shared publication Qin Xiao-Lin
1 shared publication
Latest Publications
- 28 August 2014
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 28 (1) , 243-260
Exact bivariate polynomial factorization over ℚ by approximation of roots
- 28 August 2014
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 28 (1) , 243-260
Exact bivariate polynomial factorization over ℚ by approximation of roots
- Open Access
The expansion of real forms on the simplex and applications
If n points B_1,---,B_n$ in the standard simplex \Delta_n are affinely independent, then they can span an (n-1)-simplex denoted by \Lambda=Con(B_1,---,B_n). Here \Lambda corresponds to an n*n matrix [\Lambda] whose columns are B_1,---,B_n. In this paper, we firstly proved that if \Lambda of diameter sufficiently small contains a point $P$, and f(P)>0 (<0) for a form f in R[X], then the coefficients of f([\Lambda] X) are all positive (negative). Next, as an application of this result, a necessary and sufficient condition for determining the real zeros on \Delta_n of a system of homogeneous algebraic equations with integral coefficients is established.Open AccessThe expansion of real forms on the simplex and applications
If n points B_1,---,B_n$ in the standard simplex \Delta_n are affinely independent, then they can span an (n-1)-simplex denoted by \Lambda=Con(B_1,---,B_n). Here \Lambda corresponds to an n*n matrix [\Lambda] whose columns are B_1,---,B_n. In this paper, we firstly proved that if \Lambda of diameter sufficiently small contains a point $P$, and f(P)>0 (<0) for a form f in R[X], then the coefficients of f([\Lambda] X) are all positive (negative). Next, as an application of this result, a necessary and sufficient condition for determining the real zeros on \Delta_n of a system of homogeneous algebraic equations with integral coefficients is established. - 10 August 2012
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 25 (4) , 802-820
A review and prospect of readable machine proofs for geometry theorems
- 10 August 2012
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 25 (4) , 802-820
A review and prospect of readable machine proofs for geometry theorems
- Open Access
Simultaneous Integer Relation Detection and Its an Application
Let $\mathbf{x_1}, ..., \mathbf{x_t} \in \mathbb{R}^{n}$. A simultaneous integer relation (SIR) for $\mathbf{x_1}, ..., \mathbf{x_t}$ is a vector $\mathbf{m} \in \mathbb{Z}^{n}\setminus\{\textbf{0}\}$ such that $\mathbf{x_i}^T\mathbf{m} = 0$ for $i = 1, ..., t$. In this paper, we propose an algorithm SIRD to detect an SIR for real vectors, which constructs an SIR within $\mathcal {O}(n^4 + n^3 \log \lambda(X))$ arithmetic operations, where $\lambda(X)$ is the least Euclidean norm of SIRs for $\mathbf{x_1}, >..., \mathbf{x_t}$. One can easily generalize SIRD to complex number field. Experimental results show that SIRD is practical and better than another detecting algorithm in the literature. In its application, we present a new algorithm for finding the minimal polynomial of an arbitrary complex algebraic number from its an approximation, which is not based on LLL. We also provide a sufficient condition on the precision of the approximate value, which depends only on the height and the degree of the algebraic number.Open AccessSimultaneous Integer Relation Detection and Its an Application
Let $\mathbf{x_1}, ..., \mathbf{x_t} \in \mathbb{R}^{n}$. A simultaneous integer relation (SIR) for $\mathbf{x_1}, ..., \mathbf{x_t}$ is a vector $\mathbf{m} \in \mathbb{Z}^{n}\setminus\{\textbf{0}\}$ such that $\mathbf{x_i}^T\mathbf{m} = 0$ for $i = 1, ..., t$. In this paper, we propose an algorithm SIRD to detect an SIR for real vectors, which constructs an SIR within $\mathcal {O}(n^4 + n^3 \log \lambda(X))$ arithmetic operations, where $\lambda(X)$ is the least Euclidean norm of SIRs for $\mathbf{x_1}, >..., \mathbf{x_t}$. One can easily generalize SIRD to complex number field. Experimental results show that SIRD is practical and better than another detecting algorithm in the literature. In its application, we present a new algorithm for finding the minimal polynomial of an arbitrary complex algebraic number from its an approximation, which is not based on LLL. We also provide a sufficient condition on the precision of the approximate value, which depends only on the height and the degree of the algebraic number. - 1 September 2007
- Published by Springer Nature in Science China Mathematics
- Vol. 50 (9) , 1361-1368
Obtaining exact value by approximate computations
- 1 September 2007
- Published by Springer Nature in Science China Mathematics
- Vol. 50 (9) , 1361-1368
Obtaining exact value by approximate computations
- Open Access
An Improved Algorithm for Recovering Exact Value from its Approximation
Numerical approximate computation can solve large and complex problems fast. It has the advantage of high efficiency. However it only gives approximate results, whereas we need exact results in many fields. There is a gap between approximate computation and exact results. A bridge overriding the gap was built by Zhang, in which an exact rational number is recovered from its approximation by continued fraction method when the error is less than $1/((2N+2)(N-1)N)$, where $N$ is a bound on absolute value of denominator of the rational number. In this paper, an improved algorithm is presented by which a exact rational number is recovered when the error is less than $1/(4(N-1)N)$.Open AccessAn Improved Algorithm for Recovering Exact Value from its Approximation
Numerical approximate computation can solve large and complex problems fast. It has the advantage of high efficiency. However it only gives approximate results, whereas we need exact results in many fields. There is a gap between approximate computation and exact results. A bridge overriding the gap was built by Zhang, in which an exact rational number is recovered from its approximation by continued fraction method when the error is less than $1/((2N+2)(N-1)N)$, where $N$ is a bound on absolute value of denominator of the rational number. In this paper, an improved algorithm is presented by which a exact rational number is recovered when the error is less than $1/(4(N-1)N)$. - Open Access
Multivariate Polynomial Factorization by Interpolation Method
Factorization of polynomials arises in numerous areas in symbolic computation. It is an important capability in many symbolic and algebraic computation. There are two type of factorization of polynomials. One is convention polynomial factorization, and the other approximate polynomial factorization. Conventional factorization algorithms use symbolic methods to get exact factors of a polynomial while approximate factorization algorithms use numerical methods to get approximate factors of a polynomial. Symbolic computation often confront intermediate expression swell problem, which lower the efficiency of factorization. The numerical computation is famous for its high efficiency, but it only gives approximate results. In this paper, we present an algorithm which use approximate method to get exact factors of a multivariate polynomial. Compared with other methods, this method has the numerical computation advantage of high efficiency for some class of polynomials with factors of lower degree. The experimental results show that the method is more efficient than {\it factor} in Maple 9.5 for polynomials with more variables and higher degree.
Open AccessMultivariate Polynomial Factorization by Interpolation Method
Factorization of polynomials arises in numerous areas in symbolic computation. It is an important capability in many symbolic and algebraic computation. There are two type of factorization of polynomials. One is convention polynomial factorization, and the other approximate polynomial factorization. Conventional factorization algorithms use symbolic methods to get exact factors of a polynomial while approximate factorization algorithms use numerical methods to get approximate factors of a polynomial. Symbolic computation often confront intermediate expression swell problem, which lower the efficiency of factorization. The numerical computation is famous for its high efficiency, but it only gives approximate results. In this paper, we present an algorithm which use approximate method to get exact factors of a multivariate polynomial. Compared with other methods, this method has the numerical computation advantage of high efficiency for some class of polynomials with factors of lower degree. The experimental results show that the method is more efficient than {\it factor} in Maple 9.5 for polynomials with more variables and higher degree.
- Open Access
Obtaining Exact Value by Approximate Computations
Numerical approximate computation can solve large and complex problems fast. It has the advantage of high efficiency. However it only gives approximate results, whereas we need exact results in many fields. There is a gap between approximate computation and exact results. In this paper, we build a bridge by which exact results can be obtained by numerical approximate computations.
Open AccessObtaining Exact Value by Approximate Computations
Numerical approximate computation can solve large and complex problems fast. It has the advantage of high efficiency. However it only gives approximate results, whereas we need exact results in many fields. There is a gap between approximate computation and exact results. In this paper, we build a bridge by which exact results can be obtained by numerical approximate computations.