Location:
Search - gaussian row
Search list
Description: 2． Using Gaussian elimination method and Gaussian elimination method with row scaled method to solve the following tri-diagonal system
for n=10 and 100
Platform: |
Size: 78780 |
Author: 吕鹏 |
Hits:
Description: Using Gaussian elimination to solve linear equations.
// In this version, we allow matrix of any size. This is done by treating
// the name of a 2-dimensional array as pointer to the beginning of the
// array. This makes use of the fact that arrays in C are stored in
// row-major order.
Platform: |
Size: 1526 |
Author: 张琦 |
Hits:
Description: 2． Using Gaussian elimination method and Gaussian elimination method with row scaled method to solve the following tri-diagonal system
for n=10 and 100
-2. Using Gaussian elimination method and Gaussian elimination method with row scaled method to solve the following tri-diagonal system for n = 10 and 100
Platform: |
Size: 78848 |
Author: 吕鹏 |
Hits:
Description: Using Gaussian elimination to solve linear equations.
// In this version, we allow matrix of any size. This is done by treating
// the name of a 2-dimensional array as pointer to the beginning of the
// array. This makes use of the fact that arrays in C are stored in
// row-major order.
Platform: |
Size: 1024 |
Author: 张琦 |
Hits:
Description: 八皇后问题是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。
高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。
对于八皇后问题的实现，如果结合动态的图形演示，则可以使算法的描述更形象、更生动，使教学能产生良好的效果。-8 Queen s problem is an old and well-known problem is a typical example of backtracking algorithms. The problem is that the nineteenth century, the famous mathematician Gauss in 1850: Under the 8X8 grid on the display of the chess Queen eight, making it unable to attack each other, that is, any two can not be Queen s in the same line, the same row or the same slash on how many kinds of facing law.
Gaussian 76 program that. In Berlin in 1854 different chess magazines published author of 40 different types of solution, then using graph theory was the method to solve the 92 kinds of results.
8 Queen s problem for the realization, if the combination of dynamic graphics presentation, you can make the image description algorithm, more vivid, so that teaching can have a very positive impact.
Platform: |
Size: 752640 |
Author: 楼昊 |
Hits:
Description: LU分解在本质上是高斯消元法的一种表达形式。实质上是将A通过初等行变换变成一个上三角矩阵，其变换矩阵就是一个单位下三角矩阵。这正是所谓的杜尔里特算法（Doolittle algorithm）：从下至上地对矩阵A做初等行变换，将对角线左下方的元素变成零，然后再证明这些行变换的效果等同于左乘一系列单位下三角矩阵，这一系列单位下三角矩阵的乘积的逆就是L矩阵，它也是一个单位下三角矩阵。
这类算法的复杂度一般在左右，对充分消元的分解则不然。
-LU decomposition is essentially a Gaussian elimination method expression. A substance is through the primary transformation into an upper triangular matrix, the transformation matrix is a unit lower triangular matrix. This is the so-called Duerlite algorithms (Doolittle algorithm): from the bottom row of the matrix A do elementary transformation, the diagonal elements into the bottom left of zero, and then show the effect of these lines is equivalent to transform the left by a unit lower triangular matrix, this series of unit lower triangular matrix inverse is the product of L matrices, it is also a unit lower triangular matrix. The complexity of these algorithms is generally about the full elimination of the decomposition is not.
Platform: |
Size: 1024 |
Author: 王伟 |
Hits:
Description: bool lu(double *a, int *pivot, int n)；矩阵的LU分解。
假设数组an*n在内存中按行优先次序存放，此函数使用高斯列选主元消去法，将其就地进行LU分解。pivot为输出函数.pivot[0,n)中存放主元的位置排列.
函数成功时返回false，否则返回true.
bool guass(double const *lu, int const *p, double *b, int n) 求线性方程组的解。
假设矩阵lum*n为某个矩阵an*n的LU分解，在内存中按行优先次序存放。p[0,n)为LU分解的主元排列。b为方程组Ax=b的右端向量。此函数计算方程组Ax=b的解，并将结果存放在数组b[0,n)中。
函数成功时返回false，否则返回true.-bool lu (double* a, int* pivot, int n) matrix LU decomposition. Suppose an* n array in memory stored in row order, this function uses the column pivoting Gaussian elimination, LU decomposition of their in situ. pivot for the output function. pivot [0, n) stored in the location of the main element array. function successfully returns false, otherwise true. bool guass (double const* lu, int const* p, double* b, int n) Linear equations. Suppose matrix lum* n for a matrix of an* n the LU decomposition, in memory stored in row order. p [0, n) for the LU decomposition of the main element array. b for the equation Ax = b of the right end of the vector. This function calculates the equations Ax = b of the solution, and the results stored in array b [0, n) in. Function successfully returns false, otherwise true.
Platform: |
Size: 2048 |
Author: moontea |
Hits:
Description: 八皇后问题 ，是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。计算机发明后，有多种方法可以解决此问题。-Eight queens problem eight queens problem is an ancient and well-known problem is a typical example backtracking algorithm. The problem is that the nineteenth century the famous mathematician Gauss 1850: Under the 8X8 grid placed on the eight chess queens, so that it can not attack each other, that any two of the Queen can not in the same row, same column or the same slash and asked how many kinds of pendulum method. That there are 76 kinds of the Gaussian program. 1854 in Berlin of the chess magazine published in 40 different kinds of solutions, and later was used graph theory methods to solve the 92 results. After the invention of the computer, there are several ways to solve this problem.
Platform: |
Size: 7168 |
Author: 宋小猫 |
Hits:
Description: 3．1 线性方程组类设计
3．2 全选主元高斯消去法
3．3 全选主元高斯-约当消去法
3．4 复系数方程组的全选主元高斯消去法
3．5 复系数方程组的全选主元高斯-约当消去法
3．6 求解三对角线方程组的追赶法
3．7 一般带型方程组的求解
3．8 求解对称方程组的分解法
3．9 求解对称正定方程组的平方根法
3．10 求解大型稀疏方程组的全选主元高斯-约当消去法
3．11 求解托伯利兹方程组的列文逊方法
3．12 高斯-赛德尔迭代法
3．13 求解对称正定方程组的共轭梯度法
3．14 求解线性最小二乘问题的豪斯荷尔德变换法
3．15 求解线性最小二乘问题的广义逆法
3．16 病态方程组的求解 -3.1 system of linear equations class designs 3.2 to choose the principal element gaussian elimination 3.3 to elect principal element Gauss- when approximately the elimination 3.4 duplicate coefficient equation sets all choose the principal element gaussian elimination 3.5 duplicate coefficient equation sets to elect principal element Gauss- when approximately the elimination 3.6 solve three diagonal line equation sets to pursue the law 3.7 common belt equation set s solution 3.8 solution symmetrical equation set s resolution 3.9 solution symmetrical Zhengding equation set s square root method 3.10 solution large-scale sparse equation set to elect principal element Gauss- when approximately the elimination 3.11 solutions hold the Belize equation set s row article to abdicate House Holland who method 3.12 Gauss- the Seydell repetitive process 3.13 solution symmetrical Zhengding equation set s conjugate gradient method 3.14 solution linearity is smallest two rides the questionThe German m
Platform: |
Size: 71680 |
Author: 王健 |
Hits:
Description: 八皇后问题，是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。计算机发明后，有多种方法可以解决此问题。
可以通过更改程序中define 的n 的值将其改为任意个数的皇后问题
-Eight queens problem is an ancient and well-known problem is a typical example backtracking algorithm. The problem is that the nineteenth century the famous mathematician Gauss 1850: Under the 8X8 grid placed on the eight chess queens, so that it can not attack each other, that any two of the Queen can not in the same row, same column or the same slash and asked how many kinds of pendulum method. That there are 76 kinds of the Gaussian program. 1854 in Berlin of the chess magazine published in 40 different kinds of solutions, and later was used graph theory methods for solving the 92 kinds of results. After the invention of the computer, there are several ways to solve this problem. Can define the program by changing the value of n changed it to an arbitrary number of queens
Platform: |
Size: 240640 |
Author: kyle |
Hits:
Description: 这里面是数值分析作业的ＶＢ程序数值分析程序 线性方程 雅可比 高斯 迭代 二次及高次 线性微分方程 列主元及行主元高斯消元法 LU分解 插值法-This operation which is the numerical analysis numerical analysis program VB program Gaussian iterative linear Fangcheng Ya secondary and higher than linear differential column and row PCA Principal Component Elimination Method of interpolation LU decomposition
Platform: |
Size: 56320 |
Author: 耿伟 |
Hits:
Description: 八皇后问题，是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。计算机发明后，有多种方法可以解决此问题。-Eight queens problem is an ancient and well-known problem is a typical example backtracking algorithm. The problem is that the nineteenth century the famous mathematician Gauss 1850: Under the 8X8 grid placed on the eight chess queens, so that it can not attack each other, that any two of the Queen can not in the same row, same column or the same Slash and asked how many kinds of pendulum method. That there are 76 kinds of the Gaussian program. 1854 in Berlin of the chess magazine published in 40 different kinds of solutions, and later was used graph theory methods to solve the 92 results. After the invention of the computer, there are several ways to solve this problem.
Platform: |
Size: 343040 |
Author: 陈财雄 |
Hits:
Description: 八皇后问题，是一个古老而著名的问题，是回溯算法的典型例题。该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。计算机发明后，有多种方法可以解决此问题。
-Eight queens problem is an ancient and well-known problem is a typical example backtracking algorithm. The problem is that the nineteenth century the famous mathematician Gauss 1850: Under the 8X8 grid placed on the eight chess queens, so that it can not attack each other, that any two of the Queen can not in the same row, same column or the same slash and asked how many kinds of pendulum method. That there are 76 kinds of the Gaussian program. 1854 in Berlin of the chess magazine published in 40 different kinds of solutions, and later was used graph theory methods to solve the 92 results. After the invention of the computer, there are several ways to solve this problem.
Platform: |
Size: 1024 |
Author: LJJ |
Hits:
Description: 高斯消去法
高斯消元的过程，就是利用初等行变换将原来不容易求解的方程组转化为容易求解的方程组。-Gaussian elimination Gaussian elimination process is the use of elementary row transformation is not easy to solve the original equations into easy to solve equations.
Platform: |
Size: 179200 |
Author: eleven |
Hits:
Description: Write a program to solve the systems of linear equations by Gaussian elimination with scaled row pivoting, including the factorization phase and the solution phase. Report the LU matrices as well as the solution in the conclusion.
Platform: |
Size: 8192 |
Author: li |
Hits:
Description: 数值分析例题，包括欧拉法、龙格-库塔法、牛顿拉夫逊算法、牛顿-斯柯特和高斯消元法-Gaussian Elimination Row Operations
Newton Raphson
Newton-Cotes integration
Euler s method
Runga-Kutta
gaussjordan
Platform: |
Size: 4096 |
Author: cecile |
Hits:
Description: In linear algebra, Gaussian elimination (also known as row reduction) is an algorithm for solving systems of linear equations
Platform: |
Size: 1024 |
Author: |
Hits:
Description: 高斯消去法求解AX=b，利用对增广矩阵进行的初等行变换，将系数矩阵变为上三角矩阵，然后回带，可以得到方程组的解。-Gaussian elimination method for solving AX = b, using the augmented matrix for the elementary row transformation, the coefficient matrix into an upper triangular matrix, and then back to the tape, you can get the solution of the equations.
Platform: |
Size: 1024 |
Author: 岳晓鹏 |
Hits:
Description: This function plots a Gaussian impulse response, unit impulse and the
convolution/deconvolution of both using MATLAB s filter . Specifically
it uses filter rather than deconv to do the deconvolution and thereby
returns the original Gaussian vector as well as the unit response vector.
Vector length is maintained at 16 in all cases, the length of the input
data vectors.
By specifying a string for a filename you can save your
plot to a jpeg file. You can either edit the variables g , h and t
to provide your data in row vector format or edit the given
inputData.mat file to suit your needs.
EX:
>> [a b c] = plotImpulses( afigure )-This function plots a Gaussian impulse response, unit impulse and the
convolution/deconvolution of both using MATLAB s filter . Specifically
it uses filter rather than deconv to do the deconvolution and thereby
returns the original Gaussian vector as well as the unit response vector.
Vector length is maintained at 16 in all cases, the length of the input
data vectors.
By specifying a string for a filename you can save your
plot to a jpeg file. You can either edit the variables g , h and t
to provide your data in row vector format or edit the given
inputData.mat file to suit your needs.
EX:
>> [a b c] = plotImpulses( afigure )
Platform: |
Size: 66560 |
Author: anish |
Hits:
Description: In linear algebra, Gaussian elimination (also known as row reduction) is an algorithm for solving systems of linear equations. It is usually understood as a sequence of operations performed on the associated matrix of coefficients. This method can also be used to find the rank of a matrix, to calculate the determinant of a matrix, and to calculate the inverse of an invertible square matrix. The method is named after Carl Friedrich Gauss, although it was known to Chinese mathematicians as early as 179 AD (see History section).
Platform: |
Size: 101376 |
Author: irina |
Hits: