代码搜索：fprintf
找到约 10,000 项符合「fprintf」的源代码
代码结果 10,000
www.eeworm.com/read/140697/13066888
m alg051.m
% EULER'S ALGORITHM 5.1
%
% TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM:
% Y' = F(T,Y), A
www.eeworm.com/read/140697/13066896
m alg022.m
% FIXED-POINT ALGORITHM 2.2
%
% To find a solution to p = g(p) given an
% initial approximation p0
%
% INPUT: initial approximation p0; tolerance TOL;
% maximum number of iterati
www.eeworm.com/read/140697/13066898
m alg041.m
% SIMPSON'S COMPOSITE ALGORITHM 4.1
%
% To approximate I = integral ( ( f(x) dx ) ) from a to b:
%
% INPUT: endpoints a, b; even positive integer n.
%
% OUTPUT: approximation XI to I.
www.eeworm.com/read/140697/13066909
m alg111.m
% LINEAR SHOOTING ALGORITHM 11.1
%
% To approximate the solution of the boundary-value problem
%
% -Y'' + P(X)Y' + Q(X)Y + R(X) = 0, A
www.eeworm.com/read/140697/13066916
m alg026.m
% STEFFENSEN'S ALGORITHM 2.6
%
% To find a solution to g(x) = x
% given an initial approximation p0:
%
% INPUT: initial approximation p0; tolerance TOL;
% maximum number of ite
www.eeworm.com/read/140697/13066948
m alg024.m
% SECANT ALGORITHM 2.4
%
% To find a solution to the equation f(x) = 0
% given initial approximations p0 and p1:
%
% INPUT: initial approximation p0, p1; tolerance TOL;
% maxim
www.eeworm.com/read/140697/13066950
m alg067.m
% CROUT FACTORIZATION FOR TRIDIAGONAL LINEAR SYSTEMS ALGORITHM 6.7
%
% To solve the n x n linear system
%
% E1: A(1,1) X(1) + A(1,2) X(2) = A(1,n+1)
% E2: A(2,1) X(1) + A(2,2)
www.eeworm.com/read/140697/13066969
m alg058.m
% TRAPEZOIDAL WITH NEWTON ITERATION ALGORITHM 5.8
%
% TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM:
% Y' = F(T,Y), A
www.eeworm.com/read/140697/13066988
m alg113.m
% LINEAR FINITE-DIFFERENCE ALGORITHM 11.3
%
% To approximate the solution of the boundary-value problem
%
% Y'' = P(X)Y' + Q(X)Y + R(X), A
www.eeworm.com/read/140697/13066998
m alg043.m
% ADAPTIVE QUADRATURE ALGORITM 4.3 %
% To approximate I = integral ( ( f(x) dx ) ) from a to b to within
% a given tolerance TOL:
%
% INPUT: endpoints a, b; tolerance TOL; limit N to