牛顿下山法解多项式方程 Scala版

Funchess

已于 2024-04-22 22:23:41 修改

阅读量118

点赞数 1

文章标签： scala

于 2024-04-20 00:09:17 首次发布

本文链接：https://blog.csdn.net/weixin_42317476/article/details/137981254

版权

import scala.io.StdIn.readLine
import scala.math._

object Main {
	def main(args: Array[String]): Unit = {
		val x1 = newtonDown(0.2, Array(1,-2,3,-4), polynomial, diffPoly, 1E-8)
		val y1 = polynomial(x1, Array(1,-2,3,-4))
		println(s"x1 = $x1")
		println(s"y1 = $y1")
		readLine()
	}

	def polynomial(x: Double, coef: Array[Double]): Double = {
		(0 until coef.length).map(i => coef(i)*pow(x, i)).sum
	}

	def diffPoly(x: Double, coef: Array[Double]): Double = {
		(1 until coef.length).map(i => coef(i)*i*pow(x, i-1)).sum
	}

	def newtonDown(x: Double, coef: Array[Double],
		fn: (Double, Array[Double]) => Double,
		fp: (Double, Array[Double]) => Double,
		err: Double): Double = {
		if (abs(fn(x, coef)) < err) return x
		else {
			var lambda = 1.0
			var x1 = 1.0
			do {
				x1 = x - fn(x, coef) / fp(x, coef) * lambda
				lambda = lambda * 0.5
			} while (abs(fn(x1, coef)) >= abs(fn(x, coef)))
			newtonDown(x1, coef, fn, fp, err)			
		}
	}
}