当前位置:网站首页>Lagrange polynomial
Lagrange polynomial
2022-07-06 04:21:00 【Python ml】
#include <vector>
#include <iostream>
using namespace std;
void print(vector<double> s)
{
for(double x:s)
{
cout<<x<<" ";
}
cout<<endl;
}
vector<double> mul(vector<double> a,vector<double> b) // Polynomial multiplication
{
int n=a.size(), m=b.size();
vector<double> s(n+m-1,0);
for(int i=0;i<n;++i)
{
for(int j=0;j<m;++j)
{
s[i+j]+=a[i]*b[j];
}
}
return s;
}
vector<double> add(vector<double> a,vector<double> b)
{
int n=a.size(), m=b.size();
vector<double> s(max(n,m),0);
for(int i=0;i<n;++i){
s[i]+=a[i];
}
for(int i=0;i<m;++i){
s[i]+=b[i];
}
return s;
}
vector<double>Lagrange(vector<vector<double>> Point){
int n=Point.size()-1; // interpolation ans by n Power
if(n==-1){
cout<<" error "<<endl;
}
vector<double> ans(n,0);
for(int k=0;k<=n;++k)
{
double Poly_k_const=Point[k][1];
vector<double> Poly_k={
1};
for(int i=0;i<=n;++i)
{
if(i==k) continue;
Poly_k=mul(Poly_k,{
-Point[i][0],1}); // Molecular multiplication (x-Point[i][0])
Poly_k_const/=(Point[k][0]-Point[i][0]);
}
for(int i=0;i<Poly_k.size();++i){
Poly_k[i]*=Poly_k_const;
}
ans=add(ans,Poly_k);
}
return ans;
}
边栏推荐
- P3033 [usaco11nov]cow steelchase g (similar to minimum path coverage)
- Execution order of scripts bound to game objects
- About some basic DP -- those things about coins (the basic introduction of DP)
- HotSpot VM
- P3500 [poi2010]tes intelligence test (two points & offline)
- How to execute an SQL statement in MySQL
- 解决“C2001:常量中有换行符“编译问题
- 图应用详解
- coreldraw2022新版本新功能介绍cdr2022
- Le compte racine de la base de données MySQL ne peut pas se connecter à distance à la solution
猜你喜欢
Introduction to hashtable
Class A, B, C networks and subnet masks in IPv4
颠覆你的认知?get和post请求的本质
[PSO] Based on PSO particle swarm optimization, matlab simulation of the calculation of the lowest transportation cost of goods at material points, including transportation costs, agent conversion cos
Comprehensive ability evaluation system
Lombok原理和同时使⽤@Data和@Builder 的坑
10个 Istio 流量管理 最常用的例子,你知道几个?
JVM garbage collector concept
食品行业仓储条码管理系统解决方案
Jd.com 2: how to prevent oversold in the deduction process of commodity inventory?
随机推荐
【leetcode】22. bracket-generating
What is the difference between gateway address and IP address in tcp/ip protocol?
2328. Number of incremental paths in the grid graph (memory search)
IDEA编译JSP页面生成的class文件路径
Lambda expression learning
One question per day (Mathematics)
Global and Chinese markets for otolaryngology devices 2022-2028: Research Report on technology, participants, trends, market size and share
729. 我的日程安排表 I(set or 动态开点线段树)
我想问一下 按照现在mysql-cdc的设计,全量阶段,如果某一个chunk的binlog回填阶段,
BOM - location, history, pop-up box, timing
Stable Huawei micro certification, stable Huawei cloud database service practice
E. Best Pair
PTA tiantisai l1-078 teacher Ji's return (15 points) detailed explanation
How can programmers resist the "three poisons" of "greed, anger and ignorance"?
Yyds dry goods inventory web components series (VII) -- life cycle of custom components
Sentinel sliding window traffic statistics
MySql數據庫root賬戶無法遠程登陸解决辦法
2/13 qaq~~ greed + binary prefix sum + number theory (find the greatest common factor of multiple numbers)
拉格朗日插值法
VPP performance test