Results 151 to 160 of about 4,132 (306)
Fast Injective Mesh Parameterization via Beltrami Coefficient Prolongation
Abstract We present a highly efficient and robust method for free boundary injective parameterization of disk‐like triangle meshes with low isometric distortion. Harmonic function–based approaches, grounded in a strong mathematical framework, are widely employed.
G. Fargion, O. Weber
wiley +1 more source
Where convex cones meet tensor products : a dimension free perspective
This thesis explores the interplay between tensor products and convex cones, and their role in quantum theory. All general probabilistic theories, such as quantum theory, have a convex cone at their core, and the choice of tensor product of these cones ...
Eyden, Mirte van der
core +2 more sources
Smoothness and stability in the Alt-Phillips problem. [PDF]
Carducci M, Tortone G.
europepmc +1 more source
Critical angles in polyhedral convex cones: numerical and statistical considerations
International audienceThis work concerns the numerical computation of critical angles in polyhedral convex cones. The set of proper critical angles is evaluated explicitly by solving a series of generalized eigenvalue problems involving the generators of
Seeger, Alberto, Gourion, Daniel
core
Volume Quantization with Flexible Singularities for Hexahedral Meshing
Abstract We present a novel algorithm for quantization and subsequent hexahedral mesh generation from seamless volumetric maps. Quantization is the process of choosing integers that represent the numbers of hexahedral elements to be placed in each region of the volume, and transforming the seamless map into an integer‐grid map matching that choice ...
H. Brückler, M. Campen
wiley +1 more source
Rescaling and Asymptotic Acceleration in Unconstrained Quadratic Optimisation. [PDF]
Zverovich A, Hutchings M, Gauthier B.
europepmc +1 more source
Divisible convex sets with properly embedded cones
In this article we construct many examples of properly convex irreducible domains divided by Zariski dense relatively hyperbolic groups in every dimension at least 3. This answers a question of Benoist. Relative hyperbolicity and non-strict convexity are
Blayac, Pierre-Louis +3 more
core +1 more source
Progressively Projected Newton's Method
Abstract Newton's Method is widely used to find the solution of complex non‐linear simulation problems. To guarantee a descent direction, it is common practice to clamp the negative eigenvalues of each element Hessian prior to assembly—a strategy known as Projected Newton (PN)—but this perturbation often hinders convergence.
J. A. Fernández‐Fernández +2 more
wiley +1 more source
Generalized Legendre Transforms Have Roots in Information Geometry. [PDF]
Nielsen F.
europepmc +1 more source
Preference Structure Representation Using Convex Cones in Multicriteria Integer Programming
A new efficient system of representing the decision-maker's preference structure in solving multicriteria integer programming problems is developed. The problem is solved by an interactive branch-and-bound method that employs the procedure of Zionts and ...
R. Ramesh +2 more
core +1 more source

