相关论文: The Area Method in the Wolfram Language

In this paper, we propose a unified algorithmic framework for solving many known variants of \mds. Our algorithm is a simple iterative scheme with guaranteed convergence, and is \emph{modular}; by changing the internals of a single…

We begin by studying the surface area of an ellipsoid in n-dimensional Euclidean space as the function of the lengths of the semi-axes. We write down an explicit formula as an integral over the unit sphere in n-dimensions and use this…

We reexamine Smale's alpha theory as a way to certify a numerical solution to an analytic system. For a given point and a system, Smale's alpha theory determines whether Newton's method applied to this point shows the quadratic convergence…

We consider the problem of computing toroidal area-preserving parameterizations of genus-one closed surfaces. We propose four algorithms based on Riemannian geometry: the projected gradient descent method, the projected conjugate gradient…

We presented a novel geometric interpretation of the Riemann-Liouville fractional integral. We found that a Riemann-Liouville integral can be thought of as the area obtained by summing together the area of an infinite number of…

The paper addresses a numerical method for solving second order elliptic partial differential equations that describe fields inside heterogeneous media. The scope is general and treats the case of rough coefficients, i.e. coefficients with…

Since the popularization of the Stiefel manifold for numerical applications in 1998 in a seminal paper from Edelman et al., it has been exhibited to be a key to solve many problems from optimization, statistics and machine learning. In…

We propose a new Riemannian gradient descent method for computing spherical area-preserving mappings of topological spheres using a Riemannian retraction-based framework with theoretically guaranteed convergence. The objective function is…

We present an area formula for continuous mappings between metric spaces, under minimal regularity assumptions. In particular, we do not require any notion of differentiability. This is a consequence of a measure theoretic notion of…

In [Heimann, Lehrenfeld, Preu{\ss}, SIAM J. Sci. Comp. 45(2), 2023, B139 - B165] new geometrically unfitted space-time Finite Element methods for partial differential equations posed on moving domains of higher-order accuracy in space and…

In this paper we present a spectral collocation method for the fast evaluation of the Landau collision operator for plasma physics, which allows us to obtain spectrally accurate numerical solutions. The method is inspired by the seminal…

Traditional manifold learning algorithms assumed that the embedded manifold is globally or locally isometric to Euclidean space. Under this assumption, they divided manifold into a set of overlapping local patches which are locally…

In order to find the spectrum associated with the one-dimensional Schr\"oodinger equation, we discuss the Lagrange Mesh method (LMM) and its numerical implementation for bound states. After presenting a general overview of the theory behind…

We study the problem of recovering a globally consistent Euclidean embedding of data, given only a local distance graph and propose a method that optimally represents these distances. The method operates solely on a neighborhood graph…

We consider the popular $k$-means problem in $d$-dimensional Euclidean space. Recently Friggstad, Rezapour, Salavatipour [FOCS'16] and Cohen-Addad, Klein, Mathieu [FOCS'16] showed that the standard local search algorithm yields a…

The acceleration of gradient-based optimization methods is a subject of significant practical and theoretical importance, particularly within machine learning applications. While much attention has been directed towards optimizing within…

Motivated by both concepts of R.J. Adler's recent work on utilizing Clifford algebra as the linear line element $ds = \left\langle \gamma_\mu \right\rangle dX^\mu $, and the fermionization of the cylindrical worldsheet Polyakov action, we…

It is shown that the generalized geometries may be obtained as a deformation of the proper Euclidean geometry. Algorithm of construction of any proposition S of the proper Euclidean geometry E may be described in terms of the Euclidean…

The existence of kinematic formulas for area measures with respect to any connected, closed subgroup of the orthogonal group acting transitively on the unit sphere is established. In particular, the kinematic operator for area measures is…

Inspired by the linear programming method developed by Cohn and Elkies (Ann. Math. 157(2): 689-714, 2003), we introduce a new linear programming method to solve the sphere packing problem. More concretely, we consider sequences of auxiliary…