代码搜索：solves
找到约 1,488 项符合「solves」的源代码
代码结果 1,488
www.eeworm.com/read/228372/14387913
m dlyapsq.m
function v=dlyapsq(a,b)
% Solves the discrete Lyapunov equation AV'VA' - V'V +BB' =0
% V is upper triangular with real non-negative diagonal entries
% this is equivalent to v=chol(dlyap(a,b*b')) bu
www.eeworm.com/read/223158/14651467
m dlyapsq.m
function v=dlyapsq(a,b)
% Solves the discrete Lyapunov equation AV'VA' - V'V +BB' =0
% V is upper triangular with real non-negative diagonal entries
% this is equivalent to v=chol(dlyap(a,b*b')) bu
www.eeworm.com/read/215197/15070948
m dlyapsq.m
function v=dlyapsq(a,b)
% Solves the discrete Lyapunov equation AV'VA' - V'V +BB' =0
% V is upper triangular with real non-negative diagonal entries
% this is equivalent to v=chol(dlyap(a,b*b')) bu
www.eeworm.com/read/214970/15081640
m dlyapsq.m
function v=dlyapsq(a,b)
% Solves the discrete Lyapunov equation AV'VA' - V'V +BB' =0
% V is upper triangular with real non-negative diagonal entries
% this is equivalent to v=chol(dlyap(a,b*b')) bu
www.eeworm.com/read/457216/1599717
m contents.m
% Chapter 5: Duality
%
% qcqp.m - Section 5.2.4: Solves a simple QCQP
% matrix_games.m - Section 5.2.5: Mixed strategies for matrix games
% matrix_games_LP.m - Section 5.2.5: Mixed st
www.eeworm.com/read/455463/1613936
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/307266/3725997
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/307266/3726343
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/304358/3799803
m lipsol.m
function [xsol,fval,lambda,exitflag,output] = lipsol(f,Aineq,bineq,Aeq,beq,lb,ub,options,computeLambda)
%LIPSOL Linear programming Interior-Point SOLver.
% X = LIPSOL(f,A,b) will solves the Linea
www.eeworm.com/read/393395/2474626
c bwdpr1.c
/*
% y = bwdpr1(Lden, b)
% BWDPR1 Solves "PROD_k L(pk,betak)' * y = b", where
% L(p,beta) = eye(n) + tril(p*beta',-1).
%
% SEE ALSO