代码搜索：triangular
找到约 1,594 项符合「triangular」的源代码
代码结果 1,594
www.eeworm.com/read/366142/2893115
mtx help.mtx
func chol
chol (X)
Returns the cholesky decomposition, B, of X, such that B*B' = X. B
will be lower triangular. X must be symmetric and positive definite.
func cols
cols (X)
Returns
www.eeworm.com/read/474471/6809869
m loop3.m
%LOOP3
% Creates triangular mesh for the helical antenna
% of given radius, number of turns, spacing, and
% wire thickness.
%
% LOOP3 has a somewhat better mesh quality than LOOP2
%
www.eeworm.com/read/393211/8303906
m loop3.m
%LOOP3
% Creates triangular mesh for the helical antenna
% of given radius, number of turns, spacing, and
% wire thickness.
%
% LOOP3 has a somewhat better mesh quality than LOOP2
%
www.eeworm.com/read/386253/8759863
m alg066.m
% 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/386253/8760070
m alg066.m
% 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/140697/13066771
m alg066.m
% 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/140697/13066945
m alg066.m
% 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/492033/6430351
h cct.h
#ifndef CCT_H
#define CCT_H
#include "alias.h"
struct matrix;
struct vector;
struct ivector;
/**
class cctelem defines triangular plate element with constant curvatures
based on the Mindlin th
www.eeworm.com/read/372550/9504022
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/365161/9876644
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