On the Convergence of a Weak Greedy Algorithm for the Multivariate Haar Basis

We define a family of weak thresholding greedy algorithms for the multivariate Haar basis for L 1 [0,1] d ( d ≥1). We prove convergence and uniform boundedness of the weak greedy approximants for all f ∈ L 1 [0,1] d .

Uloženo v:
Podrobná bibliografie
Vydáno v:Constructive approximation Ročník 39; číslo 2; s. 343 - 366
Hlavní autoři: Dilworth, S. J., Gogyan, S., Kutzarova, Denka
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.04.2014
Témata:
ISSN:0176-4276, 1432-0940
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract We define a family of weak thresholding greedy algorithms for the multivariate Haar basis for L 1 [0,1] d ( d ≥1). We prove convergence and uniform boundedness of the weak greedy approximants for all f ∈ L 1 [0,1] d .
AbstractList We define a family of weak thresholding greedy algorithms for the multivariate Haar basis for L 1 [0,1] d ( d ≥1). We prove convergence and uniform boundedness of the weak greedy approximants for all f ∈ L 1 [0,1] d .
Author Gogyan, S.
Kutzarova, Denka
Dilworth, S. J.
Author_xml – sequence: 1
  givenname: S. J.
  surname: Dilworth
  fullname: Dilworth, S. J.
  email: dilworth@math.sc.edu
  organization: Department of Mathematics, University of South Carolina
– sequence: 2
  givenname: S.
  surname: Gogyan
  fullname: Gogyan, S.
  organization: Institute of Mathematics, Armenian Academy of Sciences
– sequence: 3
  givenname: Denka
  surname: Kutzarova
  fullname: Kutzarova, Denka
  organization: Institute of Mathematics, Bulgarian Academy of Sciences, Department of Mathematics, University of Illinois at Urbana-Champaign
BookMark eNp9kMFOAjEQhhuDiYA-gLe-QLXtlu7uEYmCCYSLxmPT7c5CcWlNW0l4e4t48sBlZg7_N8n_jdDAeQcI3TP6wCgtHyOlhZwQygpSc8aJuEJDJgpOaC3oAA0pKyURvJQ3aBTjjlI2qYpyiFZrh9MW8My7A4QNOAPYd1jjD9CfeB4A2iOe9hsfbNrucefDb3z13Sd70MHqBHihdcBPOtp4i6473Ue4-9tj9P7y_DZbkOV6_jqbLonhVZVIxSRQ2TEONZemEE03AZAtl41samNEmw-tq7oVBTDa5IJQdcyULW95HrQYo_L81wQfY4BOGZt0st6loG2vGFUnK-psRWUr6mRFiUyyf-RXsHsdjhcZfmZizroNBLXz38HlghegH93sdfQ
CitedBy_id crossref_primary_10_1070_IM8346
crossref_primary_10_4213_im8346
Cites_doi 10.1017/CBO9780511762291
10.1006/jath.2000.3512
10.1023/A:1018900431309
10.1016/j.jfa.2012.09.011
10.1006/jath.2001.3641
10.1016/j.jat.2008.08.017
10.1007/s003659900090
ContentType Journal Article
Copyright Springer Science+Business Media New York 2013
Copyright_xml – notice: Springer Science+Business Media New York 2013
DBID AAYXX
CITATION
DOI 10.1007/s00365-013-9212-4
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
EISSN 1432-0940
EndPage 366
ExternalDocumentID 10_1007_s00365_013_9212_4
GroupedDBID -52
-5D
-5G
-BR
-EM
-Y2
-~C
-~X
.86
.VR
06D
0R~
0VY
199
1N0
1SB
2.D
203
28-
29F
2J2
2JN
2JY
2KG
2KM
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
6TJ
78A
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDBF
ABDZT
ABECU
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTAH
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACUHS
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFFNX
AFGCZ
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
BA0
BAPOH
BBWZM
BDATZ
BGNMA
BSONS
CAG
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
EPL
ESBYG
ESX
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IXE
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
KDC
KOV
KOW
LAS
LLZTM
M4Y
MA-
MK~
ML~
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
P19
P2P
P9R
PF0
PT4
PT5
QOK
QOS
R4E
R89
R9I
RHV
RIG
RNI
ROL
RPX
RSV
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCLPG
SDD
SDH
SDM
SHX
SISQX
SJYHP
SMT
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z7R
Z8M
ZMTXR
ZWQNP
ZY4
~8M
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABJCF
ABRTQ
ACSTC
ADHKG
ADXHL
AEZWR
AFDZB
AFFHD
AFHIU
AFKRA
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
AMVHM
ATHPR
AYFIA
AZQEC
BENPR
BGLVJ
CCPQU
CITATION
DWQXO
GNUQQ
HCIFZ
M2P
M7S
PHGZM
PHGZT
PQGLB
PTHSS
ID FETCH-LOGICAL-c288t-816e06f12e926c34bf5ee6d26b6b9cc4d6b6aa89d43e10b100e8f1c7d2d27d203
IEDL.DBID RSV
ISICitedReferencesCount 3
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000332485500003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0176-4276
IngestDate Sat Nov 29 04:47:01 EST 2025
Tue Nov 18 21:44:18 EST 2025
Fri Feb 21 02:29:43 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Greedy algorithms
Multivariate Haar system
Multivariate Haar wavelet
42A10
Branch-greedy
41A65
46B20
Thresholding greedy algorithm
Weak thresholding
Nonlinear approximation
Language English
License http://www.springer.com/tdm
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c288t-816e06f12e926c34bf5ee6d26b6b9cc4d6b6aa89d43e10b100e8f1c7d2d27d203
PageCount 24
ParticipantIDs crossref_citationtrail_10_1007_s00365_013_9212_4
crossref_primary_10_1007_s00365_013_9212_4
springer_journals_10_1007_s00365_013_9212_4
PublicationCentury 2000
PublicationDate 20140400
2014-4-00
PublicationDateYYYYMMDD 2014-04-01
PublicationDate_xml – month: 4
  year: 2014
  text: 20140400
