搜索资源列表
Douglas-PeuckerLineApproximationAlgorithm
- When working with mathematical simulations or engineering problems, it is not unusual to handle curves that contains thousands of points. Usually, displaying all the points is not useful, a number of them will be rendered on the same pixel since the
CoinUtils-2.2.5
- The CoinUtils project is a collection of open-source utilities developed and used by a variety of other projects in the COIN-OR repository. The project includes classes for storing and manipulating sparse matrices and vectors, performing matrix facto
scientificcalculator
- 具有一定容错功能的科学性计算器，具有算法的优先级-Has certain fault tolerance scientific calculator, with a priority algorithm
_brmul@24_brinv@8_bsdet@8
- 调用mathlib52.dll中的自定义API写的任意阶矩阵计算器，目前支持实矩阵相乘，求逆阵，求行列式的值3个功能，用户界面较友好，具有一定的容错能力。-Call mathlib52.dll custom API to write in any order matrix calculator now supports real matrices, inverse matrix, determinant of the value of the three demand functions, th
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 poin
solver.tar
- Calculates x such that ln(x) = x/5 using the method of false position and secant method. Reads the initial guesses, required tolerance and allows the user to choose between the method of false position and the secant method.
tiankou
- 田口算法运用于公差优化里面，方便大家学习与应用。-Taguchi algorithm applied to tolerance optimization inside, facilitate learning and application.
LSQR-NNL
- 可用于求解超大规模线性方程组非负解的MATLAB函数-Given a tall full-rank matrix A, solves the nonnegative least squares problem: min ||Ax-b|| s.t. x>= 0 and returns the minimizer x. The argument err is the tolerance used in testing for zeros
cuckoo
- A new metaheuristic optimization algorithm, called Cuckoo Search (CS), is fully implemented, and the vectorized version is given here. This code demonstrates how CS works for unconstrained optimization, which can easily be extended to solve various g
3_1-D_CFD_scheme_ver2.zip
- The solver was mdae to solve the teat tansfrer fields with cooling and hot zone. The Gauss-seidial, ADI, Laasonnen, and Crank-Nicolson schemes are present in the code. You can handle the method you want, iteration and the level of tolerance. The code