这大概是我继Java、JavaScript、C++以后第四次写多项式计算
先定义term
struct term {
var coe: Double
var exp: Double
init(coe: Double, exp: Double) {
self.coe = coe;
self.exp = exp;
}
}
用一个数组 [term] 表示一个多项式
现在来重载 + 和 * 运算符
func + (a:[term], b:[term]) -> [term] {
var res = a
for i in 0..<b.count {
var flag:Bool = true
for j in 0..<res.count {
if b[i].exp == res[j].exp {
res[j].coe += b[i].coe
flag = false
}
}
if flag {
res.append(term(coe:b[i].coe, exp:b[i].exp))
}
}
res.sort() { $0.exp > $1.exp }
return res
}
func * (a:[term], b:[term]) -> [term] {
var res:[term] = []
for i in 0..<a.count {
for j in 0..<b.count {
let new_coe:Double = a[i].coe * b[j].coe
let new_exp:Double = a[i].exp + b[j].exp
var flag:Bool = true
for k in 0..<res.count {
if res[k].exp == new_exp {
res[k].coe += new_coe
flag = false
}
}
if flag {
res.append(term(coe:new_coe, exp:new_exp))
}
}
}
res.sort() { $0.exp > $1.exp }
return res
}
然后写求值
func evaluated(poly:[term], x:Double) -> Double {
var res = 0.0
for i in 0..<poly.count {
let coe = poly[i].coe
let exp = poly[i].exp
let tmp = coe * pow(x, exp)
res += tmp
}
return res
}
打印函数
func print_poly(res: [term]) {
for i in 0..<res.count {
let coe = (i == 0) ? String(format: "%.10e", res[i].coe) : String(format: "%.10e", abs(res[i].coe))
let exp = Int(res[i].exp)
switch exp {
case 0: print("\(coe)", terminator: "")
case 1: print("\(coe) x", terminator: "")
default: print("\(coe) x^\(exp)", terminator: "")
}
if i == res.count - 1 {
break;
}
if res[i + 1].coe >= 0.0 {
print(" + ", terminator: "")
} else {
print(" - ", terminator:"")
}
}
print("")
}
现在可以来写拉格朗日插值了(第一个是求多项式,第二个是求值)
func lagran(X:[Double], Y:[Double]) -> [term] {
var res:[term] = []
for i in 0..<X.count {
var tmp:[term] = [term(coe:Y[i], exp:0)]
for j in 0..<X.count {
if i != j {
let poly:[term] = [term(coe:1, exp:1), term(coe:X[j], exp:0)]
tmp = tmp * poly
for k in 0..<tmp.count {
tmp[k].coe /= (X[i] - X[j])
}
}
}
res = res + tmp
}
return res
}
func lagrange(X: [Double], Y: [Double], x: Double) -> Double {
var result = 0.0
for i in 0..<X.count {
var temp = Y[i]
for j in 0..<X.count {
if i != j {
temp *= (x - X[j])
temp /= (X[i] - X[j])
}
}
result += temp
}
return result
}
然后简单求一下误差
func deviation(min:Double, max:Double, points:Int, lag:[term]) -> Double {
let increments = (max - min) / Double(points - 1)
var _x:[Double] = []
var res1:[Double] = []
for i in 0..<points {
let tmpx = min + Double(i) * increments
_x.append(tmpx)
res1.append(evaluated(poly:lag, x:tmpx))
}
let res2 = function(X:_x)
var delta:Double = 0;
for i in 0..<points {
delta += abs(res1[i] - res2[i])
}
delta /= Double(points)
return delta
}
完整代码:
import Foundation
struct term {
var coe: Double
var exp: Double
init(coe: Double, exp: Double) {
self.coe = coe;
self.exp = exp;
}
}
func + (a:[term], b:[term]) -> [term] {
var res = a
for i in 0..<b.count {
var flag:Bool = true
for j in 0..<res.count {
if b[i].exp == res[j].exp {
res[j].coe += b[i].coe
flag = false
}
}
if flag {
res.append(term(coe:b[i].coe, exp:b[i].exp))
}
}
res.sort() { $0.exp > $1.exp }
return res
}
func * (a:[term], b:[term]) -> [term] {
var res:[term] = []
for i in 0..<a.count {
for j in 0..<b.count {
let new_coe:Double = a[i].coe * b[j].coe
let new_exp:Double = a[i].exp + b[j].exp
var flag:Bool = true
for k in 0..<res.count {
if res[k].exp == new_exp {
res[k].coe += new_coe
flag = false
}
}
if flag {
res.append(term(coe:new_coe, exp:new_exp))
}
}
}
res.sort() { $0.exp > $1.exp }
return res
}
func evaluated(poly:[term], x:Double) -> Double {
var res = 0.0
for i in 0..<poly.count {
let coe = poly[i].coe
let exp = poly[i].exp
let tmp = coe * pow(x, exp)
res += tmp
}
return res
}
func lagran(X:[Double], Y:[Double]) -> [term] {
var res:[term] = []
for i in 0..<X.count {
var tmp:[term] = [term(coe:Y[i], exp:0)]
for j in 0..<X.count {
if i != j {
let poly:[term] = [term(coe:1, exp:1), term(coe:X[j], exp:0)]
tmp = tmp * poly
for k in 0..<tmp.count {
tmp[k].coe /= (X[i] - X[j])
}
}
}
res = res + tmp
}
return res
}
func lagrange(X: [Double], Y: [Double], x: Double) -> Double {
var result = 0.0
for i in 0..<X.count {
var temp = Y[i]
for j in 0..<X.count {
if i != j {
temp *= (x - X[j])
temp /= (X[i] - X[j])
}
}
result += temp
}
return result
}
func print_poly(res: [term]) {
for i in 0..<res.count {
let coe = (i == 0) ? String(format: "%.10e", res[i].coe) : String(format: "%.10e", abs(res[i].coe))
let exp = Int(res[i].exp)
switch exp {
case 0: print("\(coe)", terminator: "")
case 1: print("\(coe) x", terminator: "")
default: print("\(coe) x^\(exp)", terminator: "")
}
if i == res.count - 1 {
break;
}
if res[i + 1].coe >= 0.0 {
print(" + ", terminator: "")
} else {
print(" - ", terminator:"")
}
}
print("")
}
func function(X:[Double]) -> [Double] {
var Y = [Double](repeating: 0, count: X.count)
for i in 0..<X.count {
Y[i] = 1.0 / (1 + X[i] * X[i])
}
return Y
}
func deviation(min:Double, max:Double, points:Int, lag:[term]) -> Double {
let increments = (max - min) / Double(points - 1)
var _x:[Double] = []
var res1:[Double] = []
for i in 0..<points {
let tmpx = min + Double(i) * increments
_x.append(tmpx)
res1.append(evaluated(poly:lag, x:tmpx))
}
let res2 = function(X:_x)
var delta:Double = 0;
for i in 0..<points {
delta += abs(res1[i] - res2[i])
}
delta /= Double(points)
return delta
}
var X:[Double] = [-5, -4, -3, -2, -1, 0, 1, 2, 3, 4, 5]
var Y:[Double] = function(X:X)
var res = lagran(X:X, Y:Y)
print_poly(res:res)
print(deviation(min:-5, max:5, points:101, lag:res))
输出:
-2.2624434389e-05 x^10 + 1.5252548751e-19 x^9 + 1.2669683258e-03 x^8 + 1.2327293998e-17 x^7 - 2.4411764706e-02 x^6 - 1.0038526271e-16 x^5 + 1.9737556561e-01 x^4 + 1.2603850255e-18 x^3 - 6.7420814480e-01 x^2 + 1.4776997985e-16 x + 1.0000000000e+00