代码搜索：Definite
找到约 349 项符合「Definite」的源代码
代码结果 349
www.eeworm.com/read/323600/13334365
java choleskydecomposition.java
package Jama;
/** Cholesky Decomposition.
For a symmetric, positive definite matrix A, the Cholesky decomposition
is an lower triangular matrix L so that A = L*L'.
If
www.eeworm.com/read/262063/11608334
m cholesky.m
function C=Cholesky(A)
%Cholesky Cholesky factoruization of a symmetric,positive definite matrix
%
%synopsis: C=Cholesky(A)
%
%Input: A=symmetric positive dedinite matrive
%
%Output: C=upper tr
www.eeworm.com/read/158370/11622849
cpp 2vi.cpp
// CALCVOL3.cpp Program to calc. sphere volumes using
// a definite loop for 5 iterations
#include
void main()
{ float radius, volume, count;
cout
www.eeworm.com/read/155424/11874667
java choleskydecomposition.java
package Jama;
/** Cholesky Decomposition.
For a symmetric, positive definite matrix A, the Cholesky decomposition
is an lower triangular matrix L so that A = L*L'.
If
www.eeworm.com/read/253870/12179451
m lqdelay.m
function [C,D0,D1,D2]=lqdelay(A0,A1,B,delay,M,N)
%LQDELAY calculates coefficients of the explicit solution
% of the linear quadratic regulator problem for systems with delays.
%
% For the syst
www.eeworm.com/read/148707/12436688
cpp 2vi.cpp
// CALCVOL3.cpp Program to calc. sphere volumes using
// a definite loop for 5 iterations
#include
void main()
{ float radius, volume, count;
cout
www.eeworm.com/read/128685/14282104
java choleskydecomposition.java
package Jama;
/** Cholesky Decomposition.
For a symmetric, positive definite matrix A, the Cholesky decomposition
is an lower triangular matrix L so that A = L*L'.
If
www.eeworm.com/read/162614/5524458
a cc51b03.a
-- CC51B03.A
--
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025,
www.eeworm.com/read/428167/8886026
m isposdef.m
function b = isposdef(a)
% ISPOSDEF Test for positive definite matrix.
% ISPOSDEF(A) returns 1 if A is positive definite, 0 otherwise.
% Using chol is much more efficient than computing eig
www.eeworm.com/read/427909/8913491
m isposdef.m
function b = isposdef(a)
% ISPOSDEF Test for positive definite matrix.
% ISPOSDEF(A) returns 1 if A is positive definite, 0 otherwise.
% Using chol is much more efficient than computing eig