代码搜索：sor
找到约 849 项符合「sor」的源代码
代码结果 849
www.eeworm.com/read/411330/7083300
sor
SOR迭代2007-07-16 18:43#include
#include
using namespace std;
#define n 3 //以三阶为例
#define err 0.0000001
#define N 80
#define w 0.55
void main()
{
int i,
www.eeworm.com/read/365381/9864991
sor方法
#include
#include
#include // fabs();
using namespace std;
void SolveEquation(const int &dim)
{
double *Arr = new double[dim*dim]; //方程矩阵
double *B = new
www.eeworm.com/read/414769/11102239
for sor.for
SUBROUTINE sor(a,b,c,d,e,f,u,jmax,rjac)
INTEGER jmax,MAXITS
DOUBLE PRECISION rjac,a(jmax,jmax),b(jmax,jmax),c(jmax,jmax),
*d(jmax,jmax),e(jmax,jmax),f(jmax,jmax),u(jmax,jmax)
www.eeworm.com/read/392154/8360640
m sor.m
function [x,m]=sor(A,b,w,kmax)
n=length(b);
x=zeros(n,1);
xk=zeros(n,1);
e=0.00001;
for k=1:kmax
xk=x;
for i=1:n
sum=0;
for j=1:n
if j~=i
www.eeworm.com/read/391726/8387118
txt sor.txt
procedure SOR(A,B,C,D,E,F:matrx2; var U:matrx2; JMAX:integer; RJAC:real);
const
MAXITS = 1000; EPS = 0.00001; ZERO = 0; HALF = 0.5;
QTR = 0.25; ONE = 1;
var
J,N,L:integer; ANORMF,
www.eeworm.com/read/192256/8393980
txt sor.txt
procedure SOR(A,B,C,D,E,F:matrx2; var U:matrx2; JMAX:integer; RJAC:real);
const
MAXITS = 1000; EPS = 0.00001; ZERO = 0; HALF = 0.5;
QTR = 0.25; ONE = 1;
var
J,N,L:integer; ANORMF,
www.eeworm.com/read/291235/8433204
cpp sor.cpp
#include
#include "nr.h"
using namespace std;
void NR::sor(Mat_I_DP &a, Mat_I_DP &b, Mat_I_DP &c, Mat_I_DP &d, Mat_I_DP &e,
Mat_I_DP &f, Mat_IO_DP &u, const DP rjac)
{
const int MAXI
www.eeworm.com/read/189605/8465866
java sor.java
package jnt.scimark2;
public class SOR
{
public static final double num_flops(int M, int N, int num_iterations)
{
double Md = (double) M;
double Nd = (double) N;
double num_iterD = (double) n
www.eeworm.com/read/189605/8465885
java sor.java
package jnt.scimark2;
public class SOR
{
public static final double num_flops(int M, int N, int num_iterations)
{
double Md = (double) M;
double Nd = (double) N;
double num_iterD = (double) n
www.eeworm.com/read/390075/8487026
m sor.m
function [x,st]=sor(a,b,n,x1)
D=zeros(n,n);
L=zeros(n,n);
U=zeros(n,n);
for i=1:n
for j=1:n
if j==i
D(i,j)=a(i,j);
end
if j