代码搜索：Approximation
找到约 1,542 项符合「Approximation」的源代码
代码结果 1,542
www.eeworm.com/read/104551/15690108
h math_approx.h
/* Copyright (C) 2002 Jean-Marc Valin
File: math_approx.c
Various math approximation functions for Speex
Redistribution and use in source and binary forms, with or without
modification,
www.eeworm.com/read/104551/15690116
c math_approx.c
/* Copyright (C) 2002 Jean-Marc Valin
File: math_approx.c
Various math approximation functions for Speex
Redistribution and use in source and binary forms, with or without
modification,
www.eeworm.com/read/102062/15793470
dsp poly.dsp
.module/boot=3/boot=4 approximate_func;
{ POLY.DSP - Calculates the polynomial approximation to
a function given by the coefficients.
Uses 32 bit; y = f(x);
www.eeworm.com/read/386253/8759845
m alg072.m
% GAUSS-SEIDEL ITERATIVE TECHNIQUE ALGORITHM 7.2
%
% To solve Ax = b given an initial approximation x(0).
%
% INPUT: the number of equations and unknowns n; the entries
% A(I,J), 1
www.eeworm.com/read/386253/8759976
m alg071.m
% JACOBI ITERATIVE ALGORITHM 7.1
%
% To solve Ax = b given an initial approximation x(0).
%
% INPUT: the number of equations and unknowns n; the entries
% A(I,J), 1
www.eeworm.com/read/386253/8760007
m alg073.m
% 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
% A(I,J), 1
www.eeworm.com/read/386253/8760061
m alg072.m
% GAUSS-SEIDEL ITERATIVE TECHNIQUE ALGORITHM 7.2
%
% To solve Ax = b given an initial approximation x(0).
%
% INPUT: the number of equations and unknowns n; the entries
% A(I,J), 1
www.eeworm.com/read/386253/8760167
m alg071.m
% JACOBI ITERATIVE ALGORITHM 7.1
%
% To solve Ax = b given an initial approximation x(0).
%
% INPUT: the number of equations and unknowns n; the entries
% A(I,J), 1
www.eeworm.com/read/386253/8760197
m alg073.m
% 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
% A(I,J), 1
www.eeworm.com/read/162867/10262495
m hankelize.m
%HANKELIZE low-rank Hankel approximation
% out = hankelize(Input, M, converge) returns the matrix with Hankel
% structure and aproximately low rank.
%
% Input is the input matrix. M is the number of