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

ACM Signum Newsletter最新文献

筛选
英文 中文
Numerical Turing 数值图灵
ACM Signum Newsletter Pub Date : 1985-07-01 DOI: 10.1145/1057947.1057949
T. E. Hull, A. Abrham, M. S. Cohen, A. F. X., C. Hall, D. A. Penny, J. T. M.
{"title":"Numerical Turing","authors":"T. E. Hull, A. Abrham, M. S. Cohen, A. F. X., C. Hall, D. A. Penny, J. T. M.","doi":"10.1145/1057947.1057949","DOIUrl":"https://doi.org/10.1145/1057947.1057949","url":null,"abstract":"Numerical Turing is an extension of the Turing programming language. Turing is a Pascal-like language (with convenient string handling, dynamic arrays, modules and more general parameter lists) developed at the University of Toronto [4]. Turing has been in use since May, 1983, and is now available on several machines.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117064352","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}
引用次数: 14
The NAG library ordinary differential equations chapter and short term plans for its extension NAG库常微分方程章节及短期扩展计划
ACM Signum Newsletter Pub Date : 1985-07-01 DOI: 10.1145/1057947.1057950
I. Gladwell
{"title":"The NAG library ordinary differential equations chapter and short term plans for its extension","authors":"I. Gladwell","doi":"10.1145/1057947.1057950","DOIUrl":"https://doi.org/10.1145/1057947.1057950","url":null,"abstract":"We outline the contents of the ordinary differential equation (D02) chapter of the NAG library at Mark 11 paying particular attention to the aims and structure of the chapter and to the user interface. We close with a description of the additions to the chapter which are in preparation.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124381659","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
The singular value decomposition in multivariate statistics 多元统计中的奇异值分解
ACM Signum Newsletter Pub Date : 1985-07-01 DOI: 10.1145/1057947.1057948
S. Hammarling
{"title":"The singular value decomposition in multivariate statistics","authors":"S. Hammarling","doi":"10.1145/1057947.1057948","DOIUrl":"https://doi.org/10.1145/1057947.1057948","url":null,"abstract":"To Gene Golub who has done so much to encourage and advance the use of stable numerical techniques in multivariate statistics.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134600536","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}
引用次数: 24
Programming tools for linear algebra 线性代数的编程工具
ACM Signum Newsletter Pub Date : 1985-07-01 DOI: 10.1145/1057947.1057952
H. Lipps, G. Erskine
{"title":"Programming tools for linear algebra","authors":"H. Lipps, G. Erskine","doi":"10.1145/1057947.1057952","DOIUrl":"https://doi.org/10.1145/1057947.1057952","url":null,"abstract":"Dongarra et al have recently proposed extensions to the subprogram package BLAS to improve the performance of more elaborate linear algebra codes such as LINPACK. (See [2] - [4]) We summarize here our experience with a similar project.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124360505","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
Some issues in implementing a sequential quadratic programming algorithm 实现顺序二次规划算法中的一些问题
ACM Signum Newsletter Pub Date : 1985-04-01 DOI: 10.1145/1057941.1057944
P. Gill, W. Murray, M. Saunders, M. H. Wright
{"title":"Some issues in implementing a sequential quadratic programming algorithm","authors":"P. Gill, W. Murray, M. Saunders, M. H. Wright","doi":"10.1145/1057941.1057944","DOIUrl":"https://doi.org/10.1145/1057941.1057944","url":null,"abstract":"In this note, we consider two of the major issues that have arisen in implementing a sequential quadratic programming (SQP) method for nonlinearly constrained optimization problems (the code NPSOL; Gill <i>et al.</i>, 1983). The problem of concern is assumed to be of the form[EQUATION]where <i>F(x)</i> is a smooth nonlinear function, A<sub>L</sub> is a constant matrix, and <i>c(x)</i> is a vector of smooth nonlinear constraint functions. The matrix <i>A<sub>L</sub></i> and the vector <i>c(x)</i> may be empty. Note that <i>upper and lower bounds are specified for all the variables and for all the constraints.</i> This from allows full generality in constraint specification. In particular, the <i>i</i>-th constraint may be defined as an <i>equality</i> by setting <i>l<sub>i</sub></i> = <i>u<sub>i</sub></i>. If certain bounds are not present, the associated elements of <i>l</i> or <i>u</i> can be set to special values that will be treated as - ∞ or +∞.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116481139","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}
引用次数: 8
A note on estimating the error in Gaussian elimination without pivoting 关于不旋转高斯消去误差估计的注记
ACM Signum Newsletter Pub Date : 1985-04-01 DOI: 10.1145/1057941.1057942
E. Chu, A. George
{"title":"A note on estimating the error in Gaussian elimination without pivoting","authors":"E. Chu, A. George","doi":"10.1145/1057941.1057942","DOIUrl":"https://doi.org/10.1145/1057941.1057942","url":null,"abstract":"This article deals with the problem of estimating the error in the computed solution to a system of equations when that solution is obtained by using Gaussian elimination without pivoting. The corresponding problem, where either partial or complete pivoting is used, has received considerable attention, and efficient and reliable methods have been developed. However, in the context of solving large sparse systems, it is often very attractive to apply Gaussian elimination without pivoting, even though it cannot be guaranteed a-priori that the computation is numerically stable. When this is done, it is important to be able to determine when serious numerical errors have occurred, and to be able to estimate the error in the computed solution. In this paper a method for achieving this goal is described. Results of a large number of numerical experiments suggest that the method is both inexpensive and reliable.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126210007","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}
引用次数: 6
Mathematical software at KFA KFA的数学软件
ACM Signum Newsletter Pub Date : 1985-04-01 DOI: 10.1145/1057941.1057945
J. Hake
{"title":"Mathematical software at KFA","authors":"J. Hake","doi":"10.1145/1057941.1057945","DOIUrl":"https://doi.org/10.1145/1057941.1057945","url":null,"abstract":"Scientific computing at research centres does not only require fast computers and appropriate mathematical software. From the end-user's point of view there is also a need for a unified and flexible presentation of and access to the existing software tools. This paper deals with the strategy how mathematical software is incorporated into largescale computing at KFA Jülich.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"296 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134270655","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
Moving boundary problems in phase change models current research questions 移动边界问题在相变模型中的研究现状
ACM Signum Newsletter Pub Date : 1985-04-01 DOI: 10.1145/1057941.1057943
A. Solomon, V. Alexiades, D. Wilson
{"title":"Moving boundary problems in phase change models current research questions","authors":"A. Solomon, V. Alexiades, D. Wilson","doi":"10.1145/1057941.1057943","DOIUrl":"https://doi.org/10.1145/1057941.1057943","url":null,"abstract":"We present a brief picture of current research questions and activities on moving boundary problems.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1985-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115592861","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
Interval arithmetic implementations: using floating point arithmetic 区间算术实现:使用浮点算术
ACM Signum Newsletter Pub Date : 1984-10-01 DOI: 10.1145/1057931.1057932
M. Clemmesen
{"title":"Interval arithmetic implementations: using floating point arithmetic","authors":"M. Clemmesen","doi":"10.1145/1057931.1057932","DOIUrl":"https://doi.org/10.1145/1057931.1057932","url":null,"abstract":"This paper presents some algorithms implementing interval arithmetic using floating point arithmetic. The algorithms apply to almost any digital computer supporting normalized floating point arithmetic and provide better performance than conventional interval arithmetic program libraries. For reasons of generality and machine independence, algorithms are presented in a high-level language. They are intended to be used as an implementation guide for interval arithmetic. This paper outlines the requirements for the algorithms, presents the employed techniques and some of the algorithms, and reports on various performance experiments. A detailled description can be found in a seperate document (Clemmesen [1982]) available at the above address.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121394627","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}
引用次数: 7
A new release of SPARSPAK: the Waterloo sparse matrix package SPARSPAK的新版本:滑铁卢稀疏矩阵包
ACM Signum Newsletter Pub Date : 1984-10-01 DOI: 10.1145/1057931.1057933
A. George, E. Ng
{"title":"A new release of SPARSPAK: the Waterloo sparse matrix package","authors":"A. George, E. Ng","doi":"10.1145/1057931.1057933","DOIUrl":"https://doi.org/10.1145/1057931.1057933","url":null,"abstract":"Large sparse matrix problems arise frequently in many scientific and engineering computations. In order to solve these problems efficiently, both in terms of execution time and storage requirement, complicated storage management and data structures are usually required. However, if solving a sparse matrix problem is the prime objective, it is undesirable to have to understand the sophisticated techniques employed before the problem can be solved. Thus it is important to have software packages for solving large sparse matrix problems that provide a set of interface subroutines which insulate the users from the complicated internal structures.","PeriodicalId":177516,"journal":{"name":"ACM Signum Newsletter","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1984-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125940753","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}
引用次数: 22
首页 上一页
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学术文献互助群
群 号：604180095
Book学术官方微信