Displaying 4401 – 4420 of 13205

Showing per page

Global existence for a Riccati equation arising in a boundary control problem for distributed parameters

Franco Flandoli (1982)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Si prova resistenza globale della soluzione di una equazione di Riccati collegata alla sintesi di un problema di controllo ottimale. Il problema considerato rappresenta la versione astratta di alcuni problemi governati da equazioni paraboliche con il controllo sulla frontiera.

G-narrow operators and G-rich subspaces

Tetiana Ivashyna (2013)

Open Mathematics

Let X and Y be Banach spaces. An operator G: X → Y is a Daugavet center if ‖G +T‖ = ‖G‖+‖T‖ for every rank-1 operator T. For every Daugavet center G we consider a certain set of operators acting from X, so-called G-narrow operators. We prove that if J is the natural embedding of Y into a Banach space E, then E can be equivalently renormed so that an operator T is (J ○ G)-narrow if and only if T is G-narrow. We study G-rich subspaces of X: Z ⊂ X is called G-rich if the quotient map q: X → X/Z is...

Gradient potential estimates

Giuseppe Mingione (2011)

Journal of the European Mathematical Society

Pointwise gradient bounds via Riesz potentials like those available for the Poisson equation actually hold for general quasilinear equations.

Graphs having no quantum symmetry

Teodor Banica, Julien Bichon, Gaëtan Chenevier (2007)

Annales de l’institut Fourier

We consider circulant graphs having p vertices, with p prime. To any such graph we associate a certain number k , that we call type of the graph. We prove that for p k the graph has no quantum symmetry, in the sense that the quantum automorphism group reduces to the classical automorphism group.

Greedy approximation and the multivariate Haar system

A. Kamont, V. N. Temlyakov (2004)

Studia Mathematica

We study nonlinear m-term approximation in a Banach space with regard to a basis. It is known that in the case of a greedy basis (like the Haar basis in L p ( [ 0 , 1 ] ) , 1 < p < ∞) a greedy type algorithm realizes nearly best m-term approximation for any individual function. In this paper we generalize this result in two directions. First, instead of a greedy algorithm we consider a weak greedy algorithm. Second, we study in detail unconditional nongreedy bases (like the multivariate Haar basis d = × . . . × in L p ( [ 0 , 1 ] d ) ,...

Greedy Approximation with Regard to Bases and General Minimal Systems

Konyagin, S., Temlyakov, V. (2002)

Serdica Mathematical Journal

*This research was supported by the National Science Foundation Grant DMS 0200187 and by ONR Grant N00014-96-1-1003This paper is a survey which also contains some new results on the nonlinear approximation with regard to a basis or, more generally, with regard to a minimal system. Approximation takes place in a Banach or in a quasi-Banach space. The last decade was very successful in studying nonlinear approximation. This was motivated by numerous applications. Nonlinear approximation is important...

Currently displaying 4401 – 4420 of 13205