当前位置:网站首页>牛顿迭代法(解非线性方程)
牛顿迭代法(解非线性方程)
2022-07-05 08:46:00 【行止AC】
原理
对于已知的方程f(x),当f’(x)=n,化为f(x)-n=0;
题目
#include<bits/stdc++.h>
#define ll long long
#define PI 3.141592653589793
#define E 2.718281828459045
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memset(a,b,sizeof(a))
#define FOR( i , a , b ) for ( int i = a ; i <= b ; ++ i )
#define FO( i , n ) for ( int i = 0 ; i < n ; ++ i )
#define lowbit(a) ((a)&-(a))
#define PII pair<ll ,ll >
#define ft first
#define sd second
#define endl "\n"
typedef unsigned long long ull;
const ll mod=10007;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll Max=1e5+10;
using namespace std;
ll t,n,m,l,k;
ll ans;
/*queue<ll> q; stack<ll> s; //升序队列 priority_queue <int,vector<int>,greater<int> > q; //降序队列 priority_queue <int,vector<int>,less<int> >q;*/
double solve(double w)
{
double w1=w;
for(ll i=1;i<=100;i++)
{
w1=w1-(w1*w1*w1-w)/(3*w1*w1);
}
return w1;
}
int main()
{
ios::sync_with_stdio(false);
double n;
cin>>n;
cout<<fixed<< setprecision(6)<<solve(n)<<endl;
return 0;
}
边栏推荐
- Several problems to be considered and solved in the design of multi tenant architecture
- Basic number theory - factors
- 多元线性回归(梯度下降法)
- Warning: retrying occurs during PIP installation
- My experience from technology to product manager
- Array, date, string object method
- Programming implementation of ROS learning 2 publisher node
- [matlab] matlab reads and writes Excel
- JS asynchronous error handling
- C# LINQ源码分析之Count
猜你喜欢
How apaas is applied in different organizational structures
Pytorch entry record
Programming implementation of ROS learning 6 -service node
Business modeling of software model | overview
Programming implementation of ROS learning 2 publisher node
C# LINQ源码分析之Count
Hello everyone, welcome to my CSDN blog!
[Niuke brush questions day4] jz55 depth of binary tree
Add discount recharge and discount shadow ticket plug-ins to the resource realization applet
Redis实现高性能的全文搜索引擎---RediSearch
随机推荐
LLVM之父Chris Lattner:为什么我们要重建AI基础设施软件
猜谜语啦(11)
EA introduction notes
Business modeling | process of software model
Halcon shape_ trans
Business modeling of software model | stakeholders
特征工程
[daiy4] copy of JZ35 complex linked list
Halcon color recognition_ fuses. hdev:classify fuses by color
图解网络:什么是网关负载均衡协议GLBP?
[牛客网刷题 Day4] JZ35 复杂链表的复制
Digital analog 1: linear programming
Several problems to be considered and solved in the design of multi tenant architecture
c#比较两张图像的差异
猜谜语啦(9)
Wechat H5 official account to get openid climbing account
Multiple linear regression (sklearn method)
golang 基础 ——map、数组、切片 存放不同类型的数据
MPSoC QSPI Flash 升级办法
Classification of plastic surgery: short in long long long