CORC  > 北京大学  > 数学科学学院
Condition number based complexity estimate for solving polynomial systems
She, Zhikun ; Xia, Bican ; Zheng, Zhiming
2011
关键词Real-root-counting Newton operator Condition number Complexity analysis INEQUALITIES
英文摘要By modifying and combining algorithms in symbolic and numerical computation, we propose a real-root-counting based method for deciding the feasibility of systems of polynomial equations. Along with this method, we also use a modified Newton operator to efficiently approximate the real solutions when the systems are feasible. The complexity of our method can be measured by a number of arithmetic operations which is singly exponential in the number of variables. (C) 2010 Elsevier B.V. All rights reserved.; http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:000287642200067&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=8e1609b174ce4e31116a60747a720701 ; Mathematics, Applied; SCI(E); EI; 5; ARTICLE; 8; 2670-2678; 235
语种英语
出处SCI ; EI
出版者计算与应用数学杂志
内容类型其他
源URL[http://hdl.handle.net/20.500.11897/241432]  
专题数学科学学院
推荐引用方式
GB/T 7714
She, Zhikun,Xia, Bican,Zheng, Zhiming. Condition number based complexity estimate for solving polynomial systems. 2011-01-01.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace