Constructive Characteristic of ho¨ Lder Classes and M-Term Approximations in the Multiple Haar Basis

2014 ◽  
Vol 66 (3) ◽  
pp. 391-403
Author(s):  
V. S. Romanyuk
2010 ◽  
Vol 148 (3) ◽  
pp. 519-529 ◽  
Author(s):  
S. J. DILWORTH ◽  
E. ODELL ◽  
TH. SCHLUMPRECHT ◽  
ANDRÁS ZSÁK

AbstractWe consider the X-Greedy Algorithm and the Dual Greedy Algorithm in a finite-dimensional Banach space with a strictly monotone basis as the dictionary. We show that when the dictionary is an initial segment of the Haar basis in Lp[0, 1] (1 < p < ∞) then the algorithms terminate after finitely many iterations and that the number of iterations is bounded by a function of the length of the initial segment. We also prove a more general result for a class of strictly monotone bases.


2013 ◽  
Vol 82 (3) ◽  
pp. 155-161
Author(s):  
Y. Baeumlin ◽  
V. Bavegems ◽  
H. De Rooster
Keyword(s):  

Longlobtorsie wordt niet frequent gezien bij honden maar uitstel van diagnose en behandeling leidt tot een levensbedreigende situatie. Door de draaiing van de lob ter hoogte van haar basis, wordt de bloedtoevoer afgesnoerd en de bronchus toegesnoerd. Gepredisponeerde rassen zijn grote hondenrassen met een diepe thorax, zoals de Afghaanse windhond, hoewel ook bij verschillende kleine hondenrassen gevallen worden vastgesteld. Meestal treedt acute ademnood op, hoewel dit niet bij alle gevallen van longlobtorsie gezien wordt. De oorzaak is meestal idiopathisch (spontaan). Secundaire gevallen worden beschreven bij patiënten met pleurale effusie of met een voorgeschiedenis van recente (thorax)chirurgie. De behandeling is altijd chirurgisch en bestaat uit lobectomie van de aangetaste longlob. De prognose na chirurgie wordt beïnvloed door eventuele onderliggende pathologieën. In dit artikel worden het voorkomen, de pathofysiologie, de klinische symptomen, de beeldvormingstechnieken en de chirurgische behandeling van longlobtorsie bij de hond beschreven.


Author(s):  
Marina L. Mozgaleva ◽  
Pavel A. Akimov ◽  
Taymuraz B. Kaytukov

he distinctive paper is devoted to so-called multigrid (particularly two-grid) method of structural analysis based on discrete Haar basis (one-dimensional, two-dimensional and three-dimensional problems are under consideration). Approximations of the mesh functions in discrete Haar bases of zero and first levels are described (the mesh function is represented as the sum in which one term is its approximation of the first level, and the second term is so-called complement (up to the initial state) on the grid of the first level). Special projectors are constructed for the spaces of vector functions of the original grid to the space of their approximation on the first-level grid and its complement (the refinement component) to the initial state. Basic scheme of the two-grid method is presented. This method allows solution of boundary problems of structural mechanics with the use of matrix operators of significantly smaller dimension. It should be noted that discrete analogue of the initial operator equation is a system of linear algebraic equations which is constructed with the use of finite element method or finite difference method. Block Gauss method can be used for direct solution.


2008 ◽  
Vol 144 (2) ◽  
pp. 499-510 ◽  
Author(s):  
SMBAT GOGYAN ◽  
P. WOJTASZCZYK

AbstractWe show that in $L_1(\R)$ the Haar wavelet basis is not equivalent to any permutation with any signs of the Strω wavelet basis. We also construct a Haar-type system in L1[0,1] which is not equivalent to any subsequence with signs of the classical Haar basis.


Author(s):  
REZA POURGHOLI ◽  
AMIN ESFAHANI ◽  
SAEDEH FOADIAN ◽  
SONA PAREHKAR

In this paper, two numerical methods are presented to solve an ill-posed inverse problem for Fisher's equation using noisy data. These two methods are the Haar basis and the Legendre wavelet methods combined with the Tikhonov regularization method. A sensor located at a point inside the body is used and u(x, t) at a point x = a, 0 < a < 1 is measured and these methods are applied to the inverse problem. We also show that an exponential rate of convergence of these methods. In fact, this work considers a comparative study between the Haar basis and the Legendre wavelet methods to solve some ill-posed inverse problems. Results show that an excellent estimation of the unknown function of the inverse problem which have been obtained within a couple of minutes CPU time at Pentium(R) Dual-Core CPU 2.20 GHz.


Sign in / Sign up

Export Citation Format

Share Document