代码搜索：solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/493738/6389908
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/492033/6430372
cpp slsolver.cpp
#include "slsolver.h"
#include "global.h"
#include "globmat.h"
#include "loadcase.h"
#include "gmatrix.h"
/**
function solves problems of linear stability
JK, 12.1.2003
*/
void solve_linear
www.eeworm.com/read/492033/6430499
cpp llssolver.cpp
#include "llssolver.h"
#include "global.h"
#include "globmat.h"
#include "loadcase.h"
#include "gmatrix.h"
#include "mechprint.h"
/**
function solves layered linear static problems
function
www.eeworm.com/read/485103/6564318
m fastnnls.m
function [x,w] = fastnnls(XtX,Xty,tol)
%FASTNNLS Fast version of built-in NNLS
% b = fastnnls(XtX,Xty) returns the vector b that solves X*b = y
% in a least squares sense, subject to b >= 0, give
www.eeworm.com/read/481257/6646672
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/481259/6646731
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/480713/6660092
m tridisolve.m
function x = tridisolve(a,b,c,d)
% TRIDISOLVE Solve tridiagonal system of equations.
% x = TRIDISOLVE(a,b,c,d) solves the system of linear equations
% b(1)*x(1) + c(1)*x(2) = d(1),
%
www.eeworm.com/read/410158/11300471
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/402171/11541534
m fcnnls.m
% M. H. Van Benthem and M. R. Keenan, J. Chemometrics 2004; 18: 441-450
%
% Given A and C this algorithm solves for the optimal
% K in a least squares sense, using that
% A = C*K
% in the
www.eeworm.com/read/347943/11626036
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