Algorithm List Page 739

Algorithm list

Sort by ：

« 1 2 ... .34 .35 .36 .37 .38 739.40 .41 .42 .43 .44 ... 3400 »

RQ Downloaded：0: The use of Excel in Operations Research (using Excel to solve the problems of linear programming, dynamic programming, queuing theory, etc.)
Update : 2024-10-04 Size : 825kb Publisher : 刘妍
cloud-model Downloaded：0: 逆向云代码1 clear all close all X1=[0.4 0.6 0.7 0.1 0.3 0.8] Y1=[0.765 0.765 0.529 0.059 0.47 0.412] m=6 Ex=0.5 En1=zeros(1,m) for i=1:m
Update : 2024-10-04 Size : 19kb Publisher : 刘文
orthofit Downloaded：0: ORTHOFIT Fit polynomial to data. YS = ORTHOFIT(X,Y,N) smooths/fits data Y(X) in a least-squares sense using a polynomial of degree N and returns the smoothed data YS.
Update : 2024-10-04 Size : 2kb Publisher : ddz
smoothn Downloaded：0: SMOOTHN Robust spline smoothing for 1-D to N-D data. SMOOTHN provides a fast, automatized and robust discretized spline smoothing for data of arbitrary dimension.
Update : 2024-10-04 Size : 8kb Publisher : ddz
LineCurvature2D Downloaded：1: This function calculates the curvature of a 2D line. It first fits polygons to the points. Then calculates the analytical curvature from the polygons
Update : 2024-10-04 Size : 1kb Publisher : ddz
filtlan120507 Downloaded：0: Filtered Lanczos Iteration for solving linear equations
Update : 2024-10-04 Size : 286kb Publisher : S.C. Deng
ITSOL_2.tar Downloaded：0: ITSOL is a library of ietrative solvers, and it includes ILUK,ILUT and ARMS, etc.
Update : 2024-10-04 Size : 450kb Publisher : S.C. Deng
ZITSOL_1.tar Downloaded：0: ZITSOL 16:37 complex version of ITSOL
Update : 2024-10-04 Size : 210kb Publisher : S.C. Deng
knn.tar Downloaded：0: KNNis is a fast algorithm for computing K-nearest neighbors graphs
Update : 2024-10-04 Size : 1.69mb Publisher : S.C. Deng
elbeem-src-051204 Downloaded：0: Multiphase flow dynamics code by Lattice Boltzmann Method, developed using C language
Update : 2024-10-04 Size : 256kb Publisher : S.C. Deng
sunlightlb-1.1.tar Downloaded：0: multiphase Lattice Boltzmann Method program with C
Update : 2024-10-04 Size : 68kb Publisher : S.C. Deng
Quadratic-Programming Downloaded：0: Function: Lagrangian method for solving equality constrained quadratic programming: min f (x) = 0.5* x Hx+ c x, s.t.Ax = b Input: H, c are the matrix and vector objective function, A, b are the constraints in the matrice
Update : 2024-10-04 Size : 2kb Publisher : Aira.W

« 1 2 ... .34 .35 .36 .37 .38 739.40 .41 .42 .43 .44 ... 3400 »

Search in result