QR方法求实系数多项式方程的全部根

This is an exememple of arithmetic coding

                                                  *     *   *   * *  *   *   *   *         *   *  *   *   *   *  *                    

1005: 最邻近点对 时间限制: 1 Sec 内存限制: 8 MB 提交次数: 6024 通过次数: 1804 提交 题目描述 要求用分治算法（O(nlogn)复杂度）实现寻找n个点中最邻近点对,输出最邻近距离的平方。其中0

矩阵运算的算法 用Type类数组创建矩阵对象 matrix(int rows,int cols) //创建矩阵,值为0 matrix(int n) //创建单位阵 matrix(const matrix &) //拷贝构造函数 BOOL Ismatrixf(){ return (rows==cols) } //判断矩阵是否为方阵 modifyrowscols(int rows,int cols) //修改矩阵的行列数 ~matrix() {delete []elems } //析构函数 -matrix algorithm with Type category created matrix array object matrix (int rows, int cols)// create matrix, value of 0 matrix (int n)// create units matrix array (const matrix

有关哈希表的程序-Procedures related to hash table

/****************************************************************************  NJU Magic.  Copyright (c) 2007.  All Rights Reserved.                -------------------------------------------------------------------- Permission to use, copy, or modify this software and its documentation for educational and research purposes only and without fee is hereby granted, provided that this copyright notice appear on all copies and supporting documentation.  For any other uses of this software, in original or modified form, i

使用模拟退火算法解0－1背包问题MATLAB源代码-using simulated annealing Xie 0-1 knapsack problem MATLAB source code

%  1-D信号压缩传感的实现(正交匹配追踪法Orthogonal Matching Pursuit) %  测量数M>=K*log(N/K),K是稀疏度,N信号长度,可以近乎完全重构 %  编程人--香港大学电子工程系 沙威  Email: wsha@eee.hku.hk %  参考文献：Joel A. Tropp and Anna C. Gilbert %  Signal Recovery From Random Measurements Via Orthogonal Matching %  Pursuit，IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 12, %  DECEMBER 2007.

自适应维纳滤波器函数及调用方法-adaptive Wiener filter function and call methods

经典算法应用： 遗传算法求函数最小的例子-Genetic algorithm for the smallest example of function