代码搜索：fprintf
找到约 10,000 项符合「fprintf」的源代码
代码结果 10,000
www.eeworm.com/read/431167/8706462
c aslerror.c
/******************************************************************************
*
* Module Name: aslerror - Error handling and statistics
* $Revision: 1.95 $
*
*********************
www.eeworm.com/read/430470/8744130
m orbitode.m
function orbitode
%ORBITODE Restricted three body problem.
% This is a standard test problem for non-stiff solvers stated in Shampine
% and Gordon, p. 246 ff. The first two solution component
www.eeworm.com/read/386253/8759849
m alg102.m
% 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/386253/8759901
m alg121.m
% POISSON EQUATION FINITE-DIFFERENCE ALGORITHM 12.1
%
% To approximate the solution to the Poisson equation
% DEL(u) = F(x,y), a
www.eeworm.com/read/386253/8759923
m alg064.m
% DIRECT FACTORIZATION ALGORITHM 6.4
%
% To factor the n by n matrix A = (A(I,J)) into the product of the
% lower triangular matrix L = (L(I,J)) and the upper triangular
% matrix U = (U(I,J)), tha
www.eeworm.com/read/386253/8759959
m alg101.m
% 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 unknowns; in
www.eeworm.com/read/386253/8759972
m alg125.m
% Finite Element Algorithm 12.5
%
% To approximate the solution to an elliptic partial-differential
% equation subject to Dirichlet, mixed, or Neumann boundary
% conditions:
%
% Input: see STE
www.eeworm.com/read/386253/8760063
m alg102.m
% 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/386253/8760084
m alg121.m
% POISSON EQUATION FINITE-DIFFERENCE ALGORITHM 12.1
%
% To approximate the solution to the Poisson equation
% DEL(u) = F(x,y), a
www.eeworm.com/read/386253/8760109
m alg064.m
% DIRECT FACTORIZATION ALGORITHM 6.4
%
% To factor the n by n matrix A = (A(I,J)) into the product of the
% lower triangular matrix L = (L(I,J)) and the upper triangular
% matrix U = (U(I,J)), tha