代码搜索：triangular
找到约 1,594 项符合「triangular」的源代码
代码结果 1,594
www.eeworm.com/read/207182/15280950
m lineartriangleelementarea.m
function y = LinearTriangleElementArea(xi,yi,xj,yj,xm,ym)
%LinearTriangleElementArea This function returns the area of the
% linear triangular element whose first
%
www.eeworm.com/read/207182/15280990
m quadtriangleelementarea.m
function y = QuadTriangleElementArea(x1,y1,x2,y2,x3,y3)
%QuadTriangleElementArea This function returns the area of the
% quadratic triangular element whose first
%
www.eeworm.com/read/207182/15280997
m lineartriangleassemble.m
function y = LinearTriangleAssemble(K,k,i,j,m)
%LinearTriangleAssemble This function assembles the element
% stiffness matrix k of the linear
% t
www.eeworm.com/read/168433/5446913
f,v mload.f,v
head 1.5;
access;
symbols;
locks; strict;
comment @* @;
1.5
date 96.03.27.23.59.51; author jaf; state Exp;
branches;
next 1.4;
1.4
date 96.03.26.19.16.53; author jaf; state Exp;
branches;
next 1.3;
www.eeworm.com/read/167185/5462103
c solchol.c
solchol(R,b,x,t,n)
/* R upper triangular from cholesky, b constants, x unknowns */
/* t is a temporary vector */
/* Mx+b=0 M=Rt*R */
register double R[],b[],*x,t[];
register int n;
{
register int k
www.eeworm.com/read/167185/5462218
c solchol.c
solchol(R,b,x,t,n)
/* R upper triangular from cholesky, b constants, x unknowns */
/* t is a temporary vector */
/* Mx+b=0 M=Rt*R */
register double R[],b[],*x,t[];
register int n;
{
register int k
www.eeworm.com/read/173076/9675439
m ltindex.m
% LTINDEX - Lower Triangular Index
% Copyright (c) 1998, Harvard University. Full copyright in the file Copyright
%
% [irow, icol] = ltindex(index, dim) ;
%
% If a lower triangular matrix is packed i
www.eeworm.com/read/172354/9712735
m slu.m
function [L,U] = slu(A)
%SLU Simple, square, LU factorization.
% [L,U] = SLU(A) for a square matrix A, illustrates the use of
% Gaussian elimination to compute a lower triangular matrix L
% and a
www.eeworm.com/read/172354/9712848
m slu.m
function [L,U] = slu(A)
%SLU Simple, square, LU factorization.
% [L,U] = SLU(A) for a square matrix A, illustrates the use of
% Gaussian elimination to compute a lower triangular matrix L
% and a
www.eeworm.com/read/367160/9769416
f dlauum.f
SUBROUTINE DLAUUM( UPLO, N, A, LDA, INFO )
*
* -- LAPACK auxiliary routine (version 3.1) --
* Univ. of Tennessee, Univ. of California Berkeley and NAG Ltd..
* November 2006
*
*