A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation
The authors study the double discrete Legendre-Fenchel transform (LFT) to approximate the convex envelope of a given function. The first part of this paper presents the convergence results on the double discrete LFT in the multivariate case which use [\textit{L. Corrias}, SIAM J. Numer. Anal. 33, No. 4, 1534--1558 (1996; Zbl 0856.49023)] as a starting point. The convergence proof requires the study of the dual grid on which the second discrete LFT is applied; its choice has great impact on the accuracy of the resulting approximation of the convex envelope. In the second part, the authors give an improvement (both in time and accuracy) of the standard algorithm based on a change in the factorization order for the second discrete LFT. Another improvement consists in merging (through a maximum operation ) the results obtained after the two possible changes in the factorization order. The numerical results illustrating the benefits of the proposed approach are presented. An efficient handling of dual grids of arbitrary length is devised. In the last part, the authors apply the algorithm to the study of phase separation in non-ideal ionic solutions.
- A fast computational algorithm for the Legendre-Fenchel transform
- Faster than the fast Legendre transform, the linear-time Legendre transform
- scientific article; zbMATH DE number 1284007
- A fast Legendre transform algorithm and applications to the adhesion model
- Numerical solution method for the \(\overline\partial\)-equation in the plane
- A fast FFT-based discrete Legendre transform
- A Generalized Fast Multipole Method for Nonoscillatory Kernels
- Multigrid methods for linear equations diagonalized by GFT
- Fast Moreau envelope computation I: Numerical algorithms
- Nonlinear multigrid method for solving the LLT model
- COMPUTING THE CONVEX ENVELOPE USING A NONLINEAR PARTIAL DIFFERENTIAL EQUATION
- Convex Analysis
- Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis
- Convex parametric piecewise quadratic optimization: theory and algorithms
- Fast Legendre–Fenchel Transform and Applications to Hamilton–Jacobi Equations and Conservation Laws
- Faster than the fast Legendre transform, the linear-time Legendre transform
- scientific article; zbMATH DE number 4092631 (Why is no real title available?)
- Lipschitz r-continuity of the approximative subdifferential of a convex function.
- Mathematical study of non-ideal electrostatic correlations in equilibrium electrolytes
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Pressure laws and fast Legendre transform
- The convex envelope is the solution of a nonlinear obstacle problem
- The quickhull algorithm for convex hulls
- What shape is your conjugate? A survey of computational convex analysis and its applications
- A fast computational algorithm for the Legendre-Fenchel transform
- Computation of the epsilon-subdifferential of convex piecewise linear-quadratic functions in optimal worst-case time
- An analysis of the unified formulation for the equilibrium problem of compositional multiphase mixtures
- Linear-time convexity test for low-order piecewise polynomials
- Compensated convex-based transforms for image processing and shape interrogation
- Computational polyconvexification of isotropic functions
- Closest univariate convex linear-quadratic function approximation with minimal number of pieces
- Fast Moreau envelope computation I: Numerical algorithms
This page was built for publication: A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2515072)