PublicationDecade 2010
PublicationPlace Boston
PublicationPlace_xml – name: Boston
PublicationTitle Constructive approximation
PublicationTitleAbbrev Constr Approx
PublicationYear 2014
Publisher Springer US
Publisher_xml – name: Springer US
References Gogyan (CR4) 2009; 161
Dilworth, Kutzarova, Wojtaszczyk (CR3) 2002; 114
Wojtaszczyk (CR11) 2000; 107
Konyagin, Temlyakov (CR5) 1999; 5
Temlyakov (CR9) 2007
Dilworth, Kutzarova, Schlumprecht, Wojtaszczyk (CR2) 2012; 263
Temlyakov (CR10) 2011
Konyagin, Temlyakov (CR6) 2002; 28
Bénéteau, van Fleet (CR1) 2011; 58
Temlyakov (CR7) 1998; 14
Temlyakov (CR8) 1998; 8
C. Bénéteau (9212_CR1) 2011; 58
P. Wojtaszczyk (9212_CR11) 2000; 107
S.V. Konyagin (9212_CR5) 1999; 5
V.N. Temlyakov (9212_CR10) 2011
V.N. Temlyakov (9212_CR8) 1998; 8
V.N. Temlyakov (9212_CR9) 2007
S.J. Dilworth (9212_CR2) 2012; 263
V.N. Temlyakov (9212_CR7) 1998; 14
S.V. Konyagin (9212_CR6) 2002; 28
S.J. Dilworth (9212_CR3) 2002; 114
S. Gogyan (9212_CR4) 2009; 161
References_xml – year: 2011
  ident: CR10
  publication-title: Greedy Approximation
  doi: 10.1017/CBO9780511762291
– volume: 107
  start-page: 293
  year: 2000
  end-page: 314
  ident: CR11
  article-title: Greedy algorithm for general biorthogonal systems
  publication-title: J. Approx. Theory
  doi: 10.1006/jath.2000.3512
– volume: 58
  start-page: 655
  issue: 5
  year: 2011
  end-page: 666
  ident: CR1
  article-title: Discrete wavelet transformations and undergraduate education
  publication-title: Not. Am. Math. Soc.
– volume: 8
  start-page: 249
  year: 1998
  end-page: 265
  ident: CR8
  article-title: The best -term approximation and greedy algorithms
  publication-title: Adv. Comput. Math.
  doi: 10.1023/A:1018900431309
– volume: 28
  start-page: 305
  year: 2002
  end-page: 328
  ident: CR6
  article-title: Greedy approximation with regard to bases and general minimal systems
  publication-title: Serdica Math. J.
