代码搜索：精度可调
找到约 3,652 项符合「精度可调」的源代码
代码结果 3,652
www.eeworm.com/read/472863/6859006
m demo.m
% demo --- using FastICA to separating 3 mixed images
%PCA-ICA方法实现SAR图像中的相干斑去除
%FastICA算法：收敛速度快但稳定性不够好
clear;clc;close all;
% 获取三个大小为256×256的双精度(0-1)图象
%-------------------------- case 1
www.eeworm.com/read/394381/8228090
m solve.m
function varargout = solve(varargin)
%求各种类型方程组的解析解,
%当找不到解析解时,将自动寻求原点附近的一个近似解, 并可达任意精度.
%用法
% solve('方程1','方程2',...,'方程N','变量1','变量2',...,'变量M')
%SOLVE Symbolic solution of algebraic equation
www.eeworm.com/read/392361/8348284
m exm052_3.m
%exm052_3.m
%（1）产生符号函数
syms a x;
f=a*sin(x)+5;
%（2）符号变量置换
f1=subs(f,'sin(x)',sym('y')) %
%（3）符号常数置换
f2=subs(f,{a,x},{2,sym(pi/3)}) %
%（4）双精度数值置换
f3=sub
www.eeworm.com/read/368108/9711543
m exm052_3.m
%exm052_3.m
%（1）产生符号函数
syms a x;
f=a*sin(x)+5;
%（2）符号变量置换
f1=subs(f,'sin(x)',sym('y')) %
%（3）符号常数置换
f2=subs(f,{a,x},{2,sym(pi/3)}) %
%（4）双精度数值置换
f3=sub
www.eeworm.com/read/334860/12568485
m solve.m
function varargout = solve(varargin)
%求各种类型方程组的解析解,
%当找不到解析解时,将自动寻求原点附近的一个近似解, 并可达任意精度.
%用法
% solve('方程1','方程2',...,'方程N','变量1','变量2',...,'变量M')
%SOLVE Symbolic solution of algebraic equation
www.eeworm.com/read/147001/12594410
m min_f.m
function y = min_F(x,s_k)
%MIN_F Summary of this function goes here
% Detailed explanation goes here
% 一维搜索,黄金分割法
a=0;
b=50;
l=0.000001;%终止精度
s_temp=s_k.';
x1=a+0.382*(b-a);
x2=a+b-x1;
whil
www.eeworm.com/read/147001/12594421
asv desend.asv
format long %Scaled fixed point format, with 15 digits for double; 8 digits for single.
x=[0,0];
x=input('请输入初始值[x0,x1]=');
s=input('请输入初始精度s＝');
g=D_F(x);
g=g.';%转置为列向量；
while(norm(g)>s)
www.eeworm.com/read/147001/12594424
asv min_f.asv
function y = min_F(x,s_k)
%MIN_F Summary of this function goes here
% Detailed explanation goes here
% 一维搜索,黄金分割法
a=0;
b=50;
l=0.000001;%终止精度
s_temp=s_k.';
x1=a+0.382*(b-a);
x2=a+b-x1;
whil
www.eeworm.com/read/238345/13892100
cpp lvbo.cpp
#include"stdio.h"
#include"math.h"
#include"stdlib.h"
#define PI 3.1415926
/*双精度型的一维数组，输入（输出）信号的实部和虚部*/
/*m0:2 的次方数，FFT的点数nfft＝2m0*/
/*inv= 1 forward transform, inv = -1 inverse transform*/
voi
www.eeworm.com/read/134838/13973219
txt 新建 文本文档.txt
#include
#include
/*黄金分割法求最小值的C++程序，部分变量及函数书写并不规范*/
//δ为题给精度
int n = (lnδ/ln0.618 + 1) + 1;
int i;
float f(float ai, float bi)
{
a(i + 1) = ai + 0.618(bi - ai);
return