渗透晶格电池电导分布的计算

R. Fogelholm
{"title":"渗透晶格电池电导分布的计算","authors":"R. Fogelholm","doi":"10.1145/800206.806376","DOIUrl":null,"url":null,"abstract":"For a network, built from links whose conductances are given by some discrete statistical distribution, including a finite zero-conductance probability, and where links are assumed independent, the distribution of conductances for the network as a whole is of interest in the study of percolation on lattices. This quantity is computed by different methods for a set of test networks. It is found that the computation is more efficiently done by manipulating the networks themselves in a suitable representation rather than by computing with symbolic expressions for their conductance. In particular, with ordinary computer algebra systems there were severe limitations due to expression growth in this study.","PeriodicalId":314618,"journal":{"name":"Symposium on Symbolic and Algebraic Manipulation","volume":"91 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1981-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Computation for conductance distributions of percolation lattice cells\",\"authors\":\"R. Fogelholm\",\"doi\":\"10.1145/800206.806376\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For a network, built from links whose conductances are given by some discrete statistical distribution, including a finite zero-conductance probability, and where links are assumed independent, the distribution of conductances for the network as a whole is of interest in the study of percolation on lattices. This quantity is computed by different methods for a set of test networks. It is found that the computation is more efficiently done by manipulating the networks themselves in a suitable representation rather than by computing with symbolic expressions for their conductance. In particular, with ordinary computer algebra systems there were severe limitations due to expression growth in this study.\",\"PeriodicalId\":314618,\"journal\":{\"name\":\"Symposium on Symbolic and Algebraic Manipulation\",\"volume\":\"91 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1981-08-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symposium on Symbolic and Algebraic Manipulation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/800206.806376\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Symbolic and Algebraic Manipulation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/800206.806376","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

对于一个网络,其电导由一些离散的统计分布给出,包括有限的零电导概率,并且假设链路是独立的,网络的电导分布作为一个整体在晶格上的渗透研究中是有意义的。对于一组测试网络,这个数量是通过不同的方法来计算的。研究发现,用合适的表示来处理网络本身比用电导的符号表达式来计算更有效。特别是,在普通的计算机代数系统中,由于表达式的增长,本研究存在严重的局限性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Computation for conductance distributions of percolation lattice cells
For a network, built from links whose conductances are given by some discrete statistical distribution, including a finite zero-conductance probability, and where links are assumed independent, the distribution of conductances for the network as a whole is of interest in the study of percolation on lattices. This quantity is computed by different methods for a set of test networks. It is found that the computation is more efficiently done by manipulating the networks themselves in a suitable representation rather than by computing with symbolic expressions for their conductance. In particular, with ordinary computer algebra systems there were severe limitations due to expression growth in this study.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A semantic matcher for computer algebra Construction of rational approximations by means of REDUCE Divide-and-conquer in computational group theory There is no “Uspensky's method.” Summation of binomial coefficients using hypergeometric functions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1