搜索资源列表
conjgrad123
- To solve Ax=b - input A, b, x0 (initial guess), ni (number of iteration) - output
Jor
- 用matlab实现使用约当消去法实现Ax=b的实验及算法-Use with matlab Jordan elimination method to achieve realization of Ax = b of the experiment and algorithm
number1
- 列主元Gauss消去法解线性方程组Ax=b-Out the main element Gauss elimination method of solving linear equations Ax = b
nagauss-wang
- 列主元Gauss消去法解线性方程组ax=b-failed to translate
Ponytail
- How to Simulate A Ponytail - The Sample App This is a very simple Lagrange Multiplier constrained dynamics simulator to accompany my articles and lectures on How to Simulate a Ponytail. For more information, see http://chrishecker.com/H
gauss
- 高斯消去法 用列主元求解AX=b 数值计算实习 例子-Gaussian elimination
gs
- 本程序是用高斯消去法求解线性方程组AX=B的C语言实现-This procedure is used Gaussian elimination for solving linear equations AX = B of the C language
FORTRAN-compilation-algorithm
- 用于科学计算的Fortran 90/95算法源程序,用LU分解进行高斯消元法-This module provides all the subroutines needed to solve the problem: Ax=b using direct methods, based on employing either the LU or PLU factorisation methods.
slv
- TCodes, for Tcodes,...LU factorization to solve AX=B
Gauss_pivot.m
- Method Gaussian Elimination without pivoting for Linear Systems Solve Ax = b using Gaussian elimination without pivoting Inputs : A is the n-by-n coefficient matrix b is the n-by-k right hand side matrix Outputs : x is the n-by-k
lab05
- 编写列主元消元法的通用程序。。。数组AX=B a和b的输入都是考修改外部txt文件-Write out principal component elimination method for general program. . . Array of AX = B a and b are the test input to modify the external txt file
Line
- Line class, allows to set line parameters such as y = ax + b or rho and theta in polar coordinates. Some features: can find intersection of 2 lines, calculate points of image from equation parameters, and other features.
linearsystem
- 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 Al
gaosisaier
- 迭代法求解线性方程组，首先将方程组AX=B中未知数X给定，计算出矩阵B。然后把矩阵B带入，利用雅各比迭代法反求X-Iterative method for solving linear equations, the first of equations AX = B will be in the unknown X given to calculate the matrix B. Then the matrix B into the use of Jacobi iterative method
guass
- 利用高斯列主元消去法求解线性方程组Ax=b的解，并进行验证-Gauss elimination method to solve out the main element equations,
zhenhaoyongxxmb
- 线性规划问题的数学模型的一般形式 （1）列出约束条件及目标函数 （2）画出约束条件所表示的可行域 （3）在可行域内求目标函数的最优解及最优值-Min z=CX S.T. AX =b X>=0
Progs_m
- Solves Ax = b by Gauss-Seidel method with relaxation.
MatlabSpanish
- programas de matlab, para aplicaciones de ax=b
yagebidiedaifa
- 设方程组Ax=b 满足aii ≠0, 将方程组变形为: x=Bx+f, 则雅可比(Jacobi)迭代法是指 x(k+1)=Bx(k)+f 由初始解逐步迭代即可得到方程组的解-Set of equations Ax = b satisfy aii ≠ 0, the equations of deformation: x = Bx+ f, then the Jacobi (Jacobi) iteration is x (k+1) = Bx (k)+ f from the initial
complex_gauss
- This is a program to calculate Ax = b using complex Gaussian elimination method. A is a coefficient matrix. x is an unknown value vector. b is a right-hand side known vector. We can get an unknown vector x. These vectors and matrix can have complex