代码搜索：refinement
找到约 474 项符合「refinement」的源代码
代码结果 474
www.eeworm.com/read/217557/14958769
m rauto_tran.m
function rauto_tran(continue)
% Update the transitions for the states in the new `approximating
% automaton` ( the automaton obtained after the refinement). Progress is
% saved in the global var
www.eeworm.com/read/201202/15413537
sci makeddbdryfilter.sci
function [LEFilt,REFilt] = MakeDDBdryFilter(D)
// MakeDDBdryFilter -- Edge filters, Interpolating (Deslauriers-Dubuc) Refinement
// Usage
// [LEFilt,REFilt] = MakeDDBdryFilter(D)
// Inputs
/
www.eeworm.com/read/386253/8759981
m alg074.m
% ITERATIVE REFINEMENT ALGORITHM 7.4
%
% To approximate the solution to the linear system Ax=b when A is
% suspected to be ill-conditioned:
%
% INPUT: The number of equations and unknowns n; the
www.eeworm.com/read/386253/8760174
m alg074.m
% ITERATIVE REFINEMENT ALGORITHM 7.4
%
% To approximate the solution to the linear system Ax=b when A is
% suspected to be ill-conditioned:
%
% INPUT: The number of equations and unknowns n; the
www.eeworm.com/read/244728/12847570
cxx cogdefault.cxx
#include "cog.hxx"
// This file contains the default implementations:
// - search for boundary continuation;
// - if below Delta the barycentre;
// - else refinement;
/*
cogIndex Cogeometry::Line(co
www.eeworm.com/read/140697/13066862
m alg074.m
% ITERATIVE REFINEMENT ALGORITHM 7.4
%
% To approximate the solution to the linear system Ax=b when A is
% suspected to be ill-conditioned:
%
% INPUT: The number of equations and unknowns n; the
www.eeworm.com/read/140697/13067059
m alg074.m
% ITERATIVE REFINEMENT ALGORITHM 7.4
%
% To approximate the solution to the linear system Ax=b when A is
% suspected to be ill-conditioned:
%
% INPUT: The number of equations and unknowns n; the