arXiv Open Access 2010

Parallel computation of real solving bivariate polynomial systems by zero-matching method

Xiaolin Qin Yong Feng Jingwei Chen Jingzhong Zhang

Lihat Sumber

Abstrak

We present a new algorithm for solving the real roots of a bivariate polynomial system $Σ=\{f(x,y),g(x,y)\}$ with a finite number of solutions by using a zero-matching method. The method is based on a lower bound for bivariate polynomial system when the system is non-zero. Moreover, the multiplicities of the roots of $Σ=0$ can be obtained by a given neighborhood. From this approach, the parallelization of the method arises naturally. By using a multidimensional matching method this principle can be generalized to the multivariate equation systems.

Topik & Kata Kunci

cs.SC math.NA

Penulis (4)

Xiaolin Qin

Yong Feng

Jingwei Chen

Jingzhong Zhang

Format Sitasi

APA MLA BibTeX

Qin, X., Feng, Y., Chen, J., Zhang, J. (2010). Parallel computation of real solving bivariate polynomial systems by zero-matching method. https://arxiv.org/abs/1001.2940

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2010
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