Skip to content

College+ · Numerical Methods

Fixed-point iteration

116 problems in this skill, each with a solver-verified answer key. Answers are checked the moment you submit — with a hint if you want one and a worked solution afterwards.

What the problems look like

A few statements from this skill. Answers, hints and worked solutions live in the practice session.

  1. Warm-up

    The fixed-point iteration xn+1=g(xn)x_{n+1} = g(x_n) uses g(x)=(ax+b)/cg(x) = (ax + b)/c with a=−3a = -3, b=8b = 8 and c=6c = 6. Find (i) the fixed point pp, which satisfies p=g(p)p = g(p), and (ii) the convergence rate ∣g′(p)∣|g'(p)|. Give both as exact fractions in lowest terms.

  2. Warm-up

    The fixed-point iteration xn+1=g(xn)x_{n+1} = g(x_n) uses g(x)=(ax+b)/cg(x) = (ax + b)/c with a=4a = 4, b=−7b = -7 and c=6c = 6. Find (i) the fixed point pp, which satisfies p=g(p)p = g(p), and (ii) the convergence rate ∣g′(p)∣|g'(p)|. Give both as exact fractions in lowest terms.

  3. Warm-up

    The fixed-point iteration xn+1=g(xn)x_{n+1} = g(x_n) uses g(x)=(ax+b)/cg(x) = (ax + b)/c with a=−2a = -2, b=−2b = -2 and c=6c = 6. Find (i) the fixed point pp, which satisfies p=g(p)p = g(p), and (ii) the convergence rate ∣g′(p)∣|g'(p)|. Give both as exact fractions in lowest terms.

Problems shown under their original terms: Generated (template, solver-computed).

Practice this free, right now

Unlimited math practice is on the free plan — no card, no trial clock.

See every Numerical Methods skill for college+