A characterization of an element of best simultaneous approximation
From MaRDI portal
Publication:3678142
Recommendations
Cites work
- scientific article; zbMATH DE number 3556627 (Why is no real title available?)
- scientific article; zbMATH DE number 3220692 (Why is no real title available?)
- scientific article; zbMATH DE number 3237219 (Why is no real title available?)
- scientific article; zbMATH DE number 3314644 (Why is no real title available?)
- Best simultaneous \(L_1\) approximations
- Convex Programming and Duality in Normed Space
- Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
- Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
- On Best Simultaneous Approximation in Normed Linear Spaces
- On an algorithm for best approximate solutions to Av=b in normed linear spaces
- On best simultaneous approximation in normed linear spaces
- On simultaneous Chebyshev approximation
- On simultaneous Chebyshev approximation and Chebyshev approximation with an additive weight
- On simultaneous best approximations in \(C^1[a,b]\)
- Solutions of overdetermined linear equations which minimize error in an abstract norm
Cited in
(2)
This page was built for publication: A characterization of an element of best simultaneous approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3678142)