SOME REMARKS ON THE FOUNDATIONS OF NUMERICAL-ANALYSIS

被引:40
作者
SMALE, S
机构
[1] Univ of California, Berkeley, CA
关键词
D O I
10.1137/1032043
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The problem of increasing the understanding of algorithms by considering the foundations numerical analysis and computer science is considered. The schism between scientific computing and computer science is discussed from a theoretical perspective. These theoretical considerations have an chemical importance when viewing the computer. In particular, the legitimacy and importance of models machines that accept real numbers is considered.
引用
收藏
页码:211 / 220
页数:10
相关论文
共 34 条
[1]  
[Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047
[2]   ON A THEORY OF COMPUTATION AND COMPLEXITY OVER THE REAL NUMBERS - NP-COMPLETENESS, RECURSIVE FUNCTIONS AND UNIVERSAL MACHINES [J].
BLUM, L ;
SHUB, M ;
SMALE, S .
BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1989, 21 (01) :1-46
[3]   EVALUATING RATIONAL FUNCTIONS - INFINITE PRECISION IS FINITE COST AND TRACTABLE ON AVERAGE [J].
BLUM, L ;
SHUB, M .
SIAM JOURNAL ON COMPUTING, 1986, 15 (02) :384-398
[4]  
BLUM L, 1989, UNPUB LECTURES THEOR
[5]   BOUNDS FOR THE DEGREES IN THE NULLSTELLENSATZ [J].
BROWNAWELL, WD .
ANNALS OF MATHEMATICS, 1987, 126 (03) :577-591
[6]  
Conte C.D.B. S. D., 2017, SOC INDUS APPL MATH
[7]  
Demmel J. W., 1987, Journal of Complexity, V3, P201, DOI 10.1016/0885-064X(87)90027-6
[8]  
DUBE T, 1989, THESIS NEW YORK U NE
[9]   EIGENVALUES AND CONDITION NUMBERS OF RANDOM MATRICES [J].
EDELMAN, A .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1988, 9 (04) :543-560
[10]  
Garey M.R., 1979, COMPUTERS INTRACTABI, V174