✦ LIBER ✦

On a posteriori upper bounds for approximating linear functionals in a probabilistic setting

✍ Scribed by G.W Wasilkowski

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 440 KB
Volume: 8
Category: Article
ISSN: 0885-064X
DOI: 10.1016/0885-064x(92)90005-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Sharp Upper Bound on the Approximation

A Sharp Upper Bound on the Approximation Order of Smooth Bivariate PP Functions

✍ C. Deboor; R.Q. Jia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 277 KB

Uniform Approximation by Entire Function

Uniform Approximation by Entire Functions That Are All Bounded on a Given Set

✍ A. A. Danielyan; L. A. Rubel 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 60 KB

Erratum Uniform Approximation by Entire

Erratum Uniform Approximation by Entire Functions That Are All Bounded on a Given Set

✍ A. A. Danielyan; L. A. Rubel 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 32 KB

Algorithms for bestL1andL∞linear approxi

Algorithms for bestL1andL∞linear approximations on a discrete set

✍ Ian Barrodale; Andrew Young 📂 Article 📅 1966 🏛 Springer-Verlag 🌐 English ⚖ 642 KB

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

A note on error bounds for function appr

A note on error bounds for function approximation using nonlinear networks

✍ Ajit T. Dingankar; Irwin W. Sandberg 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 409 KB