process

convergence

The approach of a numerical solution toward a final, accurate answer through iteration.
9 related articles · 3 formulas

Description

Convergence in numerical analysis describes the process by which an iterative algorithm approaches a final, accurate solution through repeated refinement. Each iteration brings the approximation closer to the true answer, and convergence is achieved when further iterations produce negligible change. This concept underpins virtually all computational physics, from quantum chemistry calculations to machine learning training.

History

The formal study of convergence dates to the 19th century with mathematicians like Augustin-Louis Cauchy, who defined rigorous criteria for sequences and series. Numerical convergence became central to computing in the mid-20th century as digital computers enabled iterative methods for complex problems.

How it works

An iterative method starts with an initial guess and applies a mathematical operation repeatedly, generating a sequence of values. Convergence occurs when this sequence approaches a limit—the solution—within a desired tolerance. The rate of convergence (linear, quadratic, etc.) determines how quickly the algorithm reaches accuracy. Techniques like error estimation and adaptive step sizes help ensure and accelerate convergence.

In practice

Convergence is essential in computational chemistry for optimizing molecular structures, in neural network training where loss functions must converge, and in solving differential equations for weather prediction and engineering simulations.

Fun fact

In some chaotic systems, tiny changes in initial conditions can prevent convergence entirely, a phenomenon known as sensitive dependence on initial conditions.

Concept graph →

Formulas

$$\kappa'(\theta) = \lambda\kappa(\theta) + (1-\lambda)$$
Convergence transforms linearly with a constant mass sheet addition.
What is in the formula
\kappa'(\theta)variabletransformed convergence — convergence
\kappa(\theta)variableoriginal convergence — convergence
\lambdavariabletransformation parameter — dimensionless parameter
$$\kappa(\boldsymbol{\theta}) = \frac{3H_0^2\Omega_m}{2c^2} \int_0^{\chi} d\chi' \, \frac{q(\chi')}{a(\chi')} f_K(\chi') \delta(f_K(\chi')\boldsymbol{\theta}, \chi')$$
Convergence is a weighted integral of density contrast along the line of sight.
What is in the formula
kappavariableweak lensing convergence — convergence
thetavariableangular position on the sky — angular position radian
chivariablecomoving distance to the source — comoving distance metre
chi'variablecomoving distance along the line of sight — comoving distance metre
qvariablelensing efficiency function — lensing efficiency
avariablescale factor — scale factor
f_Kvariablecomoving angular diameter distance — comoving angular diameter distance metre
deltavariablematter density contrast — density contrast
H_0constantcurrent expansion rate of the universe — hubble constant = 2.2e-18 per second
Omega_mconstantratio of matter density to critical density today — matter density parameter = 0.315
cconstantspeed of light in vacuum — speed of light = 299792458 metre per second
∫operatorsummation over infinitesimal elements — integral
$$\tilde{\kappa} + i\tilde{\kappa}_B = \left( \frac{k_1^2 - k_2^2}{k^2} + i \frac{2k_1 k_2}{k^2} \right) (\tilde{\gamma}_1 + i\tilde{\gamma}_2)$$
Shear and convergence are related by a kernel in Fourier space.
What is in the formula
\tilde{\kappa}variableFourier transform of convergence — convergence
\tilde{\kappa}_BvariableFourier transform of B-mode convergence — b mode convergence
\tilde{\gamma}_1variableFourier transform of first shear component — shear component
\tilde{\gamma}_2variableFourier transform of second shear component — shear component
k_1variableFirst component of wave vector — wave vector component radian per metre
k_2variableSecond component of wave vector — wave vector component radian per metre
kvariableMagnitude of wave vector — wave number radian per metre

Related articles · 9

Materials2026-07-103 minarXiv:2607.09304
Warm Start for a Quantum Engine: How Machine Learning Accelerates Molecular Calculations
DFTB is a high-speed train in the world of quantum chemistry: hundreds of times faster than classical DFT, yet still on electronic rails. But its engine — iterative self-consistency of charges — sometimes resembles an orchestra where each instrument starts from an arbitrary note.
Cosmology2026-06-303 minarXiv:2606.31988
JADE: The AI Detective That Reads the Cosmic Web in Light Trails
Light from distant galaxies travels to us for billions of years, but along the way it gets bent and twisted by the invisible web of dark matter. This effect, predicted by Albert Einstein within general relativity, is called gravitational lensing.
math.GM2026-06-292 minarXiv:2607.01265
λ∞: The Tuning Fork for Prime Numbers
Strike a tuning fork. The frequency is 440 Hz. That's the note A — the standard of sound. In the world of numbers, there's a standard too. It's tuned not to sound, but to prime numbers. Though their distribution seems random, it obeys strict laws. All primes resonate together. There's just one value: λ∞ ≈ 0,674036.
q-bio.QM2026-05-221 minarXiv:2605.23745express
A Chemical Computer in a Test Tube
Molecules float in a test tube. Their abundance (say, the concentration of some protein) becomes the input signal. And the output isn't just a cloudy solution but a clear yes-or-no answer. The authors build a chemical cascade that does exactly that.
Quantum Physics2026-04-041 minarXiv:2604.03546express
How to Fit an Elephant in a Matchbox
Quantum annealing works like a smart way to find a path through a maze: instead of checking every dead end, it uses quantum effects to find the exit faster. But this maze has a quirk: the numbers that describe the walls and corridors must be roughly the same size.
Chemical Physics2026-04-021 minarXiv:2604.02144express
How to Check the Accuracy of Quantum Calculations
When chemists calculate the behavior of molecules on a computer, they use approximate methods because exact calculations are too complex. For light atoms, there are well-established benchmarks, but for heavy atoms, where relativistic effects matter, such benchmarks did not exist. It's like checking a ruler against another ruler rather than against a standard meter.
Atomic Physics2026-03-101 minarXiv:2603.09350express
How to Count Atoms More Precisely
An electron in an atom is like a note on a string: it has a set of allowed energies, and the physicist's task is to find these notes. Usually, the space around the nucleus is divided into small pieces and the behavior of the electron in each piece is calculated. The finer the pieces, the more accurate the answer.
Calibrating for Small Data: The GOAL Algorithm
An optician turns the frame, adjusts the focus, and a blurry spot becomes a sharp image. The new algorithm GOAL works much the same way: it rotates the data cloud, compresses redundant dimensions, and brings into focus what truly matters.
cs.PL2011-09-053 minarXiv:1109.0786
Properties as a Compass: Precise Programming
Fog thickens over the line "def max(a: Int, b: Int): Int". What does it do? It returns the larger of two numbers, but how can you verify that? You could write a dozen tests with specific pairs: max(2,3)=3, max(5,5)=5, max(-1,0)=0. Still, a nagging doubt remains: what if it breaks for, say, a million and minus a million?