代码搜索:solves

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

代码结果 1,488
www.eeworm.com/read/235612/14060042

m levrec.m

function x=levrec(aa,b); % LEVREC: solve Tx=b using Levinson's recursion % % x=levrec(aa,b) % % This function solves the matrix equation Tx=b for the vector % x using Levinson recursion. The sy
www.eeworm.com/read/100612/15868975

c hilbert.c

/* * Solve set of linear equations involving * a Hilbert matrix * i.e. solves Hx=b, where b is the vector [1,1,1....1] * * Copyright (c) 1988-1997 Shamus Software Ltd. */ #include
www.eeworm.com/read/188426/8541254

m opf.m

function [bus, gen, branch, f, success, et] = opf(baseMVA, bus, gen, gencost, ... branch, Ybus, Yf, Yt, ref, pv, pq, mpopt) %OPF Solves an optimal power flow. % [bus, gen, branch, f, succes
www.eeworm.com/read/188426/8541279

m lpsetup.m

function [x, duals, idx_workc, idx_bindc] = LPsetup(a, f, b, nequs, vlb, vub, idx_workc, mpopt) % LPSOLVER solves a LP problem using a callable LP routine % The LP problem is defined as follows: %
www.eeworm.com/read/287351/8691356

html readme.html

Libsvm is a simple, easy-to-use, and efficient software for SVM classification and regression. It solves C-SVM classification, nu-SVM classification, one-class-SVM, epsilon-SVM regression, and nu-SVM
www.eeworm.com/read/386625/8734521

m pcgs.m

%PCGS Preconditioned conjugate gradient squared method % % [X,RESIDS,ITS]=PCGS(A,B,X0,RTOL,PRTOL,MAX_IT,MAX_TIME,MAX_MFLOP) % solves the system AX = B using the preconditioned conjuga
www.eeworm.com/read/386625/8734557

m pcg.m

%PCG Preconditioned conjugate gradient method % % [X,RESIDS,ITS]=PCG(A,B,X0,RTOL,PRTOL,MAX_IT,MAX_TIME,MAX_MFLOP) % solves the system AX = B using the preconditioned conjugate gradie
www.eeworm.com/read/385817/8787746

readme

Libsvm is a simple, easy-to-use, and efficient software for SVM classification and regression. It solves C-SVM classification, nu-SVM classification, one-class-SVM, epsilon-SVM regression, and nu-SVM
www.eeworm.com/read/428849/8835001

m gmnp.m

function [x,fval,stat] = gmnp(H,f,options) % GMNP Solves Generalized Minimal Norm Problem. % % Synopsis: % [x,fval,stat] = gmnp(H,f) % [x,fval,stat] = gmnp(H,f,options) % % Description: % The Gene
www.eeworm.com/read/428849/8835033

m~ gmnp.m~

function [x,fval,stat] = gmnp(H,f,options) % GMNP Solves Generalized Minimal Norm Problem. % % Synopsis: % [x,fval,stat] = gmnp(H,f) % [x,fval,stat] = gmnp(H,f,options) % % Description: % The Gene