A characteristic condition for convergence of steepest descent approximation to accretive operator equations (Q1849134): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Hai-Yun Zhou / rank
Normal rank
 
Property / author
 
Property / author: Hai-Yun Zhou / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for convergence of steepest descent approximation to accretive operator equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the zeros of accretive operators by the Ishikawa iteration process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of fixed points of strongly pseudocontractive maps without Lipschitz assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative solution of nonlinear equations involving strongly accretive operators without the Lipschitz assumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a theorem of Xu and Roach / rank
 
Normal rank

Revision as of 18:58, 4 June 2024

scientific article
Language Label Description Also known as
English
A characteristic condition for convergence of steepest descent approximation to accretive operator equations
scientific article

    Statements

    A characteristic condition for convergence of steepest descent approximation to accretive operator equations (English)
    0 references
    28 November 2002
    0 references
    A sufficient and necessary condition for convergence of steepest descent approximation of accretive operator equations is established and a specific error estimate is also given.
    0 references
    0 references
    iterative sequences
    0 references
    convergence
    0 references
    steepest descent method
    0 references
    error estimate
    0 references
    0 references