当前位置：首页 > JavaScript

js实现超越方程

2026-04-04 16:58:52JavaScript

超越方程简介

超越方程指包含超越函数（如指数、对数、三角函数等）的方程，无法通过有限次代数运算求解。JavaScript可通过数值方法近似求解，常见方法包括迭代法、二分法和牛顿迭代法。

二分法求解

二分法适用于连续函数且在区间内存在唯一解的情况。以求解方程 $e^x - 2x - 1 = 0$ 为例：

function bisectionMethod(func, a, b, tolerance = 1e-6, maxIterations = 100) {
    let fa = func(a);
    let fb = func(b);
    if (fa * fb >= 0) throw new Error("区间内无解或解不唯一");

    for (let i = 0; i < maxIterations; i++) {
        const c = (a + b) / 2;
        const fc = func(c);
        if (Math.abs(fc) < tolerance || (b - a) / 2 < tolerance) {
            return c;
        }
        if (fa * fc < 0) {
            b = c;
            fb = fc;
        } else {
            a = c;
            fa = fc;
        }
    }
    throw new Error("未达到所需精度");
}

// 示例：求解 e^x - 2x - 1 = 0
const equation = x => Math.exp(x) - 2 * x - 1;
const solution = bisectionMethod(equation, 0, 2);
console.log("解:", solution); // 输出近似解

牛顿迭代法

牛顿法利用函数导数快速收敛，适用于可导函数。求解方程 $\sin(x) - 0.5x = 0$：

function newtonMethod(func, derivative, x0, tolerance = 1e-6, maxIterations = 100) {
    let x = x0;
    for (let i = 0; i < maxIterations; i++) {
        const fx = func(x);
        const dfx = derivative(x);
        const delta = fx / dfx;
        x -= delta;
        if (Math.abs(delta) < tolerance) return x;
    }
    throw new Error("未收敛");
}

// 示例：求解 sin(x) - 0.5x = 0
const func = x => Math.sin(x) - 0.5 * x;
const derivative = x => Math.cos(x) - 0.5;
const solution = newtonMethod(func, derivative, 1);
console.log("解:", solution); // 输出近似解

迭代法

固定点迭代法通过构造迭代公式逼近解。例如求解 $x = e^{-x}$：

js实现超越方程

function fixedPointIteration(func, x0, tolerance = 1e-6, maxIterations = 100) {
    let x = x0;
    for (let i = 0; i < maxIterations; i++) {
        const nextX = func(x);
        if (Math.abs(nextX - x) < tolerance) return nextX;
        x = nextX;
    }
    throw new Error("未收敛");
}

// 示例：求解 x = e^{-x}
const func = x => Math.exp(-x);
const solution = fixedPointIteration(func, 0.5);
console.log("解:", solution);