数值线性代数的Matlab应用程序包 共13个程序函数，每个程序函数有相应的例子函数一一对应，以*Example.m命名 程序名称 用途 Method 方法 GrmSch.m QR因子分解 classical Gram－Schmidt orthogonalization 格拉母－斯密特 MGrmSch.m QR因子分解 modified Gram－Schmidt iteration 修正格拉母－斯密特 householder.m QR因子分解 Householder 豪斯霍尔德QR因子分解 ZXEC.m 最小二乘拟合 polynomial interpolant 最小二乘插值多项式 NCLU.m LU因子分解 Gaussian elimination 不选主元素的高斯消元 PALU.m LU因子分解 partial pivoting Gaussian elimination 部分选主元的高斯消元 cholesky.m 楚因子分解 Cholesky Factorization 楚列斯基因子分解 PwItrt.m 求最大特征值 Power Iteration 幂迭代 Jacobi.m 求特征值 Jacobi iteration 按标准行方式次序的雅可比算法 Anld.m 求上Hessenberg Arnoldi Iteration 阿诺尔迪迭代 zuisu.m 解线性方程组 Steepest descent 最速下降法 CG.m 解线性方程组 Gradients 共轭梯度 BCG.m 解线性方程组 Biconjugate Gradients 双共轭梯度
上传时间： 2016-05-17
上传用户：小鹏
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
标签： combinatorial assignment problem arises
上传时间： 2014-01-19
上传用户：BIBI
密码学界牛人Victor Shoup用C++编写数论类库。 NTL is a high-performance, portable C++ library providing data structures and algorithms for arbitrary length integers for vectors, matrices, and polynomials over the integers and over finite fields and for arbitrary precision floating point arithmetic. NTL provides high quality implementations of state-of-the-art algorithms for: * arbitrary length integer arithmetic and arbitrary precision floating point arithmetic * polynomial arithmetic over the integers and finite fields including basic arithmetic, polynomial factorization, irreducibility testing, computation of minimal polynomials, traces, norms, and more * lattice basis reduction, including very robust and fast implementations of Schnorr-Euchner, block Korkin-Zolotarev reduction, and the new Schnorr-Horner pruning heuristic for block Korkin-Zolotarev * basic linear algebra over the integers, finite fields, and arbitrary precision floating point numbers.
标签： high-performance providing portable library
上传时间： 2014-01-04
上传用户：exxxds
Abstract - A fl exible multiscale and directional representation for images is proposed. The scheme combines directional fi lter banks with the Laplacian pyramid to provides a sparse representation for two- dimensional piecewise smooth signals resembling images. The underlying expansion is a frame and can be designed to be a tight frame. Pyramidal directional fi lter banks provide an effective method to implement the digital curvelet transform. The regularity issue of the iterated fi lters in the directional fi lter bank is examined.
标签： representation directional multiscale Abstract
上传时间： 2013-12-15
上传用户：zxc23456789
These codes require an ASCII input file interp.dat of the following form: N: Number of Polynomial Interpolation Points (Small) First Sample (x1,y1) Second Sample (x2,y2) ... Nth Sample (xN,yN) N1: Number of Error Evaluation Points (Large) First Sample (x1,y1) Second Sample (x2,y2) ... N1th Sample (xN1,yN1)
标签： Polynomia following require Number
上传时间： 2017-09-21
上传用户：许小华
The basic topic of this book is solving problems from system and control theory using convex optimization. We show that a wide variety of problems arising in system and control theory can be reduced to a handful of standard convex and quasiconvex optimization problems that involve matrix inequalities. For a few special cases there are “analytic solutions” to these problems, but our main point is that they can be solved numerically in all cases. These standard problems can be solved in polynomial- time (by, e.g., the ellipsoid algorithm of Shor, Nemirovskii, and Yudin), and so are tractable, at least in a theoretical sense. Recently developed interior-point methods for these standard problems have been found to be extremely efficient in practice. Therefore, we consider the original problems from system and control theory as solved.
标签： Linear_Matrix_Inequalities_in_Sys tem
上传时间： 2020-06-10
上传用户：shancjb
在半导体制冷技术的工作性能及其优缺点研究的基础上,设计了以单片机为核心控制元件,以TEC1-12706为执行元件的半导体制冷温度控制系统。采用高精度分段式PID控制算法配合PWM输出控制的方法实现温度控制;选择数字传感器DS18B20为温度检测元件,还包含1602液晶显示模块、按键调整输入模块和H桥驱动模块等。实际测试表明,该系统结构简单易行,操作方便,工作性能优良,同时针对该系统专门设计的温控算法,使半导体制冷器能更好地适应不同工况而充分发挥其制冷制热工作特性。Based on the study of the performance and advantages and disadvantages of thermoelectric cooler(TEC)technology,a thermoelectric cooling temperature control system with single-chip microcomputer as the core control element and TEC1-12706 as the executive element was designed. High precision piecewise PID control algorithm combined with PWM output control method is adopted to realize temperature control. The digital sensor DS18B20 is selected as the temperature detection element. It also includes 1602 LCD module,key adjustment input module and H bridge drive module. The actual test shows that the system has simple structure,convenient operation and excellent performance. Meanwhile,the temperature control algorithm specially designed for the system can make the semiconductor cooler better adapt to different working conditions and give full play to its refrigeration and heating characteristics.
上传时间： 2022-03-27
上传用户：
