𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A discrete characterization theorem for the discrete L1 linear approximation problem

✍ Scribed by M.J.D Powell; F.D.K Roberts

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
280 KB
Volume
30
Category
Article
ISSN
0021-9045

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

Study of the discrete singularly perturb
Study of the discrete singularly perturbed linear-quadratic control problem by a bilinear transformation
✍ Zoran Gajic; Xue-Min Shen πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 330 KB

This paper presents a new approach in the study of the linear quadratic control problem of singularly perturbed discrete systems. By applying a bilinear transformation, the algebraic discrete Riccati equation is converted into a continuous one, which can be solved by using the reduced-order recursiv

A posteriori bounds for linear functiona
A posteriori bounds for linear functional outputs of Crouzeix–Raviart finite element discretizations of the incompressible Stokes problem
✍ Marius Paraschivoiu; Anthony T. Patera πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 340 KB πŸ‘ 2 views

A finite element technique is presented for the efficient generation of lower and upper bounds to outputs which are linear functionals of the solutions to the incompressible Stokes equations in two space dimensions. The finite element discretization is effected by Crouzeix -Raviart elements, the dis