✦ LIBER ✦

Optimal Domains for Kernel Operators via Interpolation

✍ Scribed by Guillermo P. Curbera; Werner J. Ricker

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 262 KB
Volume: 244
Category: Article
ISSN: 0025-584X
DOI: 10.1002/1522-2616(200210)244:1<47::aid-mana47>3.0.co;2-b

No coin nor oath required. For personal study only.

✦ Synopsis

The problem of finding optimal lattice domains for kernel operators with values in rearrangement invariant spaces on the interval [0,1] is considered. The techniques used are based on interpolation theory and integration with respect to C([0, 1])-valued measures.

📜 SIMILAR VOLUMES

Optimal domains and integral representat

Optimal domains and integral representations of Lp(G)-valued convolution operators via measures

✍ S. Okada; W. J. Ricker 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB

## Abstract Given 1 ≤ __p__ < ∞, a compact abelian group __G__ and a measure __μ__ ∈ __M__ (__G__), we investigate the optimal domain of the convolution operator $ C^{(p)}\_{\mu} $: __f__ ↦ __f__ ∗︁ __μ__ (as an operator from __L__^__p__^(__G__) to itself). This is the largest Köthe function space

Hybrid kernel learning via genetic optim

Hybrid kernel learning via genetic optimization for TS fuzzy system identification

✍ Wei Li; Yupu Yang 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB 👁 1 views

Hua Operators on Bounded Homogeneous Dom

Hua Operators on Bounded Homogeneous Domains in Cnand Alternative Reproducing Kernels for Holomorphic Functions

✍ E. Damek; A. Hulanicki; R. Penney 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 581 KB

Let D be a bounded homogeneous domain in C n . (Note that D is not assumed to be Hermitian-symmetric.) In this work we are interested in studying various classes of ``harmonic'' functions on D and the possibility of representing them as ``Poisson integrals'' over the Bergman-Shilov boundary. One suc

Mesh partitioning for implicit computati

Mesh partitioning for implicit computations via iterative domain decomposition: Impact and optimization of the subdomain aspect ratio

✍ Charbel Farhat; Nathan Maman; Gregory W. Brown 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 893 KB

Optimal domain decomposition methods have emerged as powerful iterative algorithms for parallel implicit computations. Their key preprocessing step is mesh partitioning, where research has focused so far on the automatic generation of load-balanced subdomains with minimum interface nodes. In this pa