发布求助
文献互助 智能选刊 最新文献

ACM Signum Newsletter最新文献

筛选
英文 中文
Fast Givens goes slow in MATLAB Fast Givens在MATLAB中很慢
ACM Signum Newsletter Pub Date : 1991-04-01 DOI: 10.1145/122286.122288
A. Genz, Zongli Lin, Charles Jones, Dali Luo, Thorsten Prenzel
{"title":"Fast Givens goes slow in MATLAB","authors":"A. Genz, Zongli Lin, Charles Jones, Dali Luo, Thorsten Prenzel","doi":"10.1145/122286.122288","DOIUrl":"https://doi.org/10.1145/122286.122288","url":null,"abstract":"Numerical results show that a straightforward implementation in MATLAB of an algorithm for the Fast Givens QR Factorization of an m x n matrix takes more time than an implementation of an algorithm that uses ordinary Givens transformations. Results of timing experiments for various operations in MATLAB are reported and models are constructed to explain why the standard theoretical analysis based on flop counts does not account for the actual times for the algorithms.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1991-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123353462","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Timing comparisons of the householder QR transformations with rank-1 and rank-2 updates 排名1和排名2更新的户主QR变换的时间比较
ACM Signum Newsletter Pub Date : 1990-11-01 DOI: 10.1145/122272.122275
T. Rolfe
{"title":"Timing comparisons of the householder QR transformations with rank-1 and rank-2 updates","authors":"T. Rolfe","doi":"10.1145/122272.122275","DOIUrl":"https://doi.org/10.1145/122272.122275","url":null,"abstract":"The Householder QR transformation using rank-1 updates and the transformation using rank-2 updates are both O(N3) with the same cubic coefficient. While the rank-1 implementation has the smaller quadratic coefficient, the rank-2 implementation in practice is the faster algorithm, the amount of speed-up varying with the computer. This speed-up is not purely the result of replacing SAXPY operations with double GAXPY ones.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130686028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Topics in computer-aided geometric design-1990 计算机辅助几何设计专题-1990
ACM Signum Newsletter Pub Date : 1990-11-01 DOI: 10.1145/122272.122274
R. Franke
{"title":"Topics in computer-aided geometric design-1990","authors":"R. Franke","doi":"10.1145/122272.122274","DOIUrl":"https://doi.org/10.1145/122272.122274","url":null,"abstract":"The Ettore Majorana Centre for Scientific Culture (Center) was founded in 1963 to \"give life to a completely new way of realizing the EAST-WEST-NORTH-SOUTH collaboration, without discrimination and above any ideological, political, or racial barrier.\" The Italian Ministry of Education, the Italian Ministry of University and Scientific Research, and the Sicilian Regional Government sponsor the center, located in Erice, Sicily. The center is named for an Italian theoretical unclear physicist, of whom Enrico Fermi said \"... and then there are the geniuses like Galileo and Newton. Ettore Majorana was one of these.\"","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132357067","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Feasibility of “perfect” function evaluation “完美”函数评价的可行性
ACM Signum Newsletter Pub Date : 1990-11-01 DOI: 10.1145/122272.122276
C. Dunham
{"title":"Feasibility of “perfect” function evaluation","authors":"C. Dunham","doi":"10.1145/122272.122276","DOIUrl":"https://doi.org/10.1145/122272.122276","url":null,"abstract":"This paper casts doubt on the feasibility of perfect subroutines or perfect hardware for mathematical functions, in particular by conversion from double precision. It suggests a slightly relaxed standard.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114108958","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 11
Difficulties in fitting scientific data 拟合科学数据的困难
ACM Signum Newsletter Pub Date : 1990-09-01 DOI: 10.1145/101064.101068
C. Dunham
{"title":"Difficulties in fitting scientific data","authors":"C. Dunham","doi":"10.1145/101064.101068","DOIUrl":"https://doi.org/10.1145/101064.101068","url":null,"abstract":"The major potential difficulties in obtaining parameters of a model from scientific observations are discussed in the context of the theory of best approximation.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114222503","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A hypertext environment for using mathematical software: part 1—motivations and design objectives 使用数学软件的超文本环境:第1部分-动机和设计目标
ACM Signum Newsletter Pub Date : 1990-09-01 DOI: 10.1145/101064.101066
J. Nash
{"title":"A hypertext environment for using mathematical software: part 1—motivations and design objectives","authors":"J. Nash","doi":"10.1145/101064.101066","DOIUrl":"https://doi.org/10.1145/101064.101066","url":null,"abstract":"Two perennial obstacles to the effective use of software, and especially mathematical software, are its documentation and its user-accessibility. This article surveys some of the ways in which software providers address the issues of documentation and use of their products, and suggests an alternative mechanism for both documentation and access via a hypertext database and command processor. Some considerations relating to program size and complexity and to the security of computer applications are discussed.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"406 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116513996","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Slowing propagation error caused by finite register sizes in unstable systems 不稳定系统中有限寄存器大小引起的慢传播误差
ACM Signum Newsletter Pub Date : 1990-09-01 DOI: 10.1145/101064.101069
S. Cynar
{"title":"Slowing propagation error caused by finite register sizes in unstable systems","authors":"S. Cynar","doi":"10.1145/101064.101069","DOIUrl":"https://doi.org/10.1145/101064.101069","url":null,"abstract":"When doing simulations one of the worst problems that can occur is an unstable system model. These unstable models often appear in systems identification problems where the system has a non-minimum phase model. This situation leads to an unstable inverse system. The instability means that the system model must be redefined, even though the non-minimum phase model is most accurate. Or a method for deconvolution will be chosen that assumes the system is minimum phase, even though it is not. Often these inaccurate fixes or assumptions are not necessary. Cases where short strings of data are being processed can use the unstable inverse and produce good results. By using the superposition feature of linear systems it is possible to increase the useful run time of these unstable deconvolvers.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132098914","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
How accurate should numerical routines be? 数值例程应该有多精确?
ACM Signum Newsletter Pub Date : 1990-07-01 DOI: 10.1145/101070.101074
C. Dunham
{"title":"How accurate should numerical routines be?","authors":"C. Dunham","doi":"10.1145/101070.101074","DOIUrl":"https://doi.org/10.1145/101070.101074","url":null,"abstract":"J. H. Wilkinson, in justifying backward error analyses, advanced the proposition that a numerical routine could not be blamed if the computed answer was the exact answer to the problem with slightly perturbed input. Such a model was established by Wilkinson (1968) for the solution of linear equations, ns by (I) Gaussian elimination and (II) triangular decomposition using double precision accumulation of inner products. In the latter it is usual that inputs are perturbed only by a small multiple of a unit rounding error (see formula (175)).","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132769079","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A note on comparison of nonlinear least squares algorithms 关于非线性最小二乘算法比较的说明
ACM Signum Newsletter Pub Date : 1990-07-01 DOI: 10.1145/101070.101075
Zafar Khan, Sudhir Chawla, Dinesh Dave
{"title":"A note on comparison of nonlinear least squares algorithms","authors":"Zafar Khan, Sudhir Chawla, Dinesh Dave","doi":"10.1145/101070.101075","DOIUrl":"https://doi.org/10.1145/101070.101075","url":null,"abstract":"The nonlinear least squares problem is a special case of the unconstrained minimization problem. While a large number of new algorithms have been developed in recent years, both for general unconstrained minimization and the least squares case, comparative studies are limited. Further, there has been practically a revolution in algorithm testing and comparison methodology. Recent advances include a more comprehensive performance criteria, use of large numbers of randomly generated test problems, and application of sophisticated statistical techniques for experiment design and data evaluation.These developments have made questionable the findings of the few earlier comparative studies of least squares algorithms. This creates a necessity of a comparative study employing current methodology that evaluates the specialized least squares algorithms along with a few general algorithms for unconstrained minimization.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"212 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115779096","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A computational algorithm for LU decomposition of a sequence of matrices that differ only in one or more elements 对仅在一个或多个元素上不同的矩阵序列进行LU分解的一种计算算法
ACM Signum Newsletter Pub Date : 1989-11-01 DOI: 10.1145/74654.74656
M. Zahir
{"title":"A computational algorithm for LU decomposition of a sequence of matrices that differ only in one or more elements","authors":"M. Zahir","doi":"10.1145/74654.74656","DOIUrl":"https://doi.org/10.1145/74654.74656","url":null,"abstract":"A computational algorithm for an efficient LU decomposition of a sequence of matrices that differ in one or more elements is presented and some possible areas of engineering and business applications are outlined. CPU time, as measured in an implementation of the algorithm using FORTRAN code, is shown to agree very well with the estimated operations count.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117198015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信