代码搜索：triangular
找到约 1,594 项符合「triangular」的源代码
代码结果 1,594
www.eeworm.com/read/492033/6430294
h plelemsubqt.h
#ifndef PLELEMSUBQT_H
#define PLELEMSUBQT_H
#include "alias.h"
struct matrix;
struct vector;
struct ivector;
/**
class planeelemsubqt defines plane triangular subparametric element
unknown f
www.eeworm.com/read/492033/6430389
h axisymlt.h
#ifndef AXISYMLT_H
#define AXISYMLT_H
#include "alias.h"
struct matrix;
struct vector;
struct ivector;
/**
class axisymlt defines triangular element for axisymmetric problems
JK
*/
class
www.eeworm.com/read/492033/6430452
h plelemlt.h
#ifndef PLELEMLT_H
#define PLELEMLT_H
#include "alias.h"
struct matrix;
struct vector;
struct ivector;
/**
class planeelemlt - defines plane triangular element with linear
approximation functi
www.eeworm.com/read/492033/6430566
h plelemqt.h
#ifndef PLELEMQT_H
#define PLELEMQT_H
#include "alias.h"
struct matrix;
struct vector;
struct ivector;
/**
class planeelemqt defines plane triangular element with quadratic
approximation funct
www.eeworm.com/read/410206/11298480
m refine.m
function [p,t,f] = refine(p,t,ti,f)
% REFINE: Refine triangular meshes.
%
% Quadtree triangle refinement is performed, with each triangle split into
% four sub-triangles. The new triangles are
www.eeworm.com/read/410206/11298542
m refine.m
function [p,t,f] = refine(p,t,ti,f)
% REFINE: Refine triangular meshes.
%
% Quadtree triangle refinement is performed, with each triangle split into
% four sub-triangles. The new triangles are
www.eeworm.com/read/367152/9780179
m lans_proj2tri.m
% lans_proj2tri - Project data onto a triangular patch in high-D space
%
% [se,np,idx] = lans_proj2tri(y,tri,tridx)
%
% _____OUTPUTS____________________________________________________________
%
www.eeworm.com/read/147096/12584080
m schord.m
function [Qo, To] = schord(Qi, Ti, index)
%SCHORD Ordered schur decomposition.
% [Qo, To] = schord(Qi, Ti, index) Given the square (possibly
% complex) upper-triangular matrix Ti and orthogonal m
www.eeworm.com/read/202680/15375929
m qrsteps.m
function [A,b] = qrsteps(A,b)
%QRSTEPS Orthogonal-triangular decomposition.
% Demonstrates M-file version of built-in QR function.
% R = QRSTEPS(A) is the upper trapezoidal matrix R that
% resu
www.eeworm.com/read/101557/15826566
m schord.m
function [Qo, To] = schord(Qi, Ti, index)
%SCHORD Ordered schur decomposition.
% [Qo, To] = schord(Qi, Ti, index) Given the square (possibly
% complex) upper-triangular matrix Ti and orthogonal m