English
Related papers

Related papers: Optimal approximation of harmonic growth clusters …

200 papers

Variational approximation methods have proven to be useful for scaling Bayesian computations to large data sets and highly parametrized models. Applying variational methods involves solving an optimization problem, and recent research in…

Methodology · Statistics 2017-01-13 Victor M. -H. Ong , David J. Nott , Michael S. Smith

It is well-known that polynomial reproduction is not possible when approximating with Gaussian kernels. Quasi-interpolation schemes have been developed which use a finite number of Gaussians at different scales, which then reproduce…

Numerical Analysis · Mathematics 2020-01-24 Simon Hubbert , Jeremy Levesley

Basis adaptation in Homogeneous Chaos spaces rely on a suitable rotation of the underlying Gaussian germ. Several rotations have been proposed in the literature resulting in adaptations with different convergence properties. In this paper…

Nonconservative evolution problems describe irreversible processes and dissipative effects in a broad variety of phenomena. Such problems are often characterised by a conservative part, which can be modelled as a Hamiltonian term, and a…

Numerical Analysis · Mathematics 2025-05-12 Damiano Lombardi , Cecilia Pagliantini

This paper shows how to evolve numerically the maximum entropy probability distributions for a given set of constraints, which is a variational calculus problem. An evolutionary algorithm can obtain approximations to some well-known…

Methodology · Statistics 2020-02-07 Raul Rojas

The realization space of geometric constraint systems is given by the vanishing locus of polynomials corresponding to natural geometric constraints. Such geometric constraint systems arise in many real-world scenarios such as structural…

Metric Geometry · Mathematics 2026-04-14 Matthias Adrian-Himmelmann

Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…

Optimization and Control · Mathematics 2026-03-17 Ryan Cory-Wright , Jean Pauphilet

We generalize the diffusion-limited aggregation by issuing many randomly-walking particles, which stick to a cluster at the discrete time unit providing its growth. Using simple combinatorial arguments we determine probabilities of…

Statistical Mechanics · Physics 2017-05-24 Oleg Alekseev , Mark Mineev-Weinstein

The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…

Numerical Analysis · Mathematics 2021-02-26 Aleš Vavpetič , Emil Žagar

This work explores an extension of machine learning-optimized piecewise polynomial approximation by incorporating energy optimization as an additional objective. Traditional closed-form solutions enable continuity and approximation targets…

Machine Learning · Computer Science 2025-08-08 Hannes Waclawek , Stefan Huber

The speed of convergence of the R-linear GMRES is bounded in terms of a polynomial approximation problem on a finite subset of the spectrum. This result resembles the classical GMRES convergence estimate except that the matrix involved is…

Numerical Analysis · Mathematics 2011-12-15 Marko Huhtanen , Allan Perämäki

This paper considers an optimization problem for a dynamical system whose evolution depends on a collection of binary decision variables. We develop scalable approximation algorithms with provable suboptimality bounds to provide…

Optimization and Control · Mathematics 2016-10-31 Insoon Yang , Samuel A. Burden , Ram Rajagopal , S. Shankar Sastry , Claire J. Tomlin

We approximate a diffusion equation with highly oscillatory coefficients with a diffusion equation with constant coefficients. The approach is put in action in contexts where only partial information (namely the global energy stored in the…

Optimization and Control · Mathematics 2026-02-17 Claude Le Bris , Frédéric Legoll , Simon Ruget

Quasi-equilibrium approximation is a widely used closure approximation approach for model reduction with applications in complex fluids, materials science, etc. It is based on the maximum entropy principle and leads to thermodynamically…

Numerical Analysis · Mathematics 2021-10-19 Shan Jiang , Haijun Yu

Complex polynomial optimization has recently gained more and more attention in both theory and practice. In this paper, we study the optimization of a real-valued general conjugate complex form over various popular constraint sets including…

Optimization and Control · Mathematics 2016-12-08 Taoran Fu , Bo Jiang , Zhening Li

We consider the problem of finding optimally stable polynomial approximations to the exponential for application to one-step integration of initial value ordinary and partial differential equations. The objective is to find the largest…

Numerical Analysis · Mathematics 2013-01-10 David I. Ketcheson , Aron J. Ahmadia

The theory of integrable systems of Hamiltonian PDEs and their near-integrable deformations is used to study evolution equations resulting from vertical-averages of the Euler system for two-layer stratified flows in an infinite 2D channel.…

Mathematical Physics · Physics 2015-12-24 R. Camassa , G. Falqui , G. Ortenzi

In this chapter, we aim at presenting the basic techniques necessary to go beyond the widely accepted paradigm of second-order numerics. We specifically focus on finite-volume schemes for hyperbolic conservation laws occuring in fluid…

Numerical Analysis · Mathematics 2024-07-29 Jean-Mathieu Teissier , Wolf-Christian Müller

Nonlinear optimal control problems in Hilbert spaces are considered for which we derive approximation theorems for Galerkin approximations. Approximation theorems are available in the literature. The originality of our approach relies on…

Optimization and Control · Mathematics 2017-07-21 Mickaël D. Chekroun , Axel Kröner , Honghu Liu

We introduce a new technique for reducing the dimension of the ambient space of low-degree polynomials in the Gaussian space while preserving their relative correlation structure, analogous to the Johnson-Lindenstrauss lemma. As…

Computational Complexity · Computer Science 2017-08-15 Badih Ghazi , Pritish Kamath , Prasad Raghavendra