数值分析课程设计报告书
Ⅰ 求数值分析课程设计请发邮箱[email protected]
c语言的？
Ⅱ 你好，能帮我解决一个数值分析的课程设计么。谢谢了
幂法是求最大特征值的吧
你这个得用反幂法的
Ⅲ 数值分析课程设计，编制一般迭代法、牛顿法、弦截法求解方程组的计算机程序，并分析它们的特点
C++才是主流语言。。
你是建模用的吗？那可根据语法稍加修改，这个编程实现的难度不大。
#include <iostream>//弦截法
using namespace std;
static int count=1;
double f(double x)
{
return (x*x*x-x-1);
}
int main()
{
double x0,x1,x2;
double e=0.00001;
cout<<"请输入两个初值X0，X1"<<endl;
cin>>x0>>x1;
x2=x1-f(x1)*(x1-x0)/(f(x1)-f(x0));
while(x2-x1>e||x1-x2>e)
{
x0=x1;
x1=x2;
x2=x1-f(x1)*(x1-x0)/(f(x1)-f(x0));
count+=1;
}
cout<<"方程的根为："<<x2<<endl;
cout<<"迭代的次数为："<<count<<endl;
return 0;
}
#include<iostream>//简单迭代法
#include<math.h>
using namespace std;
double f(double t0)
{ double t=t0+1;
return pow(t,1.0/3);
}
int main()
{
double a,b,x0,x1,e;
static int count=1;
cout<<"请输入A，B的值"<<endl;
cin>>a>>b;
cout<<"请输入E的值"<<endl;
cin>>e;
x0=(a+b)/2;
x1=f(x0);
while((x1-x0)>e||(x0-x1)>e)
{
count+=1;
x0=x1;
x1=f(x0);
}
cout<<"方程的根为："<<x1<<endl;
cout<<"迭代次数"<<count<<endl;
return 0;
}
#include <iostream>//牛顿迭代法
using namespace std;
static k=0;
static int count=1;
double newt(double x)
{
return (x*x*x-x-1);
}
int main()
{
double x0,x1,x2;
cout<<"请输入两个初值X0，X1"<<endl;
cin>>x0>>x1;
x2=x1-f(x1)*(x1-x0)/(f(x1)-f(x0));
while(x2-x1>e||x1-x2>e)
{
x0=x1;
x1=x2;
x2=x1-f(x1)*(x1-x0)/(f(x1)-f(x0));
count+=1;
}
cout<<"方程的根为："<<x2<<endl;
cout<<"迭代的次数为："<<count<<endl;
return 0;
}
牛顿迭代法是求方程根的重要方法之一，，方法使用函数f(x)的泰勒级数的前面几项来寻找方程f(x) = 0的根。其最大优点是在方程f(x) = 0的单根附近具有平方收敛，而且该法还可以用来求方程的重根、复根。另外该方法广泛用于计算机编程中。
简单迭代法又称逐次迭代法，基本思想是构造不动点方程，以求得近似根。即由方程f(x)=0变换为x=F(x), 然后建立迭代格式
弦截法计算x(k+1)时需要利用前两步信息x(k),x(k-1).免去了Newton法中需要求解一阶导函数的繁琐.
但收敛速度比牛顿法要慢
Ⅳ 用vb做数值分析课程设计
这口气太狂了，你就一个要代码的，跟要饭的没啥两样，狂啥？
Ⅳ 数值分析课程设计报告列主元消去发求矩阵行列式的值 及求解线性方程组
你好！具体功能要求发一下，可以尝试完成
Ⅵ 数值分析课程设计利用多项式拟合和指数函数拟合题
这种东西也拿出来，还只给30分。太不地道了
Ⅶ 课程设计（论文）任务书 脉冲激光放大器增益特性数值分析
参考《激光原理》197页
Ⅷ 跪求《数值分析》方面的论文或研究报告
1. James W. Cooley and John W. Tukey, "An algorithm for the machine
calculation of complex Fourier series," Mathematics of Computation 19
(1965), 297-301.
2. R. Courant, K. O. Friedrichs and H. Lewy, "Ueber die partiellen
Differenzengleichungen der mathematischen Physik," Mathematische Annalen
100 (1928), 32-74. Translated as: "On the partial difference equations of
mathematical physics," IBM Journal of Resarch and Development 11 (1967),
215-234.
3. A. S. Householder, "Unitary triangularization of a nonsymmetric matrix,"
Journal of the Association of Computing Machinery 5 (1958), 339-342.
4. C. F. Curtiss and J. O. Hirschfelder, "Integration of stiff equations,"
Proceedings of the National Academy of Sciences 38 (1952), 235-243.
5. C. de Boor, "On calculating with B-splines," Journal of Approximation
Theory 6 (1972), 50-62.
6. R. Courant, "Variational methods for the solution of problems of
equilibrium and vibrations," Bulletin of the American Mathematical Society
49 (1943), 1-23.
7. G. Golub and W. Kahan, "Calculating the singular values and pseudo-inverse
of a matrix," SIAM Journal on Numerical Analysis 2 (1965), 205-224.
8. A. Brandt, "Multi-level adaptive solutions to boundary-value problems,"
Mathematics of Computation 31 (1977), 333-390.
9. Magnus R. Hestenes and Eard Stiefel, "Methods of conjugate gradients for
solving linear systems," Journal of Research of the National Bureau of
Standards 49 (1952), 409-436.
10. R. Fletcher and M. J. D. Powell, "A rapidly convergent descent method for
minimization," Computer Journal 6 (1963), 163-168.
11. G. Wanner, E. Hairer and S. P. Norsett, "Order stars and stability
theorems," BIT 18 (1974), 475-489.
12. N. Karmarkar, "A new polynomial-time algorithm for linear programming,"
Combinatorica 4 (1984), 373-395.
13. L. Greengard and V. Rokhlin, "A fast algorithm for particle simulations,"
Journal of Computational Physics 72 (1987), 325-348.