数值分析(php兑现)二:线性方程组的两个解法
Jun 13, 2016 am 10:38 AM
array
this
数值分析(php实现)二:线性方程组的两个解法
其实这个程序是早就写好的,只不过一直没有时间写上来.
这两个程序都是通过迭代的方法得到线性方程组的解的方法,一个是高斯-塞德尔迭代法,一个是雅可比迭代法
<?phpclass Gs{ private $matrix; public function __construct($array){ $this->matrix = $array; } public function solve(){ $preX = array(); $nowX = array(); $cishu = 17; $delta = 0.0001; $matN = count($this->matrix); for($i = 0;$i<$matN;$i++){ $preX[$i] = 1; } $min = 100000000; for($n = 0;$n<$cishu;$n++){ for($i = 0;$i<$matN;$i++){//xi $sum1 = 0; $sum2 = 0; for($j = 0;$j < $matN;$j++){ if($j < $i) $sum1 += ($this->matrix[$i][$j] * $nowX[$j]); if($j > $i) $sum2 += ($this->matrix[$i][$j] * $preX[$j]); } $nowX[$i] = ($this->matrix[$i][$matN] - $sum1 - $sum2)/$this->matrix[$i][$i]; $tempMin = $nowX[$i] > $preX[$i] ? $nowX[$i]-$preX[$i]:$preX[$i]-$nowX[$i]; if($min > $tempMin) $min = $tempMin; } $preX = $nowX; $str = implode(",",$nowX); echo ($n+1).":($str)"."<br>"; if($min < $delta) break; } }}$a = array( array(5,2,1,-12), array(-1,4,2,20), array(12,-3,10,3));$x = new Gs($a);$x->solve();?>
Copy after login
接下来的是雅可比方法,
<?phpclass Yacobi{ private $matrix; public function __construct($array){ $this->matrix = $array; } public function solve(){ $preX = array(); $nowX = array(); $cishu = 17; $matN = count($this->matrix); for($i = 0;$i<$matN;$i++){ $preX[$i] = 1; } for($n = 0;$n<$cishu;$n++){ for($i = 0;$i<$matN;$i++){//xi $sum = 0; for($j = 0;$j < $matN;$j++){ if($j != $i) $sum += ($this->matrix[$i][$j] * $preX[$j]); } $nowX[$i] = ($this->matrix[$i][$matN] - $sum)/$this->matrix[$i][$i]; } $preX = $nowX; $str = implode(",",$nowX); echo ($n+1).":($str)"."<br>"; } }}$a = array( array(5,2,1,-12), array(-1,4,2,20), array(12,-3,10,3));$x = new Yacobi($a);$x->solve();?>
Copy after login
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn

Hot Article
Repo: How To Revive Teammates
3 weeks ago
By 尊渡假赌尊渡假赌尊渡假赌
R.E.P.O. Energy Crystals Explained and What They Do (Yellow Crystal)
1 weeks ago
By 尊渡假赌尊渡假赌尊渡假赌
Hello Kitty Island Adventure: How To Get Giant Seeds
3 weeks ago
By 尊渡假赌尊渡假赌尊渡假赌
How Long Does It Take To Beat Split Fiction?
3 weeks ago
By DDD

Hot tools Tags

Hot Article
Repo: How To Revive Teammates
3 weeks ago
By 尊渡假赌尊渡假赌尊渡假赌
R.E.P.O. Energy Crystals Explained and What They Do (Yellow Crystal)
1 weeks ago
By 尊渡假赌尊渡假赌尊渡假赌
Hello Kitty Island Adventure: How To Get Giant Seeds
3 weeks ago
By 尊渡假赌尊渡假赌尊渡假赌
How Long Does It Take To Beat Split Fiction?
3 weeks ago
By DDD

Hot Article Tags

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

Sort array using Array.Sort function in C#

Simple and clear method to use PHP array_merge_recursive() function

How to use the array_combine function in PHP to combine two arrays into an associative array

Detailed explanation of PHP array_fill() function usage

How to use the Array module in Python

What are the common causes of ArrayStoreException in Java?

Introduction to how to use the PHP array_change_key_case() function
