Description: The module LSQ is for unconstrained linear least-squares fitting. It is
based upon Applied Statistics algorithm AS 274 (see comments at the start
of the module). A planar-rotation algorithm is used to update the QR-
factorization. This makes it suitable for updating regressions as more
data become available. The module contains a test for singularities which
is simpler and quicker than calculating the singular-value decomposition.
An important feature of the algorithm is that it does not square the condition
number. The matrix X X is not formed. Hence it is suitable for ill-
conditioned problems, such as fitting polynomials.
By taking advantage of the MODULE facility, it has been possible to remove
many of the arguments to routines. Apart from the new function VARPRD,
and a back-substitution routine BKSUB2 which it calls, the routines behave
as in AS 274.-The module is for unconstrained linear least-squares fitting. It is based upon Applied Statistics algorithm AS 274 (see comments at the start of the module). A planar - rotation algorithm is used to update the QR-factorization. This makes it suitable for updating regressions as more data become available. The module contains a test for singularities which is simpler and quicker than calculating the singular-value decomposition. An important feature of the algorithm is that it does not square the condition number. The matrix X X is not formed. Hence it is suitable for ill-conditioned problems, such as fitting Polynomials. By taking advantage of the MODULE facility, it has been possible to remove many of the arguments to routines. Apart from the new function VARPRD, and a back - substitution Platform: |
Size: 57867 |
Author:AiQing |
Hits:
Description: 这是我做的1.0版，对不懂VC的朋友本说，我没有提供实际使用的功能（尽管做出来很简单），本人的意思只是想提供做这种东西的一些思路。
在使用上，
1.必须将源码中利用SMPT发送密码的部分，改成你自己的邮箱，然后重新编译成可执行文件。
2.找到一台你入侵的主机（别问我怎样去占领一台肉鸡），将生成的QQ2002.exe放置于肉鸡上QQ所在的目录下，如可能是c:\\program files\\tencent。
3.创建QQ2002.exe的快捷方式，并改名为\"腾讯QQ\"。
4.将肉鸡上凡是有\"腾讯QQ\"快捷方式的地方用刚才创建的那个替换.
5.等着别人的密码发回来吧-This is what I do, Version 1.0, VC friends do not understand this, I have no practical use for the function (although to do it is very simple), I mean just want to do something to provide some ideas. The use of 1. Source code must be used nowadays is researched into this part of the password, change your own mail. then re-compiled executable file. 2. You find an invasion of Taiwan mainframe (Do not ask me how to occupy a broiler), will be generated QQ2002.exe placed on the broiler QQ on the directory, such as may be c : \\ program files \\ tencent. 3. QQ2002.exe create a shortcut, and renamed the "QQ." 4. Broiler anyone who would "QQ" expeditious manner with the creation of just the one substitution. 5. Waiting for the others Password made it back Platform: |
Size: 58878 |
Author:yang_mh |
Hits:
Description: The module LSQ is for unconstrained linear least-squares fitting. It is
based upon Applied Statistics algorithm AS 274 (see comments at the start
of the module). A planar-rotation algorithm is used to update the QR-
factorization. This makes it suitable for updating regressions as more
data become available. The module contains a test for singularities which
is simpler and quicker than calculating the singular-value decomposition.
An important feature of the algorithm is that it does not square the condition
number. The matrix X X is not formed. Hence it is suitable for ill-
conditioned problems, such as fitting polynomials.
By taking advantage of the MODULE facility, it has been possible to remove
many of the arguments to routines. Apart from the new function VARPRD,
and a back-substitution routine BKSUB2 which it calls, the routines behave
as in AS 274.-The module is for unconstrained linear least-squares fitting. It is based upon Applied Statistics algorithm AS 274 (see comments at the start of the module). A planar- rotation algorithm is used to update the QR-factorization. This makes it suitable for updating regressions as more data become available. The module contains a test for singularities which is simpler and quicker than calculating the singular-value decomposition. An important feature of the algorithm is that it does not square the condition number. The matrix X X is not formed. Hence it is suitable for ill-conditioned problems, such as fitting Polynomials. By taking advantage of the MODULE facility, it has been possible to remove many of the arguments to routines. Apart from the new function VARPRD, and a back- substitution Platform: |
Size: 57344 |
Author: |
Hits:
Description: 这是我做的1.0版，对不懂VC的朋友本说，我没有提供实际使用的功能（尽管做出来很简单），本人的意思只是想提供做这种东西的一些思路。
在使用上，
1.必须将源码中利用SMPT发送密码的部分，改成你自己的邮箱，然后重新编译成可执行文件。
2.找到一台你入侵的主机（别问我怎样去占领一台肉鸡），将生成的QQ2002.exe放置于肉鸡上QQ所在的目录下，如可能是c:\program files\tencent。
3.创建QQ2002.exe的快捷方式，并改名为"腾讯QQ"。
4.将肉鸡上凡是有"腾讯QQ"快捷方式的地方用刚才创建的那个替换.
5.等着别人的密码发回来吧-This is what I do, Version 1.0, VC friends do not understand this, I have no practical use for the function (although to do it is very simple), I mean just want to do something to provide some ideas. The use of 1. Source code must be used nowadays is researched into this part of the password, change your own mail. then re-compiled executable file. 2. You find an invasion of Taiwan mainframe (Do not ask me how to occupy a broiler), will be generated QQ2002.exe placed on the broiler QQ on the directory, such as may be c : \ program files \ tencent. 3. QQ2002.exe create a shortcut, and renamed the "QQ." 4. Broiler anyone who would "QQ" expeditious manner with the creation of just the one substitution. 5. Waiting for the others Password made it back Platform: |
Size: 58368 |
Author:yang_mh |
Hits:
Description: SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Fortran. The library routines will perform an LU decomposition with partial pivoting and triangular system solves through forward and back substitution. The LU factorization routines can handle non-square matrices but the triangular solves are performed only for square matrices. The matrix columns may be preordered (before factorization) either through library or user supplied routines. This preordering for sparsity is completely separate from the factorization. Working precision iterative refinement subroutines are provided for improved backward stability. Routines are also provided to equilibrate the system, estimate the condition number, calculate the relative backward error, and estimate error bounds for the refined solutions. -SuperLU is a general purpose library for the direct solution of large, sparse, nonsymmetric systems of linear equations on high performance machines. The library is written in C and is callable from either C or Platform: |
Size: 1955840 |
Author:anfangde |
Hits:
Description: Modify the Matlab Gauss Elimination routine given in lectures so that it
(a) performs implicit complete pivoting, and
(b) handles m right hand sides at once by performing an LU decomposition of the matrix A first and
then doing forward substitution and back substitution (hence not modifying the right hand side as the
elimination is perfomed).
Test your program and then run it on the system AX = B-Modify the Matlab Gauss Elimination routine given in lectures so that it (a) performs implicit complete pivoting, and (b) handles m right hand sides at once by performing an LU decomposition of the matrix A first and then doing forward substitution and back substitution ( hence not modifying the right hand side as the elimination is perfomed). Test your program and then run it on the system AX = B Platform: |
Size: 1024 |
Author:liuzhenghao |
Hits:
Description: Monochromatic (gray scale) low resolution image is converged to colored image by false color mapping to "hot" color scheme. This RGB image is then converted to Hue, Saturation and Value (HSV) image. Value component is replaced by higher resolution image and the resulting HSV image is converted back to RGB. This RGB merged image converted to gray scale is a merged image with improved spatial resolution. Platform: |
Size: 45056 |
Author:sofi |
Hits:
Description: 列主元素消去是由高斯消去法改进得到的求解线性方程组的方法，它是目前计算机上常用的解低阶稠密矩阵方程组的有效方法。列主元消去法就是在每次选主元时，仅依次按列选取绝对值最大的元素作为主元，且只交换两行，再进行消元计算。程序通过将矩阵元素赋给数组，再操作数组从而达到处理矩阵的目的。这样便可以将矩阵化为上三角形式，轻松地解出方程组的最后一组解。在计算出方程组最后一个解后，应用回代的方法，计算出方程组所有的解。-Out the main elements of cancellation is received by the Gaussian elimination method to improve the methods for solving linear equations, which is commonly used in computer solutions of low-density matrix equations of ways. Main-element elimination is the main element in every election, only the order of columns selected by the largest element in absolute value as the main element, and only the exchange of two lines, further elimination calculations. Program assigned by the matrix elements of the array, and then operating the array so as to achieve the purpose of dealing with matrices. This will be the matrix into upper triangular form, easily solved equations of the final group solution. Equations in the calculation of the final solution, the application of back substitution method to calculate all the solutions of equations. Platform: |
Size: 275456 |
Author:天云 |
Hits:
Description: Chapter 3. The Solution of Linear Systems AX = B
Algorithm 3.1 Back Substitution
Algorithm 3.2 Upper-Triangularization Followed by Back Substitution
Algorithm 3.3 PA = LU Factorization with Pivoting
Algorithm 3.4 Jacobi Iteration
Algorithm 3.5 Gauss-Seidel Iteration-Chapter 3. The Solution of Linear Systems AX = B
Algorithm 3.1 Back Substitution
Algorithm 3.2 Upper-Triangularization Followed by Back Substitution
Algorithm 3.3 PA = LU Factorization with Pivoting
Algorithm 3.4 Jacobi Iteration
Algorithm 3.5 Gauss-Seidel Iteration
Platform: |
Size: 19456 |
Author:Paola de Oliveira |
Hits:
Description: Solving an upper triangular system U x = b by back-substitution
Solving a lower triangular system L x = b by forward-substitution-backward substitution and forward substitution Platform: |
Size: 1024 |
Author:QuanyuZhao |
Hits:
Description: 对任意线性方程组AX=B，利用矩阵等价变换形成上三角矩阵，在利用高斯消元法中的回代过程简便的求解方程组AX=B的解。本程序是用MATLAB编写的，运行时只要输入矩阵A和B，即可得到方程的解。程序中有详细的注释，很好理解。本程序具有通用性。-For any system of linear equations AX = B, the use of equivalent transformation matrix to form the upper triangular matrix using Gaussian elimination in the back substitution process of solving simple equations AX = B solution. This procedure is used MATLAB, running as long as the input matrix A and B, can be obtained equations. Detailed program notes, well understood. The program is versatile. Platform: |
Size: 1024 |
Author:大象 |
Hits:
Description: 求解线性方程组，首先要确定方程式的个数，以及每个方程的系数，要求程序与用户交互，
在程序运行过程中，要求用户输入方程个数和方程中的系数，程序把系数存入系数矩阵中
运用消元法（高斯消元法）：1.将系数矩阵消为上三角2.回代求得方程组的解-Solving linear equations, we must first determine the number of equations, and the coefficients of each equation required procedures and user interaction,
The program is running, requires the user to enter the equation number and the coefficients of the equation, program coefficient deposited in the coefficient matrix
Use the elimination method (Gaussian elimination): an extinction coefficient matrix is upper triangular back substitution to obtain the solution of equations Platform: |
Size: 27648 |
Author:邹成睿 |
Hits:
Description: 豪斯霍尔德QR分解及回代MATLAB代码，并用该方法解决线性方程组的实例-Howard Hopper QR decomposition and back substitution de MATLAB code, and use this solution to an instance of linear equations Platform: |
Size: 2048 |
Author:王子涵 |
Hits:
Description: 中高斯消元法的基本思想是将线性方程组通过消元，逐步化为同解的三角形方程组，然后用回代法解出n个解-The basic idea of the Gaussian elimination method is to linear equations by elimination, and gradually turned into a triangle with the solution of equations, and then back substitution method for solving the n solutions Platform: |
Size: 1024 |
Author:李 |
Hits:
Description: Systems of linear equations
Our Matlab function for naive Gaussian
elimination looks like this:
function x = naiv_gauss(A,b)
n = length(b) x = zeros(n,1)
for k=1:n-1 forward elimination
for i=k+1:n
xmult = A(i,k)/A(k,k)
for j=k+1:n
A(i,j) = A(i,j)-xmult*A(k,j)
end
b(i) = b(i)-xmult*b(k)
end
end
back substitution
x(n) = b(n)/A(n,n)
for i=n-1:-1:1
sum = b(i)
for j=i+1:n
sum = sum-A(i,j)*x(j)
end
x(i) = sum/A(i,i)
end-Systems of linear equations
Our Matlab function for naive Gaussian
elimination looks like this:
function x = naiv_gauss(A,b)
n = length(b) x = zeros(n,1)
for k=1:n-1 forward elimination
for i=k+1:n
xmult = A(i,k)/A(k,k)
for j=k+1:n
A(i,j) = A(i,j)-xmult*A(k,j)
end
b(i) = b(i)-xmult*b(k)
end
end
back substitution
x(n) = b(n)/A(n,n)
for i=n-1:-1:1
sum = b(i)
for j=i+1:n
sum = sum-A(i,j)*x(j)
end
x(i) = sum/A(i,i)
end Platform: |
Size: 37888 |
Author:amine |
Hits:
Description: C and MATLAB implementation for LDPC encoding and decoding-Overview of what is provided
WiFi (IEEE 802.11n) LDPC code construction
Encoding by back-substitution for WiFi LDPC codes
Iterative belief propagation (BP) Decoding (including min-sum)
AWGN simulations for BPSK, 4-ASK, 8-ASK (equivalently QPSK, 16-QAM, and 64-QAM) Platform: |
Size: 321536 |
Author:上善若水 |
Hits:
Search - back substitution