代码搜索：fprintf
找到约 10,000 项符合「fprintf」的源代码
代码结果 10,000
www.eeworm.com/read/140698/13066478
c alg022.c
/*
* FIXED-POINT ALGORITHM 2.2
*
* To find a solution to p = g(p) given an
* initial approximation p0
*
* INPUT: initial approximation; tolerance TOL;
* maximum number of iterations NO
www.eeworm.com/read/140698/13066598
c alg023.c
/*
* NEWTON-RAPHSON ALGORITHM 2.3
*
* To find a solution to f(x) = 0 given an
* initial approximation p0:
*
* INPUT: initial approximation p0; tolerance TOL;
* maximum numb
www.eeworm.com/read/140698/13066639
c alg026.c
/*
* 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
www.eeworm.com/read/140698/13066671
c alg112.c
/*
* NONLINEAR SHOOTING ALGORITHM 11.2
*
* To approximate the solution of the nonlinear boundary-value problem
*
* Y'' = F(X,Y,Y'), A
www.eeworm.com/read/140697/13066773
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/13066775
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/13066789
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/13066804
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/13066811
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
www.eeworm.com/read/140697/13066823
m alg023.m
% NEWTON-RAPHSON ALGORITHM 2.3
%
% To find a solution to f(x) = 0 given an
% initial approximation p0:
%
% INPUT: initial approximation p0; tolerance TOL;
% maxi