Root Finding over the Complex Numbers

Executive summary

Numerical output, exact obligations

Complex roots are needed to compute embeddings of a number field, hence traces, norms, regulators and the analytic quantities used to verify class numbers. The task is numerical, but the obligations are those of exact mathematics: a root computed to inadequate precision produces a wrong regulator that looks entirely reasonable. Conditioning must therefore be assessed, and precision must be budgeted rather than hoped for.

Learning objectives

Assess the conditioning of a polynomial's roots.
Compare simultaneous iteration methods with deflation-based approaches.
Budget working precision for a required accuracy in the roots.
Explain why root finding is a prerequisite for exact number field computation.

Section 01Conditioning

Roots can be extraordinarily sensitive to coefficient perturbations. The standard illustration is the polynomial with roots at 1, 2, …, 20: a change in the eighteenth decimal place of one coefficient moves several roots visibly and can make real roots collide and become complex.

δα ≈ −δa_k α^k / f′(α)

The condition number is governed by 1/|f′(α)|. Roots that are close together make the derivative small and the problem ill-conditioned; repeated roots make it singular. A polynomial with tightly clustered roots simply cannot have those roots computed to high relative accuracy from its coefficients, no matter which algorithm is used.

Ill-conditioning is a property of the problem

No algorithm can recover accuracy that the representation does not contain. Where high precision is required for clustered roots, the working precision must be increased — or the polynomial must be handled through a better-conditioned representation, such as its factorisation.

Section 02Methods

Root-finding methods in practice
Method	Character	Strengths	Weaknesses
Newton with deflation	Sequential	Simple; quadratic convergence near a simple root	Deflation accumulates error; later roots progressively less accurate
Durand–Kerner	Simultaneous	Finds all roots at once; no deflation error	Convergence can be slow; sensitive to the starting configuration
Aberth–Ehrlich	Simultaneous	Cubic convergence; robust in practice — the usual default	Needs a good initial distribution of starting points
Companion matrix eigenvalues	Linear algebra	Uses mature, well-tested QR machinery	O(n³); accuracy limited by the balancing of the companion matrix
Splitting circle	Divide and conquer	Near-optimal asymptotic complexity; certified variants exist	Substantially more complex to implement

Start on a circle, not at the origin

Simultaneous methods depend heavily on their starting configuration. The standard choice places the initial approximations on a circle whose radius reflects the coefficient magnitudes, slightly rotated to avoid symmetry. Starting all iterates at the same point causes immediate breakdown.

Section 03Precision management

Working precision must exceed the target accuracy by the number of digits lost to conditioning. In practice a computation is run at increasing precision until two successive runs agree to the required accuracy — an empirical but effective discipline.

AlgorithmPrecision-doubling root computationin: f, target accuracy → out: roots with verified accuracy

Set the working precision to a starting value, typically twice the target.
Compute all roots at the current precision.
Verify: substitute each root back and confirm the residual is consistent with the precision used. A large residual means the precision was insufficient.
Compare with the previous run; if the agreed digits meet the target, accept.
Otherwise double the precision and return to step 2.

Where the roots are used

Complex roots supply the archimedean embeddings of a number field. From these come the trace and norm as sums and products of conjugates, the logarithmic embedding used for units, and hence the regulator. A regulator is a determinant of logarithms of embedded units — and an under-resolved root propagates directly into it.

ReferenceFrequently asked questions

Should exact methods be used instead?

Where possible, yes — exact arithmetic on the algebraic number, using its minimal polynomial, avoids the question entirely. But quantities such as the regulator are genuinely real numbers with no finite exact representation, so numerical evaluation with certified error bounds is unavoidable.

How are real roots isolated exactly?

By Sturm sequences or by Descartes' rule applied to subdivided intervals, both of which give certified isolating intervals using only exact arithmetic. Numerical refinement then narrows an interval that is already guaranteed to contain exactly one root.

What accuracy does a regulator computation need?

Enough that the computed value is distinguishable from all plausible alternatives — in particular from small rational multiples of itself, since an error of a factor of 2 in the regulator is exactly the signature of having found a subgroup of the unit group rather than the whole of it.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Root Finding over the Complex Numbers. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Root Finding over the Complex Numbers as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—root, finding, section, over, numerical—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Root Finding over the Complex Numbers?