5 papers
Two-sided bounds for dihedral angle sums of path and 4-ball tetrahedra
Sergey Korotov, Michal Krizek
A tetrahedron is called a path tetrahedron, if it has three mutually orthogonal edges that do not intersect at a single point. A tetrahedron is called a 4-ball tetrahedron, if ther…
Explaining Deep Network Classification of Matrices: A Case Study on Monotonicity
Leandro Farina, Sergey Korotov
This work demonstrates a methodology for using deep learning to discover simple, practical criteria for classifying matrices based on abstract algebraic properties. By combining a…
The minimum angle condition for -simplices
Sergey Korotov, Jon Eivind Vatne
In this note we present a natural generalization of the minimum angle condition, commonly used in the finite element analysis for planar triangulations, to the case of simplicial m…
On generalizations of the Synge-Křížek maximum angle condition for -simplices
Ali Khademi, Sergey Korotov, Jon Eivind Vatne
In this note we present a generalization of the maximum angle condition, proposed by J. L. Synge in 1957 and M. Křížek in 1992 for triangular and tetrahedral elements, respectively…
Discrete maximum principles for nonlinear elliptic finite element problems on Riemannian manifolds with boundary
János Karátson, Balázs Kovács, Sergey Korotov
The maximum principle forms an important qualitative property of second order elliptic equations, therefore its discrete analogues, the so-called discrete maximum principles (DMPs)…