upper triangular造句

• The upper triangular matrices are precisely those that stabilize the standard flag.
• The M鯾ius transformations fixing  " are just the upper triangular matrices.
• A triangular matrix is one that is either lower triangular or upper triangular.
• The group \ Gamma would be the upper triangular matrices with integral coefficients.
• In fact Gaussian elimination shows there is a unique such that is upper triangular.
• Let be a normal upper triangular matrix.
• Let be the Borel subgroup of upper triangular matrices and the subgroup of diagonal matrices.
• It results in a " unit lower triangular " matrix and an upper triangular matrix.
• In the GL ( 3, 2 ) representation, a Sylow 2-subgroup consists of the upper triangular matrices.
• The Crout algorithm is slightly different and constructs a lower triangular matrix and a " unit upper triangular " matrix.
• Together these facts mean that the upper triangular matrices form a subalgebra of the associative algebra of square matrices for a given size.
• The Lie algebra of all upper triangular matrices is often referred to as a Borel subalgebra of the Lie algebra of all square matrices.
• The stabilizer subgroup of a complete flag is the set of invertible upper triangular matrices with respect to any basis adapted to the flag.
• I need a relatively simple procedure or algorithm for my purpose i . e . upper triangular but need not be a Jordan form.
• The matrix expressing with respect to is almost upper triangular, in the sense that the coefficients are the only nonzero sub-diagonal coefficients.
• As we mentioned, a necessary condition for a group to contain a lattice is that it be upper triangular matrices or the affine groups.
• Using these operations, a matrix can always be transformed into an upper triangular matrix, and in fact one that is in row echelon form.
• The LU decomposition factorizes a matrix into a lower triangular matrix " L " and an upper triangular matrix " U ".
• We transform the matrix " A " into an upper triangular matrix " U " by eliminating the entries below the main diagonal.
• Because I do not expect anything more than upper triangular matrices, the procedure is expected to be short and simple ( no vector subspaces are required ).