Search - Jacobi with Gauss-Seidel

Search - Jacobi with Gauss-Seidel - List

[Data structs] gauss-jacobi DL : 0: Inplementation of Gauss-Jacobi method
Update : 2025-02-19 Size : 30kb Publisher : Jaziel
[matlab] code DL : 0: （1）用Doolittle三角分解（LU）法解方程组。（2）分别用Jacobi迭代, Gauss-Seidel迭代法解方程组。 -(1) Triangle Doolittle decomposition (LU) Solving equations. (2), respectively, with Jacobi iteration, Gauss-Seidel iteration method for solution of equations.
Update : 2025-02-19 Size : 2kb Publisher : 娜娜
[matlab] gavno DL : 0: In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations. It is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel, and is similar to the Jacobi method. Though it can be applied to any matrix with non-zero elements on the diagonals, convergence is guaranteed if the matrix is either diagonally dominant, or symmetric and positive definite.
Update : 2025-02-19 Size : 106kb Publisher : John
[matlab] guasMATLAB DL : 0: In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations. It is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel, and is similar to the Jacobi method. Though it can be applied to any matrix with non-zero elements on the diagonals, convergence is only guaranteed if the matrix is either diagonally dominant, or symmetric and positive definite.
Update : 2025-02-19 Size : 3kb Publisher : ismaail
[Algorithm] Gauss-Seidel-method DL : 0: In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations. It is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel, and is similar to the Jacobi method. Though it can be applied to any matrix with non-zero elements on the diagonals, convergence is only guaranteed if the matrix is either diagonally dominant, or symmetric and positive definite.
Update : 2025-02-19 Size : 51kb Publisher : Dmitriy
[matlab] linearsystem DL : 0: 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
Update : 2025-02-19 Size : 19kb Publisher : Paola de Oliveira
[matlab] laplace_2D DL : 0: this Laplace 2D . i solve with Jacobi Iteration method ,Point Gauss-seidel Interation method,Line Gauss-Seidel Iteration method ,Point Successive Over-Relaxation method (PSOR),Line Successive Over-Relaxation method (LSOR)-this is Laplace 2D . i solve with Jacobi Iteration method ,Point Gauss-seidel Interation method,Line Gauss-Seidel Iteration method ,Point Successive Over-Relaxation method (PSOR),Line Successive Over-Relaxation method (LSOR)
Update : 2025-02-19 Size : 1kb Publisher : Thanh
[matlab] jacobi-gauss-seidel-sor DL : 0: 用Jacobi Gauss-seidel SOR迭代法求解线性方程组-With Jacobi Gauss-seidel SOR iterative method for solving linear equations
Update : 2025-02-19 Size : 49kb Publisher : 李春兰
[AI-NN-PR] gauss_seidel DL : 0: In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations. It is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel, and is similar to the Jacobi method. Though it can be applied to any matrix with non-zero elements on the diagonals, convergence is only guaranteed if the matrix is either diagonally dominant, or symmetric and positive definite. It was only mentioned in a private letter from Gauss to his student Gerling in 1823.[1] A publication was not delivered before 1874 by Seidel.
Update : 2025-02-19 Size : 7kb Publisher : zineb24
[matlab] Gauss_Seidel DL : 0: 一种非线性代数方程组的迭代解法。最早用于解算电力系统潮流。这种方法具有程序编制简单、占用内存少的优点，但算法收敛性差，计算时间长。-In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations. It is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel, and is similar to the Jacobi method. Though it can be applied to any matrix with non-zero elements on the diagonals, convergence is only guaranteed if the matrix is either diagonally dominant, or symmetric and positive definite. It was only mentioned in a private letter Gauss to his student Gerling in 1823.[1] A publication was not delivered before 1874 by Seidel.
Update : 2025-02-19 Size : 1kb Publisher : 梁峻超
[Algorithm] Archive DL : 0: 数值方法解线性方程组，包括雅克比迭代法，高斯赛德尔迭代法和SOR超松弛迭代法的例程。-Linear equations with Jacobi, Gauss-Seidel method and SOR iteration.
Update : 2025-02-19 Size : 169kb Publisher : hzf
[JSP/Java] Finalwork DL : 0: 结合java图形界面编程实现了计算方法中的相关的算法，包含：雅可比迭代高斯-塞德尔迭代拉格朗日插值主元素高斯消去高斯-约当消去牛顿插值不含列主元高斯约当法二次多项式拟合一次多项式拟合二分法牛顿迭代三次样条插值三对角的追赶法-Combined with java GUI programming calculation method of the related algorithms, comprising: Jacobi iteration Gauss- Seidel iterative Lagrange Interpolation main elements of Gaussian elimination Gauss- Jordan elimination Newton interpolation excluding out PCA Gauss Jordan Method quadratic polynomial fitting a polynomial fitting dichotomy of Newton iteration cubic spline interpolation method Tridiagonal catch
Update : 2025-02-19 Size : 6kb Publisher : 李力
[matlab] Gauss-Seidel-Method DL : 0: In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations. It is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel, and is similar to the Jacobi method. Though it can be applied to any matrix with non-zero elements on the diagonals, convergence is only guaranteed if the matrix is either diagonally dominant, or symmetric and positive definite. It was only mentioned in a private letter Gauss to his student Gerling in 1823.[1] A publication was not delivered before 1874 by Seidel-In numerical linear algebra, the Gauss–Seidel method, also known as the Liebmann method or the method of successive displacement, is an iterative method used to solve a linear system of equations. It is named after the German mathematicians Carl Friedrich Gauss and Philipp Ludwig von Seidel, and is similar to the Jacobi method. Though it can be applied to any matrix with non-zero elements on the diagonals, convergence is only guaranteed if the matrix is either diagonally dominant, or symmetric and positive definite. It was only mentioned in a private letter Gauss to his student Gerling in 1823.[1] A publication was not delivered before 1874 by Seidel
Update : 2025-02-19 Size : 1kb Publisher : Zolo
[OpenGL program] softwzrs DL : 0: 用Matlab软件以及雅克比迭代和高斯－赛德尔迭代解方程组-As well as the Jacobi iteration with the Matlab software and gauss-seidel iterative solution of equations
Update : 2025-02-19 Size : 16kb Publisher : tabce
[Windows Develop] dlobap DL : 0: As well as the Jacobi iteration with the Matlab software and gauss-seidel iterative solution of equations
Update : 2025-02-19 Size : 16kb Publisher : oqbi$742
[Graph program] NRTFE97 DL : 0: 用Matlab软件以及雅克比迭代和高斯－赛德尔迭代解方程组(As well as the Jacobi iteration with the Matlab software and gauss-seidel iterative solution of equations)
Update : 2025-02-19 Size : 16kb Publisher : NR%25252141788
[Special Effects] pta4 DL : 0: 浙大PTA练习系统NA1004 比较雅各比迭代和高斯塞德尔迭代(Use Jacobi and Gauss-Seidel methods to solve a given n×n linear system A x ⃗ = b ⃗ with an initial approximation x ⃗ (0) . Note: When checking each a ii , first scan downward for the entry with maximum absolute value (a ii included). If that entry is non-zero, swap it to the diagonal. Otherwise if that entry is zero, scan upward for the entry with maximum absolute value. If that entry is non-zero, then add that row to the i-th row.)
Update : 2025-02-19 Size : 108kb Publisher : qiuyingyue