Search references for TRIANGULAR DECOMPOSITION. Phrases containing TRIANGULAR DECOMPOSITION
See searches and references containing TRIANGULAR DECOMPOSITION!TRIANGULAR DECOMPOSITION
Algorithm on systems of polynomials
In computer algebra, a triangular decomposition of a polynomial system S is a set of simpler polynomial systems S1, ..., Se such that a point is a solution
Triangular_decomposition
Matrix decomposition
In linear algebra, a QR decomposition, also known as a QR factorization or QU factorization, is a decomposition of a matrix A into a product A = QR of
QR_decomposition
Matrix decomposition method
linear algebra, the Cholesky decomposition or Cholesky factorization (pronounced /ʃəˈlɛski/ shə-LES-kee) is a decomposition of a Hermitian, positive-definite
Cholesky_decomposition
Type of matrix factorization
lower–upper (LU) decomposition or factorization factors a matrix as the product of a lower triangular matrix and an upper triangular matrix (see matrix
LU_decomposition
Matrix factorisation in mathematics
In linear algebra, the Schur decomposition or Schur triangulation, named after Issai Schur, is a matrix decomposition. It allows one to write an arbitrary
Schur_decomposition
Representation of a matrix as a product
can be decomposed via the LU decomposition. The LU decomposition factorizes a matrix into a lower triangular matrix L and an upper triangular matrix U
Matrix_decomposition
Special kind of square matrix
By the LU decomposition algorithm, an invertible matrix may be written as the product of a lower triangular matrix L and an upper triangular matrix U if
Triangular_matrix
Type of matrix factorization
the Crout matrix decomposition is an LU decomposition which decomposes a matrix into a lower triangular matrix (L), an upper triangular matrix (U) and,
Crout_matrix_decomposition
Mathematical process dealing with Lie groups
written as a product of an orthogonal matrix and an upper triangular matrix (QR decomposition, a consequence of Gram–Schmidt orthogonalization). It is
Iwasawa_decomposition
Type of matrix factorization
a Block LU decomposition is a matrix decomposition of a block matrix into a lower block triangular matrix L and an upper block triangular matrix U. This
Block_LU_decomposition
Roots of multiple multivariate polynomials
roots. This is a notable difference with triangular decompositions (even the equiprojectable decomposition), which, in general, do not preserve multiplicities
System of polynomial equations
System_of_polynomial_equations
Mathematical term
maximal torus of B {\displaystyle B} . The Bruhat decomposition of G {\displaystyle G} is the decomposition G = B W B = ⨆ w ∈ W B w B {\displaystyle G=BWB=\bigsqcup
Bruhat_decomposition
Orthonormalization of a set of vectors
a full column rank matrix yields the QR decomposition (it is decomposed into an orthogonal and a triangular matrix). The vector projection of a vector
Gram–Schmidt_process
algebra, the complete orthogonal decomposition is a matrix decomposition. It is similar to the singular value decomposition, but typically somewhat cheaper
Complete orthogonal decomposition
Complete_orthogonal_decomposition
Matrix decomposition
polar decomposition, and is a common means for implementing low-rank approximation for matrices. Specifically, the singular value decomposition of an
Singular_value_decomposition
Monster and modular connection
substantially shortened by replacing the usual triangular decomposition of the Monster Lie algebra with a decomposition into a sum of gl2 and two free Lie algebras
Monstrous_moonshine
differential equations. In 1993 he proposed an elimination method for triangular decomposition of polynomial systems, which has been referred to as Wang's method
Wang_Dongming_(academic)
Part of algebraic geometry devoted to the elimination of variables between polynomials
Buchberger's algorithm Faugère's F4 and F5 algorithms Resultant Triangular decomposition Main theorem of elimination theory Israel Gelfand, Mikhail Kapranov
Elimination_theory
Type of triangular sets of polynomial
to a triangular system via Gaussian elimination. For the non-linear case, given a polynomial system F over a field, one can convert (decompose or triangularize)
Regular_chain
Matrix decomposition
factorized is a normal or real symmetric matrix, the decomposition is called "spectral decomposition", derived from the spectral theorem. A nonzero vector
Eigendecomposition of a matrix
Eigendecomposition_of_a_matrix
for positive definite polynomial matrices. This decomposition also relates to the Cholesky decomposition for scalar matrices A = L L ∗ {\displaystyle A=LL^{*}}
Polynomial matrix spectral factorization
Polynomial_matrix_spectral_factorization
Field of mathematics
is a reason to favour matrix decomposition methods like using the singular value decomposition. Some matrix decomposition methods may be unstable, but
Numerical_linear_algebra
particular kind of triangular system of multivariate polynomials over a real closed field. Regular chains and triangular decompositions are fundamental and
Regular_semi-algebraic_system
A Coxeter decomposition of a polygon is a decomposition into a finite number of polygons in which any two sharing a side are reflections of each other
Coxeter decompositions of hyperbolic polygons
Coxeter_decompositions_of_hyperbolic_polygons
Result about when a matrix can be diagonalized
spaces. The spectral theorem also provides a canonical decomposition, called the spectral decomposition, of the underlying vector space on which the operator
Spectral_theorem
Algorithm to calculate eigenvalues
basic idea is to perform a QR decomposition, writing the matrix as a product of an orthogonal matrix and an upper triangular matrix, multiply the factors
QR_algorithm
basis Regular chain Triangular decomposition Sturm's theorem Descartes's rule of signs Carlitz–Wan conjecture Polynomial decomposition, factorization under
List_of_polynomial_topics
Algebraic study of differential equations
independent variables can express the differential equations. Using triangular decomposition and elimination order, it may be possible to solve the differential
Differential_algebra
Jordan–Chevalley decomposition of an element in algebraic group as a product of semisimple and unipotent elements The Bruhat decomposition G=BWB of a semisimple
Lie_group_decomposition
Matrix B such that B² equals a given matrix A
regardless of diagonalizability, has a Schur decomposition given by A=QUQ∗ where U is upper triangular and Q is unitary (meaning Q∗=Q−1). The eigenvalues
Square_root_of_a_matrix
Canadian mathematician
Press 1991 vol. 1 books.google with Pianzola: Lie algebras with triangular decompositions, Canadian Mathematical Society Series, John Wiley 1995 with Baake
Robert_Moody
Universal construction of a complex Lie group from a real Lie group
subgroup TC N+, the Gauss decomposition is also a consequence of the more precise Bruhat decomposition G𝐂=⋃σ∈WBσB, decomposing GC into a disjoint union
Complexification_(Lie_group)
Numbers arranged in a triangle
In mathematics and computing, a triangular array of numbers, polynomials, or the like, is a doubly indexed sequence in which each row is only as long as
Triangular_array
Property of a mathematical matrix
other decompositions M=B∗B. Some authors use the name square root and M12 for any such decomposition, or specifically for the Cholesky decomposition, or
Definite_matrix
American linguist
Gradual and triangular decomposition of the magical formula "Abracadabra"
E._E._Rehmus
1)-matrix Bohemian matrices Matrix decomposition Cholesky decomposition LU decomposition QR decomposition Polar decomposition Reducing subspace Spectral theorem
Outline_of_linear_algebra
Algorithm for solving systems of polynomial equations
characteristic set is a finite set of polynomials in triangular form of an ideal. This triangular set satisfies certain minimal condition with respect
Wu's method of characteristic set
Wu's_method_of_characteristic_set
Square of a triangular number
times a triangular number, from which it follows that the sum of all the rows is the square of a triangular number. Alternatively, one can decompose the table
Squared_triangular_number
of multivariate time series analysis, a variance decomposition or forecast error variance decomposition (FEVD) is used to aid in the interpretation of a
Variance decomposition of forecast errors
Variance_decomposition_of_forecast_errors
Real square matrix whose columns and rows are orthogonal unit vectors
important matrix decompositions involve orthogonal matrices, including especially: QR decomposition M = QR, Q orthogonal, R upper triangular Singular value
Orthogonal_matrix
Matrix equal to its transpose
of a symmetric and a skew-symmetric matrix. This decomposition is known as the Toeplitz decomposition. Let Matn denote the space of n×n matrices. If Symn
Symmetric_matrix
Name of two different techniques based on the singular value decomposition
generalized singular value decomposition (GSVD) is the name of two different techniques based on the singular value decomposition (SVD). The two versions
Generalized singular value decomposition
Generalized_singular_value_decomposition
Matrix that commutes with its conjugate transpose
decomposition which holds for all square matrices. Let A be a square matrix. Then by Schur decomposition it is unitary similar to an upper-triangular
Normal_matrix
Mathematical study of linear operators
spectral theorem also provides a canonical decomposition, called the spectral decomposition, eigenvalue decomposition, or eigendecomposition, of the underlying
Operator_theory
Oaxacan nixtamalized corn flatbread
Totopo, in Mexican cuisine, is a flat, round, or triangular corn item similar to a tortilla, that has been toasted, fried or baked, and prepared with nixtamalized
Totopo
Graph formed by subdivision of triangles
MR 1045921 Elcock, E. W.; Gargantini, I.; Walsh, T. R. (1987), "Triangular decomposition", Image and Vision Computing, 5 (3): 225–231, doi:10.1016/0262-8856(87)90053-9
Apollonian_network
equations are easily solved as R is upper triangular. An alternative decomposition of X is the singular value decomposition (SVD) X = U Σ V T {\displaystyle
Numerical methods for linear least squares
Numerical_methods_for_linear_least_squares
In mathematics, invariant of square matrices
are referred to as decomposition methods. Examples include the LU decomposition, the QR decomposition or the Cholesky decomposition (for positive definite
Determinant
Polyhedron defined by two triangles and three trapezoid faces
equal in length, and the triangular faces are perpendicular to the rectangular base. Wedges can be created from decomposition of other polyhedra. For instance
Wedge_(geometry)
Japanese economist
David Simpson used an algorithm he developed to identify block triangularity (decomposability of input-output matrices) in the input-output tables of Japan
Jinkichi_Tsukui
Type of plane partition
Georgy Voronoy, and is also called a Voronoi tessellation, a Voronoi decomposition, a Voronoi partition, or a Dirichlet tessellation (after Peter Gustav
Voronoi_diagram
Most widely known generalized inverse of a matrix
QR decomposition of A may be used instead. Consider the case when A is of full column rank, so that A+=(A∗A)−1A∗. Then the Cholesky decomposition A∗A=R∗R
Moore–Penrose_inverse
Kind of square matrix in linear algebra
superdiagonal. They are named after Karl Hessenberg. A Hessenberg decomposition is a matrix decomposition of a matrix A {\displaystyle A} into a unitary matrix P
Hessenberg_matrix
Vector satisfying some of the criteria of an eigenvector
functions of nondiagonalizable matrices. (See Matrix function#Jordan decomposition.) Consider the problem of solving the system of linear ordinary differential
Generalized_eigenvector
Algebraic term
diagonal matrix and an upper triangular one, which is (more or less) the multiplicative version of the Jordan–Chevalley decomposition. There is also a version
Unipotent
Signal analysis tool
result of the empirical mode decomposition (EMD) and the Hilbert spectral analysis (HSA). The HHT uses the EMD method to decompose a signal into so-called
Hilbert–Huang_transform
Concept in numerical linear algebra
A = L U {\displaystyle A=LU} , with L lower unitriangular and U upper triangular. One then solves L y = b {\displaystyle Ly=b} , U x = y {\displaystyle
Incomplete_LU_factorization
Matrix defined using smaller matrices called blocks
tridiagonal matrices (see also Block LU decomposition). An n×n matrix A is upper block triangular (or block upper triangular) if there are positive integers n1
Block_matrix
Form of a matrix indicating its eigenvalues and their algebraic multiplicities
form Frobenius normal form Jordan matrix Jordan–Chevalley decomposition Matrix decomposition Modal matrix Weyr canonical form Shilov defines the term Jordan
Jordan_normal_form
Matrix with shifting rows
matrix can also be decomposed (i.e. factored) in O(n2) time. The Bareiss algorithm for an LU decomposition is stable. An LU decomposition gives a quick method
Toeplitz_matrix
Type of group and algebra representation
reducible but also decomposable. Notice: Even if a representation is reducible, its matrix representation may still not be the upper triangular block form. It
Irreducible_representation
Bipartite non-Hamiltonian polyhedral graph
of a polyhedral graph for which the medial graph has no Hamiltonian decomposition into two edge-disjoint Hamiltonian cycles. The medial graph of the Herschel
Herschel_graph
Four-dimensional analog of the icosahedron
an octahedron as in the honeycomb, fits a triangular bipyramid composed of two tetrahedra. This decomposition of the 600-cell has symmetry [10,2+,10],
600-cell
Orthogonal matrix
LDU decomposition of a Hadamard matrix. The ones in the triangular matrices form Sierpinski triangles. The entries of the diagonal matrix are values from
Walsh_matrix
Shape in hyperbolic geometry
way. The Epstein–Penner decomposition, a construction of D. B. A. Epstein and R. C. Penner (1988), can be used to decompose any cusped hyperbolic 3-manifold
Ideal_polyhedron
Generalization of gamma distribution to multiple dimensions
parameter α. Sampling Classical β=1,2,4. Bartlett's decomposition gives 𝐗=𝐋𝐀𝐀T𝐋T with 𝐀 lower-triangular having chi/normal entries, yielding LOE/LUE/LSE
Wishart_distribution
Shape with six sides
evenly many sides, in which case the parallelograms are all rhombi. This decomposition of a regular hexagon is based on a Petrie polygon projection of a cube
Hexagon
Figurate number
A pentagonal number is a figurate number that extends the concept of triangular and square numbers to the pentagon, but, unlike the first two, the construction
Pentagonal_number
Elementary cellular automaton
configuration remains random at each time step. Its time-space diagram forms many triangular "windows" of different sizes, patterns that form when a consecutive row
Rule_90
Matrix decomposition in mathematics
factorization or Birkhoff decomposition, introduced by George David Birkhoff (1909), is a generalization of the LU decomposition (i.e. Gauss elimination)
Birkhoff_factorization
Set of quantum operations
more than O(n2/log(n)) gates. Here, reference reports an 11-stage decomposition -H-C-P-C-P-C-H-P-C-P-C-, where H, C, and P stand for computational stages
Clifford_group
Type of figurate number
properties of oblong, triangular, and square numbers. The number 10 for example, can be arranged as a triangle (see triangular number): But 10 cannot
Polygonal_number
Numbers obtained by adding the two previous ones
998999=1000998999=000.001001002003005008013…. The partial fraction decomposition is given by s(z)=15(11−φz−11−ψz) where φ=12(1+5) is the golden ratio
Fibonacci_sequence
Matrix with two nonzero diagonals
(2010-12-11). "Matrix operations and decompositions — Other operations on general matrices — SVD decomposition". ALGLIB User Guide, ALGLIB Project. Accessed:
Bidiagonal_matrix
Fuzzy logic concept
In mathematics, a t-norm (also T-norm or, unabbreviated, triangular norm) is a kind of binary operation used in the framework of probabilistic metric spaces
T-norm
Regular object in four dimensional geometry
six meeting at each vertex, and three at each edge. Together, it has 96 triangular faces, 96 edges, and 24 vertices. Like other four-dimensional regular
24-cell
Iterative method used to solve a linear system of equations
where: 𝐓=−𝐋−1𝐔and𝐜=𝐋−1𝐛. Decompose 𝐀 into the sum of a lower triangular component 𝐋 and a strict upper triangular component U: 𝐋=[1607−11]and𝐔=[0300]
Gauss–Seidel_method
Approach to the study of finite semigroups and automata
explicitly refer to their theorem as a "prime decomposition theorem" for automata. The components in the decomposition, however, are not prime automata (with
Krohn–Rhodes_theory
Polynomial whose roots are the eigenvalues of a matrix
Jordan decomposition theorem guarantees that any square matrix A can be decomposed as A=S−1US, where S is an invertible matrix and U is upper triangular with
Characteristic_polynomial
Coefficients in angular momentum eigenstates of quantum systems
particularly of compact Lie groups, to perform the explicit direct sum decomposition of the tensor product of two irreducible representations (i.e., a reducible
Clebsch–Gordan_coefficients
Software library for numerical linear algebra
value decomposition. It also includes routines to implement the associated matrix factorizations such as LU, QR, Cholesky and Schur decomposition. The
LAPACK
Branch of algebraic geometry
questions are involved in the Bruhat decomposition and classification of parabolic subgroups (as block triangular matrices). Schubert calculus can be constructed
Schubert_calculus
Matrix decomposition
a matrix decomposition, which is typically used in gradient based optimization algorithms or for solving nonlinear systems. The decomposition uses a low-rank
Compact quasi-Newton representation
Compact_quasi-Newton_representation
Algorithm for solving systems of linear equations
useful to analyze the algorithm, is that row reduction produces a matrix decomposition of the original matrix. The elementary row operations may be viewed
Gaussian_elimination
Array of numbers
matrix decomposition or matrix factorization techniques. These techniques are of interest because they can make computations easier. The LU decomposition factors
Matrix_(mathematics)
Compact Riemann surface of genus 3
9833047820988736. The Klein quartic can be decomposed into four pairs of pants by cutting along six of its systoles. This decomposition gives a symmetric set of Fenchel-Nielsen
Klein_quartic
Approximation method in statistics
easily solved as R is upper triangular. A variant of the method of orthogonal decomposition involves singular value decomposition, in which R is diagonalized
Non-linear_least_squares
illustrated by semisimple rings. More exotic examples include the upper triangular matrices over a division ring Tn D, and the group ring F [ G ] {\displaystyle
Serial_module
Algorithm in numerical linear algebra
algorithm. The Hessenberg–Schur algorithm replaces the decomposition R=UTAU in step 1 with the decomposition H=QTAQ, where H is an upper-Hessenberg matrix. This
Bartels–Stewart_algorithm
(Mathematical) decomposition into a product
one generally considers the "LUP decomposition" having a permutation matrix as its third factor. See Matrix decomposition for the most common types of matrix
Factorization
Mathematical optimization algorithm
Cholesky decomposition of the preconditioner must be used to keep the symmetry (and positive definiteness) of the system. However, this decomposition does
Conjugate_gradient_method
Number divisible only by 1 and itself
be uniquely expressed as a connected sum of prime knots. The prime decomposition of 3-manifolds is another example of this type. Beyond mathematics and
Prime_number
Matrix equal to its conjugate-transpose
matrices also appear in techniques like singular value decomposition (SVD) and eigenvalue decomposition. In statistics and machine learning, Hermitian matrices
Hermitian_matrix
Concepts from linear algebra
orthogonal decomposition of a PSD matrix is used in multivariate analysis, where the sample covariance matrices are PSD. This orthogonal decomposition is called
Eigenvalues_and_eigenvectors
Topological invariant in mathematics
maps to the 2-sphere, such that a connected graph maps to a polygonal decomposition of the sphere, which has Euler characteristic 2. This viewpoint is implicit
Euler_characteristic
Concept in linear algebra
{\displaystyle Q\,R} decomposition. Here the submatrix T i − 1 U {\displaystyle T_{i-1}^{U}} is an i-1 x i-1 square upper triangular matrix, 0 represents
Householder_transformation
Numerical methods for matrix eigenvalue calculation
have all real eigenvalues without being Hermitian. For example, a real triangular matrix has its eigenvalues along its diagonal, but in general is not symmetric
Eigenvalue_algorithm
Study of matrices and their algebraic properties
matrix, and is necessarily invertible. LU decomposition splits a matrix into a matrix product of an upper triangular matrix and a lower triangle matrix. Since
Matrix_analysis
Cloth bearing the alleged image of Jesus
potential source for amines required for the reaction is a decomposing body, and no signs of decomposition have been found on the Shroud. Rogers also notes that
Shroud_of_Turin
generalized factorizations) EVP – eigenvalue problems SVD – singular value decomposition GEVP – generalized EVP GSVD – generalized SVD Bochkanov, S., & Bystritsky
Comparison of linear algebra libraries
Comparison_of_linear_algebra_libraries
travel, tourism, insurance
TRIANGULAR DECOMPOSITION
TRIANGULAR DECOMPOSITION
Boy/Male
American, British, English
Battlefield; From the Triangular Field
Boy/Male
American, Anglo, Australian, British, Celtic, English, French, Gaelic, Irish, Scottish
Hill Near the Meadow; Triangular Hill; Hero; Large Fortification; Fortress
Boy/Male
English
From the triangular field.
Surname or Lastname
English
English : habitational name from a lost or unidentified minor place, possibly in East Anglia, where the name is most common, and probably so called from Old English gÄra ‘gore’, ‘triangular piece of land’ + wudu ‘wood’.
Surname or Lastname
English (Kent)
English (Kent) : apparently a habitational name from a lost or unidentified place, possibly so named from Old English gÄra ‘triangular piece of land’ + hÄm ‘homestead’.Born in England, John Gorham emigrated to MA and in 1643 married Desire Howland, daughter of John Howland, who came to America on the Mayflower. His descendant Nathaniel (1738–96) was born in Charlestown, MA, and was one of the signers of the Declaration of Independence.
Surname or Lastname
English
English : metonymic occupational name for a maker of garlands or chaplets, perhaps also a habitational name from a house sign. The word is first attested in the 14th century, from Old French, and appears to be of Germanic origin.English : habitational name from a minor place, such as Garland in Chulmleigh, Devon, named from Old English gÄra ‘triangular piece of land’ (see Gore) + land ‘cultivated land’, ‘estate’.
Male
English
English surname transferred to forename use, possibly originally a habitational name derived from a place named from Old Norse gafl, GABLE means "gable," a term used to denote a "triangular-shaped hill."Â
Surname or Lastname
English
English : probably a habitational name from a lost or unidentified place, generally from a field name denoting a triangular area, Old English gÄra (see Gore) at the corner of an open field after rectangular furlongs had been laid out.Jewish : Americanized form of one or more like-sounding Jewish surnames.U.S. President James Abram Garfield (1831–81) was preceded by at least six Garfields born in America, his immigrant ancestor having come to Massachusetts Bay with John Winthrop in 1630.
Boy/Male
African, American, Anglo, Australian, British, Christian, English, Jamaican
Battlefield; Spear Field; Triangular Field
Boy/Male
American, Australian, British, Christian, English, German
Hill Near Meadows; Triangular Hill; Spacious Fort
Boy/Male
American, Anglo, Australian, British, English
From the Triangle Shaped Settlement; Lives in the Triangular Farm Stead
Boy/Male
American, British, English
Lives in the Triangular Farm Stead
Boy/Male
Anglo, Australian, British, English, French
From the Cornered Hill; Hill Near Meadows; Triangular Hill
Boy/Male
English American
From the triangular field. From an Old English surname and place name, meaning 'field of spears'.
Surname or Lastname
English
English : habitational name from Garton in East Yorkshire or from various minor places so named, from Old English gÄra ‘triangular plot of land’ + tÅ«n ‘farmstead’.
Boy/Male
British, English
Spear; Wedge-shaped Object; Triangular Shaped Piece of Land
Girl/Female
American, Australian, Christian, Greek, Hebrew
Triangular River Mouth; Mouth of a River; Fourth Letter of Greek Alphabet; A Name for a Fourth Child; Fourth Letter of the Greek Alphabet
Boy/Male
English
Lives in the triangular farm stead.
Surname or Lastname
English
English : habitational name from any of various places, for example in Kent and Wiltshire, named Gore, from Old English gÄra ‘triangular piece of land’ (a derivative of gÄr ‘spear’, with reference to the triangular shape of a spearhead).French : nickname for a gluttonous and idle individual, from Old French gore ‘sow’ (of allegedly imitative origin, reflecting the grunting of the animal).
Boy/Male
American, Anglo, Australian, British, Chinese, Christian, Danish, English, French, German, Irish, Jamaican, Scottish
Hill Near the Meadow; From the Cornered Hill; Triangular Hill; Large Fortification; From the Marshes; One of Scotland's Great Clans; Spacious Fort
TRIANGULAR DECOMPOSITION
TRIANGULAR DECOMPOSITION
TRIANGULAR DECOMPOSITION
TRIANGULAR DECOMPOSITION
TRIANGULAR DECOMPOSITION
TRIANGULAR DECOMPOSITION
TRIANGULAR DECOMPOSITION
a.
Oblong or elongated, and having three lateral angles; as, a triangular seed, leaf, or stem.
n.
The quality or state of being triangular.
n.
A kind of triangular lyre or harp.
a.
Having three angles; having the form of a triangle.
n.
A kind of triangular spade.
n. pl.
The triangular, or maioid, crabs. See Illust. under Maioid, and Illust. of Spider crab, under Spider.
v. t.
To divide into triangles; specifically, to survey by means of a series of triangles properly laid down and measured.
a.
Designating several triangular muscles called scalene muscles.
n.
A solid having forty-eight equal triangular faces.
a.
Having three angles; triangular.
n.
A triangular chisel.
a.
Biangular.
p. pr. & vb. n.
of Triangulate
a.
Nearly, but not perfectly, triangular.
v.
A small traingular piece of land.
v. t.
To make triangular, or three-cornered.
a.
Biangular.
a.
Shaped like the Greek / (delta); delta-shaped; triangular.
imp. & p. p.
of Triangulate
adv.
In a triangular manner; in the form of a triangle.
travel, tourism, insurance