-
librec
推荐系统的类库，实现了大部分的推荐算法，大家可以在此基础上进一步实现自己的优化算法。
- 2022-02-04 09:57:52下载
- 积分：1
-
常用算法的C程序。主要内容包括多项式的计算、复数运算、随机数的产生、矩阵运算、矩阵特征值与特征向量的计算、线性代数方程组的求解、非线性方程与方程组的求解、插值与
常用算法的C程序。主要内容包括多项式的计算、复数运算、随机数的产生、矩阵运算、矩阵特征值与特征向量的计算、线性代数方程组的求解、非线性方程与方程组的求解、插值与逼近、数值积分、常微分方程组的求解、数据处理、极值问题的求解、数学变换与滤波、特殊函数的计算、排序和查找。-Commonly used algorithm of C procedures. Include polynomial terms, complex computation, random number generation, matrix operations, matrix eigenvalue and eigenvector calculations, linear algebra equations, nonlinear equations with the equations, interpolation and approximation, numerical integration, solving ordinary differential equations, data processing, for solving extremum problems, mathematical transformation and filtering, the calculation of special functions, sorting and search.
- 2022-02-22 07:35:43下载
- 积分：1
-
this document for the simulation of MIMO
此文件用于仿真MIMO-STBC 系统性能程序，包括了发送，mimo quasi-static channel 和接收部分。用的是8psk调制
-this document for the simulation of MIMO- STBC system performance procedures, including sending, mimo quasi--static channel and receive part. The modulation of eight psk
- 2022-03-18 07:05:49下载
- 积分：1
-
writing mathematical function call library, LU decomposition, high Shisaideer it...
自编数学函数调用库，有LU分解法，高斯塞德尔迭代法，追赶法解线性方程组，还有一维和二维的高斯积分公式-writing mathematical function call library, LU decomposition, high Shisaideer iterative method, catching up with the method for solving linear equations, one-and two-dimensional Gaussian integral formula
- 2023-08-06 04:30:03下载
- 积分：1
-
误差分析的方法有多种，例如，威点逊（J. H. Wilkison）针对的计算机的浮点运算提出的“向后误差分析”，这是一种先验估计误差的方法，较以往的“向前误差分...
误差分析的方法有多种，例如，威点逊（J. H. Wilkison）针对的计算机的浮点运算提出的“向后误差分析”，这是一种先验估计误差的方法，较以往的“向前误差分析”在矩阵运算的舍入误差估计上有较好的结果，以而使矩阵的误差分析获得了突破性的进展，使不少用向前误差分析难于判定可靠性的数值方法获得新的进展。-error analysis by a number of means, for example, Granville point Morrison (J. H. Wilkison), referring to a computer"s floating-point operations "backward error analysis," This is a priori estimation error method, compared to the previous "Forward Error Analysis" in the matrix computation Rounding error a better estimate on the results of a matrix so the error analysis of a breakthrough in the progress, many with forward error analysis difficult to determine the reliability of numerical methods to achieve new progress.
- 2022-06-15 17:59:56下载
- 积分：1
-
c语言实现图案绘制
算例1使用图形学算法在屏幕上画出一个圆，运行结果如附图1.
运行本程序后，先要求用户输入要画圆的圆心坐标、半径等数据，然后清屏并按照用户给出数据画出一个圆。
知识点：Turbo C的图形方式编程、画圆算法等；
算例2：实现屏幕画线和画矩形的程序，运行效果见附图2.
运行本程序后在屏幕上显示256色的套接矩形框。
知识点：DOS中断调用以及怎样直接写视频缓冲区；
算例3：使用BIOS中断INT 10H的功能随机生成图案，运行效果附图3.
程序执行后将在屏幕上随机生成颜色并进行填充，本例中随机颜色的初始值选择比较偏近于蓝色调，也可以自行设ing。
算例4：实现了图形的旋转、平移和缩放，运行效果如附图4.
- 2022-04-28 10:45:57下载
- 积分：1
-
计算方法上机列主消元
计算方法上机列主消元-calculation on the plane out the main elimination
- 2022-01-26 01:31:40下载
- 积分：1
-
球散射程序和表
sphere scattering program and statment
- 2022-04-21 18:55:07下载
- 积分：1
-
用于多个离散点拟合光滑曲线的，优化了追赶法，这个例子适用于闭合和不闭合两种情况。当时由于工程情况，写的急，代码不好看，但是很好用。为了方便传递参数，我做了一个链...
用于多个离散点拟合光滑曲线的，优化了追赶法，这个例子适用于闭合和不闭合两种情况。当时由于工程情况，写的急，代码不好看，但是很好用。为了方便传递参数，我做了一个链表，用时候根据自己情况可以修改，核心算法不动即可。-point for a number of discrete smooth curve fitting, and optimized to catch up with the law applicable to this case is not closed and the closure of two. At that time, because the situation, was the most aggressive, the code does not look good, but good use. To facilitate the transmission parameters, I have done a linked list, when used according to its own circumstances can change, the core algorithm can be fixed.
- 2022-03-17 18:50:28下载
- 积分：1
-
0 / 1背包问题是一个N P
0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.
- 2022-02-26 09:06:08下载
- 积分：1
