代码搜索：fprintf
找到约 10,000 项符合「fprintf」的源代码
代码结果 10,000
www.eeworm.com/read/140700/13066261
txt alg065.txt
> restart;
> # 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 diagon
www.eeworm.com/read/140700/13066278
txt alg064.txt
> restart;
> # 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
> # ma
www.eeworm.com/read/140700/13066295
txt alg034.txt
> restart;
> # NATURAL CUBIC SPLINE ALGORITHM 3.4 #
> # To construct the cubic spline interpolant S for the function f,
> # defined at the numbers x(0) < x(1) <
www.eeworm.com/read/140700/13066314
txt alg094.txt
> restart;
> # WIELANDT'S DEFLATION ALGORITHM 9.4
> #
> # To approximate the second most dominant eigenvalue and an
> # associated eigenvector of the n by n matrix A given an
> # approximation LA
www.eeworm.com/read/140700/13066330
txt alg073.txt
> restart;
> # 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
> #
www.eeworm.com/read/140700/13066346
txt alg102.txt
> restart;
> # 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 unknow
www.eeworm.com/read/140700/13066348
txt alg081.txt
> restart;
> # 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 + ...
www.eeworm.com/read/140700/13066361
txt alg035.txt
> restart;
> # 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(
www.eeworm.com/read/140698/13066537
c alg074.c
/*
* 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 unk
www.eeworm.com/read/140698/13066602
c alg096.c
/*
* QR ALGORITHM 9.6
*
* To obtain the eigenvalues of a symmetric, tridiagonal n by n matrix
*
* a(1) b(2)
* b(2) a(2) b(3)
* . . .
*