Results 221 to 230 of about 15,352,997 (261)

A fourth degree integration formula for the n-dimensional simplex

Applied Numerical Mathematics, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dan, Wei, Wang, Ren-Hong
openaire   +2 more sources

An inequality for n-dimensional sines of vertex angles of a simplex with some applications

Journal of Geometry, 1995
The \(n\)-dimensional sine \(S_i\) of the \(i\)-th vertex angle of a simplex, defined in 1978 by Eriksson, is the dimensionless value \((n!V)^{n - 1} \prod [(n - 1)! V_j]^{- 1}\), where \(V\) is the \(n\)-dimensional measure of the simplex, \(V_j\) is the \((n - 1)\)-dimensional measure of a face of the simplex containing the \(i\)-th vertex, and the ...
Yang, Shiguo, Wang, Jia
openaire   +2 more sources

Minimal Networks on the Regular n-Dimensional Simplex

Mathematical Notes, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On the construction and display of a polytopal mesh for the N-dimensional hypercube and (N + 1) simplex

Computers & Graphics, 1987
Abstract By considering the analytical properties of polytopes it is possible to design a general data structure, a polytopal mesh, to represent such N -dimensional objects. Further investigation of the N -dimensional hypercube leads to the construction of a ternary code for representing the hypercube and the interconnection between levels of the ...
Farzin Sobhanpanah, Ian O. Angell
openaire   +2 more sources

On multiple coverings byn-dimensional simplexes

Russian Mathematical Surveys, 1985
After introducing the notion of k-multiple special covering for n- dimensional polyhedra, it is shown that, in the particular case of an n- dimensional cube (n-dimensional simplex) the cardinality of such a covering is necessarily a multiple of n!k (a multiple of k).
openaire   +2 more sources

The Gergonne and Nagel centers of an n-dimensional simplex

Journal of Geometry, 2005
In contrast with the analogous situation for a triangle, the cevians that join the vertices of a tetrahedron to the points where the faces touch the insphere (or the exspheres) are not concurrent in general. This observation led the present author and P.
openaire   +1 more source

A Recursive Algorithm for Minimizing Non-Smooth Convex Function over n-Dimensional Simplex

AIP Conference Proceedings, 2008
A new method for solving constrained minimization problem when the feasible region is an n‐dimensional simplex is presented. This method generalizes a one‐dimensional bisection method for the case n>1 using a recursive procedure. The convergence of the method for the class of strictly convex functions is proved.
E. Y. Morozova, Alexander M. Korsunsky
openaire   +1 more source

Volume Like Elements of an $ n $-Dimensional Simplex in Non-Euclidean Spaces

Siberian Mathematical Journal
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bhattacharya, A., Dubey, K. K., Mondal, B.   +2 more
openaire   +1 more source

Ann-dimensional competitive Lotka Volterra system is generically determined by the edges of its carrying simplex

Nonlinearity, 2002
The results on classification of the quadratic edges obtained by \textit{E. C. Zeeman} [Nonlinearity 15, 1993-2018 (2002; Zbl 1017.37046)] are employed to demonstrate that higher-dimensional carrying simplices are generically determined (up to multiplication by a scalar) by their edges.
Zeeman, E. C., Zeeman, M. L.
openaire   +1 more source