代码搜索：Approximation
找到约 1,542 项符合「Approximation」的源代码
代码结果 1,542
www.eeworm.com/read/492033/6430466
h linhex_8ip.h
#ifndef LINHEX_H
#define LINHEX_H
#include "alias.h"
struct matrix;
struct vector;
struct ivector;
/**
class linhex defines hexahedral finite element with
tri-linear approximation functions
www.eeworm.com/read/492033/6430473
h quadhex.h
#ifndef QUADHEX_H
#define QUADHEX_H
#include "alias.h"
struct matrix;
struct vector;
struct ivector;
/**
class quadhex defines hexahedral finite element with
tri-quadratic approximation functi
www.eeworm.com/read/492033/6430514
h linhex.h
#ifndef LINHEX_H
#define LINHEX_H
#include "alias.h"
struct matrix;
struct vector;
struct ivector;
/**
class linhex defines hexahedral finite element with
tri-linear approximation functions
www.eeworm.com/read/491236/6437886
asv que_func.asv
function fofx = que_func(x)
% This function computes the value of the Q-function
% listed in Eq.(2.16). It uses the approximation in Eq.s (2.17) and (2.18)
if (x >= 0)
denom = 0.661 * x + 0.339 *
www.eeworm.com/read/491236/6437936
m que_func.m
function fofx = que_func(x)
% This function computes the value of the Q-function
% listed in Eq.(2.16). It uses the approximation in Eq.s (2.17) and (2.18)
if (x >= 0)
denom = 0.661 * x + 0.339 *
www.eeworm.com/read/489524/6472667
m que_func.m
function fofx = que_func(x)
% This function computes the value of the Q-function
% listed in Eq.(2.16). It uses the approximation in Eq.s (2.17) and (2.18)
if (x >= 0)
denom = 0.661 * x + 0.339
www.eeworm.com/read/476700/6748531
m disfrft.m
function y=Disfrft(f,a,p)
% Computes discrete fractional Fourier transform
% of order a of vector x
% p (optional) is order of approximation, default N/2
N = length(f); even = ~rem(N,2);
shft = r
www.eeworm.com/read/476700/6748542
m disfrft.m
function y=Disfrft(f,a,p)
% Computes discrete fractional Fourier transform
% of order a of vector x
% p (optional) is order of approximation, default N/2
N = length(f); even = ~rem(N,2);
shft = r
www.eeworm.com/read/476700/6748548
m disfrft.m
function y=Disfrft(f,a,p)
% Computes discrete fractional Fourier transform
% of order a of vector x
% p (optional) is order of approximation, default N/2
N = length(f); even = ~rem(N,2);
shft = r
www.eeworm.com/read/263805/11341502
m nnd11fa.m
function nnd11fa(cmd,arg1)
%NND11FA Function approximation demonstration.
%
% This demonstration requires the Neural Network Toolbox.
% First Version, 8-31-95.
%==============================