IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i9p2020-d1131580.html
   My bibliography  Save this article

Approximation Properties of the Vector Weak Rescaled Pure Greedy Algorithm

Author

Listed:
  • Xu Xu

    (School of Science, China University of Geosciences, Beijing 100083, China)

  • Jinyu Guo

    (School of Mathematics and LPMC, Nankai University, Tianjin 300071, China)

  • Peixin Ye

    (School of Mathematics and LPMC, Nankai University, Tianjin 300071, China)

  • Wenhui Zhang

    (School of Mathematics and LPMC, Nankai University, Tianjin 300071, China)

Abstract

We first study the error performances of the Vector Weak Rescaled Pure Greedy Algorithm for simultaneous approximation with respect to a dictionary D in a Hilbert space. We show that the convergence rate of the Vector Weak Rescaled Pure Greedy Algorithm on A 1 ( D ) and the closure of the convex hull of the dictionary D is optimal. The Vector Weak Rescaled Pure Greedy Algorithm has some advantages. It has a weaker convergence condition and a better convergence rate than the Vector Weak Pure Greedy Algorithm and is simpler than the Vector Weak Orthogonal Greedy Algorithm. Then, we design a Vector Weak Rescaled Pure Greedy Algorithm in a uniformly smooth Banach space setting. We obtain the convergence properties and error bound of the Vector Weak Rescaled Pure Greedy Algorithm in this case. The results show that the convergence rate of the VWRPGA on A 1 ( D ) is sharp. Similarly, the Vector Weak Rescaled Pure Greedy Algorithm is simpler than the Vector Weak Chebyshev Greedy Algorithm and the Vector Weak Relaxed Greedy Algorithm.

Suggested Citation

  • Xu Xu & Jinyu Guo & Peixin Ye & Wenhui Zhang, 2023. "Approximation Properties of the Vector Weak Rescaled Pure Greedy Algorithm," Mathematics, MDPI, vol. 11(9), pages 1-23, April.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:9:p:2020-:d:1131580
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/9/2020/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/9/2020/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Aitong Huang & Renzhong Feng & Andong Wang, 2022. "The Sufficient Conditions for Orthogonal Matching Pursuit to Exactly Reconstruct Sparse Polynomials," Mathematics, MDPI, vol. 10(19), pages 1-23, October.
    2. Zhiyong Liu & Qiuyan Xu, 2019. "A Multiscale RBF Collocation Method for the Numerical Solution of Partial Differential Equations," Mathematics, MDPI, vol. 7(10), pages 1-15, October.
    3. Anastasia A. Natsiou & George A. Gravvanis & Christos K. Filelis-Papadopoulos & Konstantinos M. Giannoutakis, 2023. "An Aggregation-Based Algebraic Multigrid Method with Deflation Techniques and Modified Generic Factored Approximate Sparse Inverses," Mathematics, MDPI, vol. 11(3), pages 1-15, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Minghao Hu & Lihua Wang & Fan Yang & Yueting Zhou, 2023. "Weighted Radial Basis Collocation Method for the Nonlinear Inverse Helmholtz Problems," Mathematics, MDPI, vol. 11(3), pages 1-29, January.
    2. Wang, Rong & Xu, Qiuyan & Liu, Zhiyong & Yang, Jiye, 2023. "Fast meshfree methods for nonlinear radiation diffusion equation," Applied Mathematics and Computation, Elsevier, vol. 438(C).
    3. Ju, Yuejuan & Yang, Jiye & Liu, Zhiyong & Xu, Qiuyan, 2023. "Meshfree methods for the variable-order fractional advection–diffusion equation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 211(C), pages 489-514.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:9:p:2020-:d:1131580. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.