代码搜索：Definite
找到约 349 项符合「Definite」的源代码
代码结果 349
www.eeworm.com/read/357136/10215696
m udut.m
function [U,D]=udut(R)
% function [U,D]=udut(R)
% Computes the Upper-Lower UDL decomposition of a
% symmetric positive definite matrix.
%
% Programmed by: Dimitris Manolakis, 1996
%
%---------
www.eeworm.com/read/469123/6977833
m solve_chol.m
% solve_chol - solve linear equations from the Cholesky factorization.
% Solve A*X = B for X, where A is square, symmetric, positive definite. The
% input to the function is R the Cholesky decompositi
www.eeworm.com/read/467759/7000677
m dualdiag.m
function [a,d]=dualdiag(w,b)
%DUALDIAG Simultaneous diagonalisation of two hermitian matrices [A,D]=(W,B)
% Given two hermitian matrices W and B with W positive definite, this routine
% calculates
www.eeworm.com/read/236873/7119115
m dualdiag.m
function [a,d]=dualdiag(w,b)
%DUALDIAG Simultaneous diagonalisation of two hermitian matrices [A,D]=(W,B)
% Given two hermitian matrices W and B with W positive definite, this routine
% calculates
www.eeworm.com/read/458010/7314260
m dualdiag.m
function [a,d]=dualdiag(w,b)
%DUALDIAG Simultaneous diagonalisation of two hermitian matrices [A,D]=(W,B)
% Given two hermitian matrices W and B with W positive definite, this routine
% calculates
www.eeworm.com/read/448350/7534485
m dualdiag.m
function [a,d]=dualdiag(w,b)
%DUALDIAG Simultaneous diagonalisation of two hermitian matrices [A,D]=(W,B)
% Given two hermitian matrices W and B with W positive definite, this routine
% calculates
www.eeworm.com/read/440750/7682243
m dualdiag.m
function [a,d]=dualdiag(w,b)
%DUALDIAG Simultaneous diagonalisation of two hermitian matrices [A,D]=(W,B)
% Given two hermitian matrices W and B with W positive definite, this routine
% calculates
www.eeworm.com/read/140700/13065919
txt alg066.txt
> restart;
> # CHOLESKI'S ALGORITHM 6.6
> #
> # To factor the positive definite n by n matrix A into LL**T,
> # where L is lower triangular.
> #
> # INPUT: the dimension n; entries A(I,J), 1
www.eeworm.com/read/140700/13066222
txt alg066.txt
> restart;
> # CHOLESKI'S ALGORITHM 6.6
> #
> # To factor the positive definite n by n matrix A into LL**T,
> # where L is lower triangular.
> #
> # INPUT: the dimension n; entries A(I,J), 1
www.eeworm.com/read/139007/13195409
m poldec.m
function [U, H] = poldec(A)
%POLDEC Polar decomposition.
% [U, H] = POLDEC(A) computes a matrix U of the same dimension
% (m-by-n) as A, and a Hermitian positive semi-definite mat