代码搜索：approximate
找到约 1,048 项符合「approximate」的源代码
代码结果 1,048
www.eeworm.com/read/300478/13911697
txt var_amf.txt
Variables in Workspace after calculating "CDGPS(amf)", that means
DGPS based carier phase double differences
by processing Ambiguity Mapping Function:
--------------------------------------------
www.eeworm.com/read/102394/15783398
todo
* Add an inline version of the iterate method for speed? Perhaps not,
the time taken for each iteration surely dominated by the convergence
test.
* Numerical derivatives? Maybe have a function to man
www.eeworm.com/read/164524/10105145
txt 一个基于matlab的径向基的神经网络源程序.txt
一个基于MATLAB的径向基的神经网络源程序
P = [1 2 3 4 5 6 7 8;...
1 2 3 4 5 6 7 8];
T = [0 0.1 0.2 0.5 0.7 0.9 1.1 2.1];
plot(P,T,'.','markersize',30)
axis([0 9 -1 4])
title('Function to approximate.')
www.eeworm.com/read/466324/7032679
java exercise3_30.java
// Exercise3_30.java: Approximate PI
public class Exercise3_30 {
public static void main(String[] args) {
double pi = 0;
double term;
int sign = 1;
for (int i = 1; i
www.eeworm.com/read/464910/7062448
cpp zp1242.cpp
//---------------------------------------------------------------------------
#include
#pragma hdrstop
//---------------------------------------------------------------------------
#
www.eeworm.com/read/456187/7355394
java exercise3_30.java
// Exercise3_30.java: Approximate PI
public class Exercise3_30 {
public static void main(String[] args) {
double pi = 0;
double term;
int sign = 1;
for (int i = 1; i
www.eeworm.com/read/440944/7678821
java sumofarray.java
package exercise_java;
public class SumOfArray {
public static void main(String[] args){
final int NUMBER=2009;
int num1,num2,sum=0;
int i=1;
do{
sum+=i;
i++;
}while
www.eeworm.com/read/297707/8002337
c lind6-1.c
#include
void main()
{
long a,b,t,i,app,mul; //app presents the max common approximate number of the two numbers
// mul presents the min common multiple number of the two numbers
www.eeworm.com/read/319487/13450574
cc ch4ntw.cc
// chapter 3, section 2, computer problem 1: Newton's Method
// NUMERICAL ANALYSIS: MATHEMATICS OF SCIENTIFIC COMPUTING, SECOND EDITION
// David Kincaid & Ward Cheney, Brooks/Cole Publishing Co., 1
www.eeworm.com/read/319487/13450576
cc ch4itmain.cc
// to compile:
// c++ ch4it.cc ch4itmain.cc
#include "ch4it.h"
int main() {
using namespace std;
// fa()
double root = bisctn0(1.0e-2, 1, fa, delta, epsn);
cout