Results 81 to 90 of about 188,604 (217)
A Comparison of Picard and Newton Iteration In the Numerical-solution of Multidimensional Variably Saturated Flow Problems [PDF]
Picard iteration is a widely used procedure for solving the nonlinear equation governing flow in variably saturated porous media. The method is simple to code and computationally cheap, but has been known to fail or converge slowly.
Claudio Paniconi +3 more
core +1 more source
Genomic analyses of Actias isabellae galliaegloria reveal low genetic diversity and inbreeding, indicating a historical bottleneck and reduced adaptive potential. Climate change is projected to drastically reduce suitable habitat by 2050, driven by rising temperatures and declines in Scots pine, its primary host.
Flora Lambert‐Auger +5 more
wiley +1 more source
Picard iteration converges faster than Mann iteration for a class of quasi-contractive operators
In the class of quasi-contractive operators satisfying Zamfirescu's conditions, the most used fixed point iterative methods, that is, the Picard, Mann, and Ishikawa iterations, are all known to be convergent to the unique fixed point. In this paper, the
Berinde Vasile
doaj +2 more sources
Finite element discretization of the pressure head form of the Richards equation leads to a nonlinear model, which yields numerical convergence difficulties.
Mohammad Islam, Abdul Hye, Abdulla Mamun
doaj +1 more source
ABSTRACT Technological integration into teaching offers significant pedagogical potential, yet it can also intensify the challenge of addressing systemic barriers to inclusion. This issue is especially important for teaching‐focused academics (TAs), who are increasingly leading classroom instruction and translating institutional digital priorities into
Hao Tran, Thao Thi Phuong Nguyen
wiley +1 more source
Convergence Results for Suzuki Generalized Nonexpansive Maps Using the HK-Iteration Scheme
Over the years, enhancing classical iteration methods by blending them with Picard’s approach has led to significantly improved convergence outcomes, as seen in schemes like the Picard-Noor, Picard-S, Picard-Ishikawa, and Picard-Mann hybrids.
Kifayat Ullah +5 more
core +1 more source
Sharp estimation of local convergence radius for the Picard iteration [PDF]
We investigate the local convergence radius of a general Picard iteration in the frame of a real Hilbert space. We propose a new algorithm to estimate the local convergence radius.
Maruster, Stefan +4 more
core +1 more source
A matheuristic for the traveling salesman problem with positional consistency constraints
Abstract We propose a matheuristic for the traveling salesman problem with positional consistency constraints, where we seek to generate a set of routes with minimum total cost, in which the nodes visited in more than one route (consistent nodes) must occupy the same relative position in all routes.
Luís Gouveia, Ana Paias, Mafalda Ponte
wiley +1 more source
Implicit Error Bounds for Picard Iterations on Hilbert Spaces
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D. Russell Luke +2 more
openaire +2 more sources
Solving stiff problems using generalized picard iteration
The main point of the talk is an alternative approach to the construction of numerical methods for stiff problems. It can be interpreted as a generalization of fixed-point iterations for implementation of implicit collocation methods.
Mandrik, P. A. +3 more
core

