scientific article

zbMath0667.65006MaRDI QIDQ3819868

Yann Brenier

Publication date: 1989

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

fast Fourier transformrecursive algorithmcomputational costdiscrete Legendre-Fenchel transform

Mathematics Subject Classification ID

Algorithms for approximation of functions (65D15)

Related Items (17)

Graph-Matrix Calculus for Computational Convex Analysis ⋮ Fast weak–KAM integrators for separable Hamiltonian systems ⋮ The piecewise linear-quadratic model for computational convex analysis ⋮ A fast Legendre transform algorithm and applications to the adhesion model ⋮ Computing the conjugate of convex piecewise linear-quadratic bivariate functions ⋮ Fast Moreau envelope computation I: Numerical algorithms ⋮ Generalizing Hopf and Lax-Oleĭnik formulae via conjugate integral ⋮ Convex hull algorithms for piecewise linear-quadratic functions in computational convex analysis ⋮ On numerical approximation of the Hamilton-Jacobi-transport system arising in high frequency approximations ⋮ Computing the partial conjugate of convex piecewise linear-quadratic bivariate functions ⋮ Global optimization via α‐dense curves ⋮ Numerical Schemes for Conservation Laws via Hamilton-Jacobi Equations ⋮ Techniques and Open Questions in Computational Convex Analysis ⋮ A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation ⋮ Relaxation models of phase transition flows ⋮ The convex envelope is the solution of a nonlinear obstacle problem ⋮ Semi-Lagrangian schemes for Hamilton-Jacobi equations, discrete representation formulae and Godunov methods

This page was built for publication: