-
Simpleequationstoachieve
说明： 利用该方程组求解一般的线性方程组，别且符合数学求解原理(Using the equations of linear equations in general, do not and in accordance with principles of mathematics to solve)
- 2010-04-22 10:38:10下载
- 积分：1
-
hunhefahanshufa
罚函数法 它将有约束最优化问题转化为求解无约束最优化问题: 其中M为足够大的正数, 起"惩罚"作用, 称之为罚因子, F(x, M )称为罚函数.(hunhefahanshufa)
- 2020-12-02 01:49:27下载
- 积分：1
-
eptree112d
说明： 使用EPTREE可以很好的对，C,C++，Java代码进行解析。绘出函数树图，计算堆栈大小等。
<输出的文件内容>
功能树
INKURUDOFAIRUTSURI
测量若干步骤（有条件汇编）
函数索引（使用堆栈大小为每个功能输出）
使用类名单
全局变量，变结构，对象名单
＃定义定义列表
清单中所使用
列表名称
信息分布函数的行数(EPTREE can be used for good, C, C++, Java code analysis. Mapping function tree diagram, calculate the stack size. )
- 2008-10-14 23:15:43下载
- 积分：1
-
xiangguanfabianshi
利用M序列作输入估计脉冲响应值，完成对连续和离散系统传递函数参数的辨识(Use of M sequence as the input impulse response estimated value to complete the continuous and discrete transfer function parameter identification)
- 2011-05-03 21:46:23下载
- 积分：1
-
newmark-b
用matlab编写newmark-B法解结构振动微分方程的程序(Prepared using matlab newmark-B method for solving differential equations of structural vibration program)
- 2013-10-11 20:15:57下载
- 积分：1
-
线性代数同济第六版
说明： 线性代数同济第六版,最适用的一版,有书签(Linear algebra tongji sixth edition)
- 2021-01-20 09:08:48下载
- 积分：1
-
插值与函数逼近
说明： 分段三次Hermite插值法 样条插值 切比雪夫最佳一致逼近 Legendre、 Laguerre、Hermite多项式主函数 牛顿 插值(Piecewise cubic Hermite interpolation)
- 2020-10-05 17:35:23下载
- 积分：1
-
CodeFEAError-Estimators
Code source of Finite Element Analysis with Error Estimators
- 2021-05-12 19:30:03下载
- 积分：1
-
fft
信号提取，fft变换，模态分析，互相关分析(fft)
- 2020-06-29 10:00:02下载
- 积分：1
-
na7
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)
- 2011-11-27 11:47:21下载
- 积分：1
