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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0022-247x(02)00122-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2062383436 / rank
 
Normal rank

Latest revision as of 11:48, 30 July 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
    0 references