– volume: 263
  start-page: 3900
  year: 2012
  end-page: 3921
  ident: CR2
  article-title: Weak thresholding greedy algorithms in Banach spaces
  publication-title: J. Funct. Anal.
  doi: 10.1016/j.jfa.2012.09.011
– volume: 114
  start-page: 214
  year: 2002
  end-page: 241
  ident: CR3
  article-title: On approximate systems in Banach spaces
  publication-title: J. Approx. Theory
  doi: 10.1006/jath.2001.3641
– volume: 161
  start-page: 49
  year: 2009
  end-page: 64
  ident: CR4
  article-title: On convergence of weak thresholding greedy algorithm in (0,1)
  publication-title: J. Approx. Theory
  doi: 10.1016/j.jat.2008.08.017
– volume: 5
  start-page: 1
  year: 1999
  end-page: 15
  ident: CR5
  article-title: A remark on greedy approximation in Banach spaces
  publication-title: East J. Approx.
– volume: 14
  start-page: 569
  year: 1998
  end-page: 587
  ident: CR7
  article-title: Greedy approximation and -term trigonometric approximation
  publication-title: Constr. Approx.
  doi: 10.1007/s003659900090
– start-page: 1479
  year: 2007
  end-page: 1504
  ident: CR9
  article-title: Greedy approximations with regard to bases
  publication-title: Proc. Int. Cong. of Mathem
– volume: 161
  start-page: 49
  year: 2009
  ident: 9212_CR4
  publication-title: J. Approx. Theory
  doi: 10.1016/j.jat.2008.08.017
– volume: 28
  start-page: 305
  year: 2002
  ident: 9212_CR6
  publication-title: Serdica Math. J.
– volume: 5
  start-page: 1
  year: 1999
  ident: 9212_CR5
  publication-title: East J. Approx.
– volume: 114
  start-page: 214
  year: 2002
  ident: 9212_CR3
  publication-title: J. Approx. Theory
  doi: 10.1006/jath.2001.3641
– volume-title: Greedy Approximation
  year: 2011
  ident: 9212_CR10
  doi: 10.1017/CBO9780511762291
– volume: 107
  start-page: 293
  year: 2000
  ident: 9212_CR11
  publication-title: J. Approx. Theory
  doi: 10.1006/jath.2000.3512
– volume: 263
  start-page: 3900
  year: 2012
  ident: 9212_CR2
  publication-title: J. Funct. Anal.
  doi: 10.1016/j.jfa.2012.09.011
– volume: 14
  start-page: 569
  year: 1998
  ident: 9212_CR7
  publication-title: Constr. Approx.
  doi: 10.1007/s003659900090
– volume: 8
  start-page: 249
  year: 1998
  ident: 9212_CR8
  publication-title: Adv. Comput. Math.
  doi: 10.1023/A:1018900431309
– start-page: 1479
  volume-title: Proc. Int. Cong. of Mathem
  year: 2007
  ident: 9212_CR9
– volume: 58
  start-page: 655
  issue: 5
  year: 2011
  ident: 9212_CR1
  publication-title: Not. Am. Math. Soc.
