Rates of convergence for iterative solutions of equations involving set-valued accretive operators
- Submitting institution
-
The University of Bath
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 210610461
- Type
- D - Journal article
- DOI
-
10.1016/j.camwa.2020.04.002
- Title of journal
- Computers & Mathematics with Applications
- Article number
- -
- First page
- 490
- Volume
- 80
- Issue
- 3
- ISSN
- 0898-1221
- Open access status
- Deposit exception
- Month of publication
- April
- Year of publication
- 2020
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 1
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- This is a contribution to "proof mining" - where methods from logic are used to obtain new results in analysis. Here, new explicit rates of convergence are given for iterative algorithms for computing the unique zeros of set-valued accretive operators. A number of prima-facie unrelated convergence proofs in the literature are hence unified. Although the authors specialise in mathematical logic, the paper appears in a general interest journal focusing on PDEs, highlighting the cross-disciplinarity of this work. The results of this paper have already been applied by Sipos to obtain quantitative results related to abstract proximal point algorithms.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -