{"title":"An efficient sparse minor expansion algorithm","authors":"M. Griss","doi":"10.1145/800191.805633","DOIUrl":null,"url":null,"abstract":"An improved algorithm for computing the minors of a (large) sparse matrix of polynomials is described, with emphasis on efficiency and optimal ordering. A possible application to polynomial resultant computation is discussed.","PeriodicalId":379505,"journal":{"name":"ACM '76","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1976-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM '76","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800191.805633","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10
Abstract
An improved algorithm for computing the minors of a (large) sparse matrix of polynomials is described, with emphasis on efficiency and optimal ordering. A possible application to polynomial resultant computation is discussed.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