SSID ssj0015837
Score 1.9820255
Snippet We define a family of weak thresholding greedy algorithms for the multivariate Haar basis for L 1 [0,1] d ( d ≥1). We prove convergence and uniform boundedness...
SourceID crossref
springer
SourceType Enrichment Source
Index Database
Publisher
StartPage 343
SubjectTerms Analysis
Mathematics
Mathematics and Statistics
Numerical Analysis
Title On the Convergence of a Weak Greedy Algorithm for the Multivariate Haar Basis
URI https://link.springer.com/article/10.1007/s00365-013-9212-4
Volume 39
WOSCitedRecordID wos000332485500003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: Springer Nature - Connect here FIRST to enable access
  customDbUrl:
  eissn: 1432-0940
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0015837
  issn: 0176-4276
  databaseCode: RSV
  dateStart: 19970301
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEA66etCDb3F9kYMnJdBHmibHdXHZg67ic28lr-ri2pW2LvjvTbJtYUEFvZQWpqWZppkJ833fAHCCIyFSwjDCOJZmg-JFiEdUIJMcsyDllgHlvvRlPBjQ4ZDdVDzuoka71yVJt1I3ZDcrnWKBZiFiZr1FeBEsmWhHbb-G27vHpnQQ0ZlQph8ThIOY1KXM7x4xH4zmK6EuwPTW__VqG2CtyidhZzYBNsGCzrbA6lUjxlpsg6vrDJpL2LUAc8e11HCSQg6fNH-FFnijPmFn_DzJR-XLGzRZrDN31Nyp2UqbbBT2Oc_hOS9GxQ546F3cd_uo6qKAZEBpiahPtEdSP9AsIDLEIo20JioggggmJVbmhHPKFA617wkzIE1TX8YqUIE5eOEuaGWTTO8ByKQfKk5EiiXHOIoZJ1gQFbHQ14x7tA282p2JrCTGbaeLcdKIIztPJcZTifVUgtvgtLnlfaav8ZvxWe3_pPrVip-t9_9kfQBWTC5UgXIOQavMP_QRWJbTclTkx26KfQEJtshs
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1bS8MwFA46BfXBuzivefBJCfSSpsnjHI6J2xSdureSpKkOZydrHfjvTbK2IKigLyWF09KcJjlfON_5AsAJDoRICMMI41DqDYoTIB5QgTQ4Zl7CTQWU_dOdsNejgwG7Keq4s5LtXqYk7UpdFbsZ6RRDNPMR0-stwvNgAeuAZQTzb-8eqtRBQGdCmW5IEPZCUqYyv3vF12D0NRNqA0xr7V-ftg5WCzwJG7MBsAHmVLoJVrqVGGu2BbrXKdS3sGkI5rbWUsFxAjl8VPwFGuJN_AEbo6fxZJg_v0KNYq25Lc2d6q20RqOwzfkEnvNsmG2D-9ZFv9lGxSkKSHqU5oi6RDkkcT3FPCJ9LJJAKRJ7RBDBpMSxbnBOWYx95TpCd0jRxJVh7MWevjj-Dqil41TtAsik68eciARLjnEQMk6wIHHAfFcx7tA6cEp3RrKQGDcnXYyiShzZeirSnoqMpyJcB6fVI28zfY3fjM9K_0fFVMt-tt77k_UxWGr3u52oc9m72gfLGhcVBJ0DUMsn7-oQLMppPswmR3a4fQJ44MtQ
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1JS8QwFA5uiB7cxd0cPClhuqRpctTRYURnHHC9lWzVQe1IWwf89ybdQFBBvJQWXkvzkjbv8b7vewAc4ECImDCMMA6lSVCcAPGACmSCY-bF3DKgipm-DPt9-vDABlWf06xGu9clyZLTYFWakrz1puJWQ3yzMioWdOYjZv69CE-CaWxx9DZdv75ryggBLUUz3ZAg7IWkLmt-94ivG9PXqmix2XQW__2aS2ChijPhcbkwlsGETlbAfK8Rac1WQe8qgeYSti3wvOBgajiKIYf3mj9DC8hRH_D45XGUDvOnV2ii28K8oOyOTYptolTY5TyFJzwbZmvgtnN20-6iqrsCkh6lOaIu0Q6JXU8zj0gfizjQmiiPCCKYlFiZE84pU9jXriPMgDSNXRkqT3nm4PjrYCoZJXoDQCZdX3EiYiw5xkHIOMGCqID5rmbcoZvAqV0byUp63HbAeIka0eTCU5HxVGQ9FeFNcNjc8lbqbvxmfFTPRVR9gtnP1lt_st4Hs4PTTnR53r_YBnMmXKpwOztgKk_f9S6YkeN8mKV7xcr7BOKi1DQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+Convergence+of+a+Weak+Greedy+Algorithm+for+the+Multivariate+Haar+Basis&rft.jtitle=Constructive+approximation&rft.au=Dilworth%2C+S.+J.&rft.au=Gogyan%2C+S.&rft.au=Kutzarova%2C+Denka&rft.date=2014-04-01&rft.pub=Springer+US&rft.issn=0176-4276&rft.eissn=1432-0940&rft.volume=39&rft.issue=2&rft.spage=343&rft.epage=366&rft_id=info:doi/10.1007%2Fs00365-013-9212-4&rft.externalDocID=10_1007_s00365_013_9212_4
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0176-4276&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0176-4276&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0176-4276&client=summon