代码搜索：Approximation
找到约 1,542 项符合「Approximation」的源代码
代码结果 1,542
www.eeworm.com/read/140700/13066045
txt alg102.txt
> restart;
> # BROYDEN ALGORITHM 10.2
> #
> # To approximate the solution of the nonlinear system F(X) = 0
> # given an initial approximation X.
> #
> # INPUT: Number n of equations and unknow
www.eeworm.com/read/140700/13066050
txt alg103.txt
> restart;
> # STEEPEST DESCENT ALGORITHM 10.3
> #
> # To approximate a solution P to the minimization problem
> # G(P) = MIN( G(X) : X in R(n) )
> # given an initial approximation
www.eeworm.com/read/140700/13066253
txt alg071.txt
> restart;
> # JACOBI ITERATIVE ALGORITHM 7.1
> #
> # To solve Ax = b given an initial approximation x(0).
> #
> # INPUT: the number of equations and unknowns n; the entries
> # A(I,J
www.eeworm.com/read/140700/13066346
txt alg102.txt
> restart;
> # BROYDEN ALGORITHM 10.2
> #
> # To approximate the solution of the nonlinear system F(X) = 0
> # given an initial approximation X.
> #
> # INPUT: Number n of equations and unknow
www.eeworm.com/read/140700/13066351
txt alg103.txt
> restart;
> # STEEPEST DESCENT ALGORITHM 10.3
> #
> # To approximate a solution P to the minimization problem
> # G(P) = MIN( G(X) : X in R(n) )
> # given an initial approximation
www.eeworm.com/read/140698/13066562
c alg073.c
/*
* SOR ALGORITHM 7.3
*
* To solve Ax = b given the parameter w and an initial approximation
* x(0):
*
* INPUT: the number of equations and unknowns n; the entries
* A(I,J
www.eeworm.com/read/140698/13066580
c alg072.c
/*
* GAUSS-SEIDEL ITERATAIVE TECHNIQUE ALGORITHM 7.2
*
* To solve Ax = b given an initial approximation x(0).
*
* INPUT: the number of equations and unknowns n; the entries
*
www.eeworm.com/read/140698/13066594
c alg102.c
/*
* BROYDEN ALGORITHM 10.2
*
* To approximate the solution of the nonlinear system F(X) = 0
* given an initial approximation X.
*
* INPUT: Number n of equations and unknowns; initial
www.eeworm.com/read/140698/13066703
c alg103.c
/*
* STEEPEST DESCENT ALGORITHM 10.3
*
* To approximate a solution P to the minimization problem
* G(P) = MIN( G(X) : X in R(n) )
* given an initial approximation X:
*
*
www.eeworm.com/read/140698/13066719
c alg101.c
/*
* NEWTON'S METHOD FOR SYSTEMS ALGORITHM 10.1
*
* To approximate the solution of the nonlinear system F(X)=0 given
* an initial approximation X:
*
* INPUT: Number n of equations and