𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for discrete Chebyshev linear approximation with linear constraints

✍ Scribed by F. D. K. Roberts; I. Barrodale

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
521 KB
Volume
15
Category
Article
ISSN
0029-5981

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for minimal degree linear C
An algorithm for minimal degree linear Chebyshev approximation on a discrete set
✍ F. D. K. Roberts πŸ“‚ Article πŸ“… 1976 πŸ› John Wiley and Sons 🌐 English βš– 779 KB

## Abstract 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 achieves this accuracy. The algorithm is b

A Parallel Algorithm for Linear Programs
A Parallel Algorithm for Linear Programs with an Additional Reverse Convex Constraint
✍ Shih-Mim Liu; G.P. Papavassilopoulos πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 211 KB

A parallel method for globally minimizing a linear program with an additional reverse convex constraint is proposed which combines the outer approximation technique and the cutting plane method. Basically p (≀n) processors are used for a problem with n variables and a globally optimal solution is fo

An efficient fixed-lag smoothing algorit
An efficient fixed-lag smoothing algorithm for discrete linear systems
✍ Gerald J. Bierman πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 446 KB

The modified Bryson-Frazier fixed interval smoothing algorithm [6], is an addendem to the Kalman filterβ€’ This algorithm when applied to the problem of fixedlag smoothing is computationally more efficient than the algorithms recently reported in refs. [1][2][3]. Features of the algorithm are ease of

An application of functional analysis to
An application of functional analysis to time optimal control of linear discrete systems with output constraints
✍ G.M. Krang; M.B. Shilman πŸ“‚ Article πŸ“… 1970 πŸ› Elsevier Science 🌐 English βš– 682 KB

The problem of time optimal control of linear discrete systems tith output constraints is formulated as an L-problem in the theory of moments. The solution to this 1atteT problem is well known and is obtained from a finite-dimensional minimization. This procedure allows us to handle constraints not