2017JOURNAL OF INTERNATIONAL ACADEMY OF PHYSICAL SCIENCESOpen access

Stability Conditions for Fixed Point Iteration Procedures

Neeta Singh

Open full text 0 citations

Abstract

In this paper, we study conditions under which certain fixed-point iteration procedures are stable. We also discuss the rate of convergence of the iterations and calculate the value of the iteration parameter for which the convergence rate is fastest. Â

About this research paper

What this paper is about

In this paper, we study conditions under which certain fixed-point iteration procedures are stable. We also discuss the rate of convergence of the iterations and calculate the value of the iteration parameter for which the convergence rate is fastest. Â

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we study conditions under which certain fixed-point iteration procedures are stable. We also discuss the rate of convergence of the iterations and calculate the value of the iteration parameter for which the convergence rate is fastest. Â

Key concepts: Fixed-point iteration, Fixed point, Convergence (economics), Mathematics, Rate of convergence, Stability (learning theory), Applied mathematics, Value (mathematics)

Related papers

Back to paper searchBrowse research topicsOriginal source
Stability Conditions for Fixed Point Iteration Procedures — Research Paper | ScholarLens