代码搜索:fprintf

找到约 10,000 项符合「fprintf」的源代码

代码结果 10,000
www.eeworm.com/read/386253/8760062

m alg044.m

% DOUBLE INTEGAL ALGORITHM 4.4 % % To approximate I = double integral ( ( f(x,y) dy dx ) ) with limits % of integration from a to b for x and from c(x) to d(x) for y: % % INPUT: endpoint
www.eeworm.com/read/386253/8760070

m alg066.m

% CHOLESKI'S ALGORITHM 6.6 % % To factor the positive definite n by n matrix A into LL**T, % where L is lower triangular. % % INPUT: the dimension n; entries A(I,J), 1
www.eeworm.com/read/386253/8760093

m alg025.m

% METHOD OF FALSE POSITION ALGORITHM 2.5 % % To find a solution to f(x) = 0 given the continuous function % f on the interval [p0,p1], where f(p0) and f(p1) have % opposite signs: % % INP
www.eeworm.com/read/386253/8760117

m alg035.m

% CLAMPED CUBIC SPLINE ALGORITHM 3.5 % % To construct the cubic spline interpolant S for the function f, % defined at the numbers x(0) < x(1) < ... < x(n), satisfying % S'(x(0)) = f'(x(0)) an
www.eeworm.com/read/386253/8760129

m alg103.m

% 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: % % INPUT: Num
www.eeworm.com/read/386253/8760135

m alg122.m

% HEAT EQUATION BACKWARD-DIFFERENCE ALGORITHM 12.2 % % To approximate the solution to the parabolic partial-differential % equation subject to the boundary conditions % u(0,t) = u(l
www.eeworm.com/read/386253/8760144

m alg061.m

% GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ALGOTITHM 6.1 % % To solve the n by n linear system % % E1: A(1,1) X(1) + A(1,2) X(2) +...+ A(1,n) X(n) = A(1,n+1) % E2: A(2,1) X(1) + A(2,2) X
www.eeworm.com/read/386253/8760149

m alg065.m

% LDL^t ALGORITHM 6.5 % % To factor the positive definite n by n matrix A into LDL**T, % where L is a lower triangular matrix with ones along the diagonal % and D is a diagonal matrix with positiv
www.eeworm.com/read/386253/8760157

m alg081.m

% PADE RATIONAL APPROXIMATION ALGORITHM 8.1 % % To obtain the rational approximation % % r(x) = p(x) / q(x) % = (p0 + p1*x + ... + Pn*x^n) / (q0 + q1*x + ... + qm*x^m) % % for a gi
www.eeworm.com/read/386253/8760159

m alg045.m

% GAUSSIAN DOUBLE INTEGRAL ALGORITHM 4.5 % % To approximate I = double integral (( f(x, y) dy dx )) with limits % of integration from a to b for x and from c(x) to d(x) for y: % % INPUT: