代码搜索：triangular
找到约 1,594 项符合「triangular」的源代码
代码结果 1,594
www.eeworm.com/read/393211/8303892
m loop1.m
%LOOP1
% Creates triangular mesh for the loop antenna of
% given radius and wire thickness
% The following parameters need to be specified:
%
% Loop radius in m a
www.eeworm.com/read/367152/9780192
m lans_ontriplane.m
% lans_ontriplane - Check if points project ONTO a triangular plane
%
% [marked,yproj,coef]= lans_ontriplane(y,tri);
%
% _____OUTPUTS____________________________________________________________
%
www.eeworm.com/read/386291/8757627
java stacktriangle.java
// stackTriangle.java
// evaluates triangular numbers, stack replaces recursion
// to run this program: C>java StackTriangleApp
import java.io.*; // for I/O
///////////////////////
www.eeworm.com/read/361402/10054448
java stacktriangle.java
// stackTriangle.java
// evaluates triangular numbers, stack replaces recursion
// to run this program: C>java StackTriangleApp
import java.io.*; // for I/O
///////////////////////
www.eeworm.com/read/358614/10183800
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/419623/10853375
m triag.m
function S = triag(A)
% TRIAG
% -----
% S=triag(A) uses a Householder transformation of the rectangular
% matrix A to produce a square and upper triangular matrix S with
% the property S*S
www.eeworm.com/read/447276/7555363
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/239763/13258110
java stacktriangle.java
// stackTriangle.java
// evaluates triangular numbers, stack replaces recursion
// to run this program: C>java StackTriangleApp
import java.io.*; // for I/O
///////////////////////
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/485014/6570784
java stacktriangle.java
// stackTriangle.java
// evaluates triangular numbers, stack replaces recursion
// to run this program: C>java StackTriangleApp
import java.io.*; // for I/O
///////////////////////