搜索资源列表
EULERDemo
- /* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA I
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
caculateAmulBequalCC
- 计算这个智力题： 在这个乘法算式里，每一个字母代表着0-9中的一个数，不同字母代表不同数。 A B C D E F G H * A J --------------------- E J A H F D G K C B D F H A J E C --------------------- C C C C C C C C C 请问，C 代表哪个数字？-Calculation of the intellectual questions: In th
femod1
- FEMOD1 is an interactive program for the setup, solution, and printout of a two point boundary value problem in a one dimensional region. The finite element method is used. The differential equation has the form: -d/dX ( K(X) dU/dX ) + C(
Character-Frequency-Analysis-of-Bosnian
- In this project I chose Bosnian language to do the character frequency analysis. Bosnia and Herzegovina are the countries using Bosnian as their official language and more than 2.2 million people speak this language all around the world. It has 5
_fsimpfun@20_RK4fun@28
- 在vb/vc中调用mathlualib.dll中的自定义API计算一些泛函的值，如计算定积分∫[a->b]f(x)dx，计算数项级数∑[n=1->100]f(n)≈∑[n=1->+∞]f(n)，计算函数项级数∑[n=1->100]f(n,x)≈∑[n=1->+∞]f(n,x)，计算一阶ODEy =fsxy(x,y),y(x_0)=y_0中的y(x),……泛函的自变量在Lua文件里面输入。注意：请不要改变Lua中的函数名fun(x)，fan(n)，fsx(x)，fan
ARCH
- 利用有限元编写的拱结构的计算程序，能进行各种拱结构的内力分析计算。读入基本数据：NSX、NSP、NLO 分别为竖向、水平集中力和力偶个数；M 求内力截面个数（负表示作内力图）；IC 左半跨上（水平、竖向和力偶）集中力个数；F矢高；L跨度；Q 均布荷载值 A、B 均布荷载左端离左支座的距离和分布长度；R 圆拱半径，悬链线拱时为Qc/r；-Internal force analysis using the finite element written in the arch structure
Newton-Raphson-method
- fortran90/95格式，方便科学计算中调用，Newton-Raphson，可用来寻找线性/非线性方程f(x)=0的数值解。标准的数学表达式f(x)表示f是变量x的函数，其通常的表达形式为f(x,a,b,...)=0，f被定义为多于一个变量的函数。在这种情况下，Newton-Raphson算法试图把x以外的变量固定并作为参数，而寻找关于变量x的数值解。-fortran90/95 format, convenience called scientific computing, Newton-R
ASL-1.2
- 内点法求解线性和边界约束的凸二次规划，采用C++语言编程，程序很完善，代码比较多，各位看官好好研究-Solve an optimization problem with linear and bound constraints (BL) min f(x) subject to lo <= x <= hi, a x = b using the affine-scaling interior-point method presented in
erfenfa--bisect
- 这是二分法求非线性方程的根的程序，即若f(x)=0在[a,b]内有唯一实根且f(a)f(b)<0，求其根的程序。-This is the root of nonlinear equations dichotomy of program, that is, if f (x) = 0 in [a, b] there are the only real roots and f (a) f (b) < 0, find its root procedure.
Quadratic-Programming
- 功能：用拉格朗日方法求解等式约束二次规划：min f(x)=0.5*x Hx+c x,s.t.Ax=b 输入：H,c分别是目标函数的矩阵和向量，A,b分别是约束条件中的矩阵和向量 输出：（x,lam)是KT点，fval是最优值。-Function: Lagrangian method for solving equality constrained quadratic programming: min f (x) = 0.5* x Hx+ c x, s.t.Ax = b Input:
interpolation
- 定理1（介值定理）设函数f(x)在区间[a,b]连续，且f(a)f(b)<0，则方程f(x)=0在区间[a,b]内至少有一个根。(Theorem 1 (intermediate value theorem) set the function f (x) in the interval [a, b] continuous, and f (a) f (b) <0, then the equation f (x) =0 is at least one root in the interva