Constructing Eigenvalue Method for Solving Sparse Polynomial Equations by Well Arranged Basis in Semigroup Algebra
Received:May 30, 2003  
Key Words: sparse polynomial   well arranged basis   eigenvalue.  
Fund Project:
Author NameAffiliation
LIU Wei-jiang College of Information science and engineering
Bohai University
Jinzhou
China
Department of Computer Science and Engineering
Southeast University
Nanjing
China 
FENG Guo-chen College of Mathematics Science
Jilin University
Changchun
China 
Hits: 3103
Download times: 1327
Abstract:
      Eigenvalue matrix for resolving sparse polynomial equations is constructed by deploying well arranged basis in semigroup algebra k[A]. The condition for the constructed matrix to be square is discussed.
Citation:
DOI:10.3770/j.issn:1000-341X.2005.03.022
View Full Text  View/Add Comment  
  Copyright © Journal of Mathematical Research with Applications
Sponsored by：Dalian University of Technology, China Society for Industrial and Applied Mathematics
Address：No.2 Linggong Road, Ganjingzi District, Dalian City, Liaoning Province, P. R. China , Postal code ：116024
Service Tel：86-411-84707392 Email：jmre@dlut.edu.cn
Designed by Beijing E-tiller Co.,Ltd.
Due to security factors, early browsers cannot log in. It is recommended to log in with IE10, IE11, Google, Firefox, and 360 new browsers.