✦ LIBER ✦

Direct and Inverse Approximation Theorems for Local Trigonometric Bases

✍ Scribed by Kai Bittner; Karlheinz Gröchenig

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 259 KB
Volume: 117
Category: Article
ISSN: 0021-9045
DOI: 10.1006/jath.2002.3688

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Direct and inverse approximation theorem

Direct and inverse approximation theorems in Banach spaces and Fourier transforms

✍ N. P. Kuptsov 📂 Article 📅 1970 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 434 KB

Construction of homogeneous spaces of lo

Construction of homogeneous spaces of local functions and inverse approximation theorems

✍ Yu. K. Dem'yanovich 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 926 KB

Error Estimates and Reproduction of Poly

Error Estimates and Reproduction of Polynomials for Biorthogonal Local Trigonometric Bases

✍ Kai Bittner 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 169 KB

Direct and inverse theorems for approxim

Direct and inverse theorems for approximation of functions for rational modules in domains with quasiconformal boundary

✍ V. V. Andrievskii; V. I. Belyi; V. V. Maimeskul 📂 Article 📅 1989 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 521 KB

Direct and inverse inequalities forϕ-Fej

Direct and inverse inequalities forϕ-Fejér mean-square approximations

✍ V. Yu. Popov 📂 Article 📅 1976 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 404 KB

Greedy search and a hybrid local optimiz

Greedy search and a hybrid local optimization/genetic algorithm for tree-based inverse scattering

✍ Raymond A. Wildman; Daniel S. Weile 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 191 KB

## Abstract A genetic programming‐based geometry optimization method for inverse scattering that uses a tree data structure to encode Boolean combinations of convex shapes has recently been shown to outperform other genetic algorithm‐based techniques. Nonetheless, the genetic algorithms are still i