代码搜索:solves

找到约 1,488 项符合「solves」的源代码

代码结果 1,488
www.eeworm.com/read/407519/2262605

cpp main.cpp

// Copyright (C) 2007 Anders Logg. // Licensed under the GNU LGPL Version 2.1. // // First added: 2007-07-11 // Last changed: 2007-08-20 // // This demo program solves Poisson's equation // // -
www.eeworm.com/read/407519/2262682

cpp main.cpp

// Copyright (C) 2006 Anders Logg. // Licensed under the GNU LGPL Version 2.1. // // First added: 2006-05-24 // Last changed: 2006-08-21 // // This demo solves a simple model for cardiac excitation,
www.eeworm.com/read/393395/2474536

m fwblkslv.m

% FWBLKSLV Solves block sparse upper-triangular system. % y = fwblkslv(L,b) yields the same result as % y = L.L\b(L.perm,:) % However, FWBLKSLV is faster than the built-in operat
www.eeworm.com/read/393395/2474551

c fwdpr1.c

/* % y = fwdpr1(Lden, b) % FWDPR1 Solves "PROD_k L(pk,betak) * y = b", where % where L(p,beta) = eye(n) + tril(p*beta',-1). % % SEE ALS
www.eeworm.com/read/393395/2474586

m sparfwslv.m

% SPARFWSLV Solves block sparse upper-triangular system. % y = sparfwslv(L,b) yields the same result as % y = L.L\b(L.perm,:) % However, SPARFWSLV is faster than the built-in ope
www.eeworm.com/read/393395/2474613

m bwblkslv.m

% BWBLKSLV Solves block sparse upper-triangular system. % y = bwblkslv(L,b) yields the same result as % y(L.perm,:) = L.L'\b % However, BWBLKSLV is faster than the built-in opera
www.eeworm.com/read/393395/2474661

m sparbwslv.m

% SPARBWSLV Solves block sparse upper-triangular system. % y = sparbwslv(L,b) yields the same result as % y(L.perm,:) = L.L'\b % However, SPARBWSLV is faster than the built-in op
www.eeworm.com/read/381136/2649104

m gganders.m

function [alpha,theta,solution,minr,t,maxerr]=... gganders(MI,SG,J,tmax,stopCond,t,alpha,theta) % GGANDERS solves Generalized Anderson's task, generalized gradient. % [alpha,theta,solution,minr,t,m
www.eeworm.com/read/381136/2649108

m oanders.m

function [alpha,theta,solution,t,lambda,gamma,maxerr]=... oanders(MI,SIGMA,J,tmax,delta,t,lambda) % OANDERS solves the original Anderson's task, two Gaussians. % [alpha,theta,solution,t,lambda,gamm
www.eeworm.com/read/373460/2761970

m gganders.m

function [alpha,theta,solution,minr,t,maxerr]=... gganders(MI,SG,J,tmax,stopCond,t,alpha,theta) % GGANDERS solves Generalized Anderson's task, generalized gradient. % [alpha,theta,solution,minr,t,m