Zobrazeno 1 - 10 of 15 pro vyhledávání: '"F. D. K. Roberts"'
1
An algorithm for minimal degree linear Chebyshev approximation on a discrete set
Autor: F. D. K. Roberts
Publikováno v: International Journal for Numerical Methods in Engineering. 10:619-635
An algorithm for computing a linear Chebyshev approximation to a function defined on a finite set of points is presented. The method requires the accuracy of the approximation to be specified, and determines the least degree approximation which achie
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a125c3aeb8ce67ea9ddb5410b1629898
https://doi.org/10.1002/nme.1620100311
Zobrazit plný text záznamu
3
Algorithms for restricted least absolute value estimation
Autor: F. D. K. Roberts, I. Barrodale
Publikováno v: Communications in Statistics - Simulation and Computation. 6:353-363
We present a concise summary of recent progress in developing algorithms for restricted least absolute value (LAV) estimation (i. e. l1 approximation subject to linear constraints). The emphasis is on our own new algorithm, and we provide some numeri
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::3d9fb62bbb7eb4846d08dad8f9c97f97
https://doi.org/10.1080/03610917708812050
Zobrazit plný text záznamu
5
An Efficient Algorithm for Discrete $l_1$ Linear Approximation with Linear Constraints
Autor: I. Barrodale, F. D. K. Roberts
Publikováno v: SIAM Journal on Numerical Analysis. 15:603-611
We describe an algorithm, based on the simplex method of linear programming, for solving the discrete $l_1$ approximation problem with any type of linear constraints. The numerical results reported here, combined with the fact that in the absence of
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::bd654cde1bea59f0150b8cf1d0593a7a
https://doi.org/10.1137/0715040
Zobrazit plný text záznamu
7
A comparison of algorithms for rational 𝑙_{∞} approximation
Autor: F. D. K. Roberts, C. M. Lee
Publikováno v: Mathematics of Computation. 27:111-121
Results are reported of a numerical study to compare eight algorithms for obtaining rational l ∞ {l_\infty } approximations. The algorithms investigated are Loeb’s algorithm, the linear inequality algorithm, the Osborne-Watson algorithm, the diff
Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::36171fba96290033d0b8e975bc44587c
https://doi.org/10.1090/s0025-5718-1973-0331719-0
Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání

Omezení vyhledávání
Plný text Recenzováno Digitální knihovna AV ČR
Zdroje