▍1. achol
用乔里斯基分解法求系数矩阵为对称正定右端为常向量的方程组(Demand coefficient matrix with the Cholesky decomposition method for symmetric positive definite the right end of the constant vector equations)
数值分析算法,该压缩包含有雅克比迭代算法、弦割法法及综合评测法等(Numerical analysis algorithms, the compression Jacobi iteration algorithm, France and France chord cutting and comprehensive evaluation method)
它是一个计算热通量的c++程序,用udf导入fluent,既可以求解,非常好用的一个,可以作为入门的一个例子学习。(it is a calculated heat flux of c++ program, with udf into fluent, not only can solve, very easy to use one, can be used as a case study entry.)
fortran编写的读取dxf程序,可读取圆,多线段,直线,点,块参照,文字的坐标高程信息(write by fortran ,it can read dxf program, can read a round, multi line, linear, point, block reference, the coordinates of elevation information text)
APRIORI ALGORITHM IMPLEMENTATION
四阶龙格库塔法,用C++编写,很有参考价值(Fourth-order Runge-Kutta method, written in C, a good reference)
C++的求阶乘的程序,对本科C++课程可能有些帮助(Factorial in C++ program, it maybe helpful for some C++ course)
恒温减压沸腾UDF,一个基于压力计算的水蒸发UDF程序,请大家探讨一下(boiling udf of costant T and decreasing P)
汽车油耗计算(C实现)对于家用经济型小轿车来说,统计油耗是经常做的一件事。本题目要求根据汽油单价、每次加油所用钱数,以及该次加的油所跑里程数计算出该车的百公里油耗,并进行保存,根据需要给出统计数据。(Vehicle fuel consumption calculation (C implementation) for the household economy cars, the fuel consumption statistics is often one of the things. The questions asked based on gasoline price, amount of money each fuel used, and the second oil added to calculate the mileage run car 100 km fuel consumption, and save, according to the need to give statistics.)
FFT A计权 倍频程分析 三分之一倍频程分析(F F T A w eight o c tave a n al o n e t hird o ctave)
poisson生成器,可以生成泊松分布的随机数,需要的就下载吧(poisson sasadas)
合肥工业大学数值分析(计算方法A)中高斯—塞德尔算法的实现(Gauss- Seidel Algorithm)
Orthogonal Polynomials Approximation 数值分析,计算正交基多项式的系数 (Given a function f and a set of m >0 distinct points . You are supposed to write a function to approximate f by an orthogonal polynomial using the exact function values at the given m points with a weight assigned to each point . The total error must be no larger than a given tolerance. Format of function int OPA( double (*f)(double t), int m, double x[], double w[], double c[], double*eps ) where the function pointer double (*f)(double t) defines the function f int m is the number of points double x[] contains points double w[] contains the values of a weight function at the given points x[] double c[] contains the coefficients of the approximation polynomial double*eps is passed into the function as the tolerance for the error, and is supposed to be returned as the value of error. The function OPA is supposed to return the degree of the approximation polynomial. Note: a constant Max_n is defined so that if the total error is still not small enough when n = Ma)
用幂法反幂法求解方阵的最大最小特征值及其特征向量,C语言程序,基本的数值计算算法(power method and inverse power method)
素性检测的miller-rabin算法。。。。。(Primality testing)
DFP法求优化问题的C++源代码,经测试,该程序运行正常,得到了预期的结果。(DFP method for the optimization of C++ source code, tested, the program works correctly to get the desired results.)
MFC编写的计算器,基本功能都已实现,加速键没有实现(Written in MFC calculator, basic functions have been achieved, not achieved accelerator)