代码搜索：finding
找到约 1,199 项符合「finding」的源代码
代码结果 1,199
www.eeworm.com/read/163245/10168986
m empder_search_oneunit.m
function [Jopt,wopt,OptDetails] = empder_search_oneunit(contrast,x,w,kparam,optparam)
% EMPDER_SEARCH_ONEUNIT
% - Steepest descent method for finding a minima of the one-unit
%
www.eeworm.com/read/161233/10436240
c sign.c
/* Copyright (C) 1999 Lucent Technologies */
/* From 'Programming Pearls' by Jon Bentley */
/* sign.c -- sign each line of a file for finding anagrams
The input line "stop" gives the output li
www.eeworm.com/read/443184/7114802
m regulafalsi.m
function [x, fval, evals, iters, badinds] = regulafalsi(fun, a, b, varargin)
% REGULAFALSI Regula Falsi (derivative-free) root finding algorithm.
%
% [x, fsol, evals] = REGULAFALSI(fun, a,
www.eeworm.com/read/458493/7295660
m contents.m
% NMM toolbox: routines for finding the roots of f(x) = 0
%
% bisect Use bisection to find a root of the scalar equation f(x) = 0
% brackPlot Find and plot brackets for roots of a function.
www.eeworm.com/read/458488/7296085
m contents.m
% NMM toolbox: routines for finding the roots of f(x) = 0
%
% bisect Use bisection to find a root of the scalar equation f(x) = 0
% brackPlot Find and plot brackets for roots of a function.
www.eeworm.com/read/448946/7521578
h cpe.h
/* Compute CPE for function */
/* Compute for function that is linear in some parameter cnt */
typedef void (*elem_fun_t)(int);
/* Different ways of finding samples
UNI_SAMPLE: samples uniformly
www.eeworm.com/read/443159/7636760
m regulafalsi.m
function [x, fval, evals, iters, badinds] = regulafalsi(fun, a, b, varargin)
% REGULAFALSI Regula Falsi (derivative-free) root finding algorithm.
%
% [x, fsol, evals] = REGULAFALSI(fun, a,
www.eeworm.com/read/441420/7670645
m b_point.m
function pos = b_point(pr,sv,time,navfile)
%B_POINT Prepares input to the Bancroft algorithm for finding
% a preliminary position of a receiver. The input is
% four or more pseudoranges
www.eeworm.com/read/441410/7670752
m b_point.m
function pos = b_point(pr,sv,time,navfile)
%B_POINT Prepares input to the Bancroft algorithm for finding
% a preliminary position of a receiver. The input is
% four or more pseudoranges
www.eeworm.com/read/441402/7670998
m b_point.m
function pos = b_point(pr,sv,time,navfile)
%B_POINT Prepares input to the Bancroft algorithm for finding
% a preliminary position of a receiver. The input is
% four or more pseudoranges