GENERATORS FOR DISCRETE POLYNOMIAL-L1 APPROXIMATION-PROBLEMS

被引：1

作者：

DOMICH, P

LAWRENCE, J

SHIER, D

机构：

来源：

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS | 1979年 / 84卷 / 06期

关键词：

D O I：

10.6028/jres.084.023

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

Polynomial approximation problems represent a class of specially structured problems which are frequently encountered in empirical curve-fitting. Two generators for creating such problems have been developed, implemented and used in the testing of discrete L//1 approximation codes. Both generators permit automatic generation of problems with specified characteristics and (for one generator) having known, unique and controllable solutions.

引用

收藏

页码：455 / 488

页数：34

相关论文

共 23 条

[1] EFFICIENT METHOD FOR DISCRETE LINEAR L1 APPROXIMATION PROBLEM [J].

ABDELMALEK, NN .

MATHEMATICS OF COMPUTATION, 1975, 29 (131) :844-850

[2]

APPA G, 1973, J MATH PROGRAMMING, V5, P73

[3] COMPARISON OF 2 ALGORITHMS FOR ABSOLUTE DEVIATION CURVE FITTING [J].

ARMSTRONG, RD ;

FROME, EL .

JOURNAL OF THE AMERICAN STATISTICAL ASSOCIATION, 1976, 71 (354) :328-330

[4] SOLUTION OF AN OVERDETERMINED SYSTEM OF EQUATIONS IN L1 NORM [F4] [J].

BARRODALE, I ;

ROBERTS, FDK .

COMMUNICATIONS OF THE ACM, 1974, 17 (06) :319-320

[5] IMPROVED ALGORITHM FOR DISCRETE L1 LINEAR-APPROXIMATION [J].

BARRODALE, I ;

ROBERTS, FDK .

SIAM JOURNAL ON NUMERICAL ANALYSIS, 1973, 10 (05) :839-848

[6] MINIMIZATION TECHNIQUES FOR PIECEWISE DIFFERENTIABLE FUNCTIONS - L1 SOLUTION TO AN OVERDETERMINED LINEAR-SYSTEM [J].

BARTELS, RH ;

CONN, AR ;

SINCLAIR, JW .

SIAM JOURNAL ON NUMERICAL ANALYSIS, 1978, 15 (02) :224-241

[7]

DOMICH PD, EVALUATION L1 CODES

[8]

FILLIBEN JJ, 1976, 9TH P INT S COMP SCI, P212

[9]

FORSYTHE GE, 1957, SIAM J, V5, P74

[10] LEAST ABSOLUTE VALUES ESTIMATION [J].

GENTLE, JE ;

KENNEDY, WJ ;

SPOSITO, VA .

COMMUNICATIONS IN STATISTICS PART A-THEORY AND METHODS, 1977, 6 (09) :839-845