代码搜索：triangular
找到约 1,594 项符合「triangular」的源代码
代码结果 1,594
www.eeworm.com/read/140697/13066813
m alg064.m
% DIRECT FACTORIZATION ALGORITHM 6.4
%
% To factor the n by n matrix A = (A(I,J)) into the product of the
% lower triangular matrix L = (L(I,J)) and the upper triangular
% matrix U = (U(I,J)), tha
www.eeworm.com/read/140697/13067001
m alg064.m
% DIRECT FACTORIZATION ALGORITHM 6.4
%
% To factor the n by n matrix A = (A(I,J)) into the product of the
% lower triangular matrix L = (L(I,J)) and the upper triangular
% matrix U = (U(I,J)), tha
www.eeworm.com/read/410206/11298479
m connectivity.m
function [e,te,e2t,bnd] = connectivity(p,t)
% CONNECTIVITY: Assemble connectivity data for a triangular mesh.
%
% The edge based connectivity is built for a triangular mesh and the
% boundary n
www.eeworm.com/read/410206/11298539
m connectivity.m
function [e,te,e2t,bnd] = connectivity(p,t)
% CONNECTIVITY: Assemble connectivity data for a triangular mesh.
%
% The edge based connectivity is built for a triangular mesh and the
% boundary n
www.eeworm.com/read/155657/11856752
cpp maptrian.cpp
//************************************************************************
//maptrian - partial update of lower triangular factor for a sym. matrix
//************************************************
www.eeworm.com/read/38039/1090271
mnu shelleltyp.mnu
SHELL#TYPE
#
Triangles
Triangular mesh
#
Quads
Quadrilateral mesh
#
www.eeworm.com/read/38039/1098068
mnu shelleltyp.mnu
SHELL#TYPE
#
Triangles
Triangular mesh
#
Quads
Quadrilateral mesh
#
www.eeworm.com/read/370333/9605495
m bz_irr1.m
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%%% discretization of irreducible Brillouin zone boundary (perimeter); here, example
%%% for triangular
www.eeworm.com/read/458661/7291939
m upulse.m
% upulse.m - generates trapezoidal, rectangular, triangular pulses, or a unit-step
%
% Usage: y = upulse(t,td,tr,tf) (trapezoidal pulse)
% y = upulse(t,0, tr,tf) (triangular pulse)
www.eeworm.com/read/441397/7671095
m qr.m
%QR Orthogonal-triangular decomposition.
% [Q,R] = QR(A) produces an upper triangular matrix R of the same
% dimension as A and a unitary matrix Q so that A = Q*R.
%
% [Q,R,E] = QR(A) pr