Picard Iteration

Picard Iteration is an iterative method in fixed point theory for solving initial value problems by successively approximating the solution through repeated application of an integral operator derived from the differential equation, distinguished from other numerical convergence techniques by its foundation on the Banach fixed point theorem and construction via recursive integration of the right-hand side of the ODE.

404

Publications

21.3K

Citations

800

Authors

436

Institutions

Publications per year

2017–2026

126

Variants

Method Of Successive ApproximationsPicard's Method

Authors

800

  1. JL
    John L. Junkins

    Texas A&M University, United States

    10 publications · 330 citations

    10

    h-index

  2. VB
    Vasile Berinde

    Technical University of Cluj-Napoca, Romania

    7 publications · 848 citations

    7

    h-index

  3. IA
    Ioan A. Rus

    Babeș-Bolyai University, Romania

    6 publications · 219 citations

    6

    h-index

  4. RW
    Robyn Woollands

    Texas A&M University, United States

    6 publications · 172 citations

    6

    h-index

  5. XB
    Xiaoli Bai

    Rutgers, The State University of New Jersey, United States

    6 publications · 247 citations

    6

    h-index

1–5 of 800

Venues

  1. Fixed Point Theory and Applications

    12 publications · 641 citations

    11

    h-index

  2. Applied Mathematics and Computation

    10 publications · 387 citations

    10

    h-index

  3. arXiv (Cornell University)

    Repository · 10 publications · 225 citations

    10

    h-index

  4. 8

    h-index

  5. The Journal of the Astronautical Sciences

    8 publications · 254 citations

    8

    h-index

1–5