代码搜索：fprintf
找到约 10,000 项符合「fprintf」的源代码
代码结果 10,000
www.eeworm.com/read/140697/13067050
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/140697/13067052
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:
www.eeworm.com/read/140697/13067056
m alg071.m
% 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), 1
www.eeworm.com/read/140697/13067058
m alg033.m
% HERMITE INTERPOLATION ALGORITHM 3.3
%
% TO OBTAIN THE COEFFICIENTS OF THE HERMITE INTERPOLATING
% POLYNOMIAL H ON THE (N+1) DISTINCT NUMBERS X(0), ..., X(N)
% FOR THE FUNCTION F:
%
% IN
www.eeworm.com/read/140697/13067059
m alg074.m
% ITERATIVE REFINEMENT ALGORITHM 7.4
%
% To approximate the solution to the linear system Ax=b when A is
% suspected to be ill-conditioned:
%
% INPUT: The number of equations and unknowns n; the
www.eeworm.com/read/140697/13067074
m alg055.m
% ADAMS VARIABLE STEP-SIZE PREDICTOR-CORRECTOR ALGORITHM 5.5
%
% To approximate the solution of the initial value problem
% y' = f( t, y ), a
www.eeworm.com/read/140697/13067075
m alg075.m
% CONJUGATE GRADIENT ALGORITHM 7.5
%
% To solve Ax = b given the preconditioning matrix C inverse
% and an initial approximation
% x(0):
%
% INPUT: the number of equations and unknowns n; the
www.eeworm.com/read/140697/13067076
m alg046.m
% GAUSSIAN TRIPLE INTEGRAL ALGORITHM 4.6
%
% To approximate I = triple integral ( ( f(x,y,z) dz dy dx ) ) with
% limits of integration from a to b for x, from c(x) to d(x) for y, and
% from
www.eeworm.com/read/140697/13067085
m alg062.m
% GAUSSIAN ELIMINATION WITH PARTIAL PIVOTING ALGORITHM 6.2
%
% 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(2) +
www.eeworm.com/read/140697/13067094
m alg073.m
% 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), 1