代码搜索:fprintf

找到约 10,000 项符合「fprintf」的源代码

代码结果 10,000
www.eeworm.com/read/420191/10811364

m f_d5.m

% f_d5: Use L_d4 fprintf('Use L_d4\n')
www.eeworm.com/read/420191/10811395

m f_d4.m

% f_d4: Use L_d3 fprintf('Use L_d3\n')
www.eeworm.com/read/420191/10811412

m f_d6.m

% f_d6: Use L_d5 fprintf('Use L_d6\n')
www.eeworm.com/read/349606/10814175

c pridump.c

/* * libpri: An implementation of Primary Rate ISDN * * Written by Mark Spencer * * Copyright (C) 2001-2005, Digium * All Rights Reserved. * * This program is free softwa
www.eeworm.com/read/349479/10825258

m gausspf.m

function [V, converged, i] = gausspf(Ybus, Sbus, V0, ref, pv, pq, mpopt) %GAUSSPF Solves the power flow using a Gauss-Seidel method. % [V, converged, i] = gausspf(Ybus, Sbus, V0, ref, pv, pq, mpopt
www.eeworm.com/read/419824/10834918

m main.m

par.VSize = 300; %Vocabulary Size par.M = 10; %setp between pixels par.BW = 1; % gray level vocabulary = 0; color vocabulary = 1; par.nRegions =4; %number of support regions per pixel par.nPosImag
www.eeworm.com/read/419697/10842868

c alg091.c

/* * POWER METHOD ALGORITHM 9.1 * * To approximate the dominant eigenvalue and an associated * eigenvector of the n by n matrix A given a nonzero vector x: * * INPUT: Dimension n; matr
www.eeworm.com/read/419697/10842871

c alg061.c

/* * GAUSSIAN ELIMINATION WITH BACKWARD SUBSTITUTION ALGOTITHM 6.1 * * 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
www.eeworm.com/read/419697/10842893

c alg064.c

/* * 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 U = (U(I,J)), that is * A = LU, whe
www.eeworm.com/read/419697/10842960

c alg062.c

/* * 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