English
Related papers

Related papers: On Third-Order Limiter Functions for Finite Volume…

200 papers

A novel scheme, based on third-order Weighted Essentially Non-Oscillatory (WENO) reconstructions, is presented. It attains unconditionally optimal accuracy when the data is smooth enough, even in presence of critical points, and…

Numerical Analysis · Mathematics 2024-02-06 Antonio Baeza , Raimund Bürger , Pep Mulet , David Zorío

Optimally convergent (with respect to the regularity) quadratic finite element method for two dimensional obstacle problem on simplicial meshes is studied in (Brezzi, Hager, Raviart, Numer. Math, 28:431--443, 1977). There was no analogue of…

Numerical Analysis · Mathematics 2016-11-10 Sharat Gaddam , Thirupathi Gudi

We propose an expression for the classical limit of diagonal form factors in which we integrate the corresponding observable over the moduli space of classical solutions. In infinite volume the integral has to be regularized by proper…

High Energy Physics - Theory · Physics 2019-04-03 Zoltan Bajnok , Romuald A. Janik

We construct high order symmetric volume-preserving methods for the relativistic dynamics of a charged particle by the splitting technique with processing. Via expanding the phase space to include time $t$, we give a more general…

Computational Physics · Physics 2016-10-12 Yang He , Yajuan Sun , Ruili Zhang , Yulei Wang , Jian Liu , Hong Qin

The present paper regards the volume function of a doubly truncated hyperbolic tetrahedron. Starting from the previous results of J. Murakami, U. Yano and A. Ushijima, we have developed a unified approach to express the volume in different…

Metric Geometry · Mathematics 2019-11-19 Alexander Kolpakov , Jun Murakami

In this article we present a refined convergence analysis for a second order accurate in time, fourth order finite difference numerical scheme for the 3-D Cahn-Hilliard equation, with an improved convergence constant. A modified backward…

Numerical Analysis · Mathematics 2024-04-09 Jing Guo , Cheng Wang , Yue Yan , Xingye Yue

Second-order methods, which utilize gradients as well as Hessians to optimize a given function, are of major importance in mathematical optimization. In this work, we prove tight bounds on the oracle complexity of such methods for smooth…

Optimization and Control · Mathematics 2017-08-18 Yossi Arjevani , Ohad Shamir , Ron Shiff

In this paper, a maximum-principle-satisfying finite volume compact scheme is proposed for solving scalar hyperbolic conservation laws. The scheme combines WENO schemes (Weighted Essentially Non-Oscillatory) with a class of compact schemes…

Numerical Analysis · Mathematics 2014-05-09 Yan Guo , Tao Xiong , Yufeng Shi

In Speakman and Lee (2017), we analytically developed the idea of using volume as a measure for comparing relaxations in the context of spatial branch-and-bound. Specifically, for trilinear monomials, we analytically compared the three…

Optimization and Control · Mathematics 2018-10-18 Emily Speakman , Jon Lee

A new intrinsic volume metric is introduced for the class of convex bodies in $\mathbb{R}^n$. As an application, an inequality is proved for the asymptotic best approximation of the Euclidean unit ball by arbitrarily positioned polytopes…

Metric Geometry · Mathematics 2023-03-15 Florian Besau , Steven Hoehner

We give a method for computing upper and lower bounds for the volume of a non-obtuse hyperbolic polyhedron in terms of the combinatorics of the 1-skeleton. We introduce an algorithm that detects the geometric decomposition of good…

Geometric Topology · Mathematics 2012-11-22 Christopher K. Atkinson

In this paper we generalize to non-uniform grids of quad-tree type the Compact WENO reconstruction of Levy, Puppo and Russo (SIAM J. Sci. Comput., 2001), thus obtaining a truly two-dimensional non-oscillatory third order reconstruction with…

Numerical Analysis · Mathematics 2016-02-26 M. Semplice , A. Coco , G. Russo

We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \colon \{0,1\}^k \rightarrow \{0,1\}^n$. Specifically, we prove: (1) If $C$ is a linear design 3-LCC, then $n \geq 2^{(1 - o(1))\sqrt{k} }$. A design…

Computational Complexity · Computer Science 2024-10-29 Pravesh K. Kothari , Peter Manohar

Volumetric models have become a popular representation for 3D scenes in recent years. One of the breakthroughs leading to their popularity was KinectFusion, where the focus is on 3D reconstruction using RGB-D sensors. However, monocular…

Computer Vision and Pattern Recognition · Computer Science 2014-10-27 Victor Adrian Prisacariu , Olaf Kähler , Ming Ming Cheng , Carl Yuheng Ren , Julien Valentin , Philip H. S. Torr , Ian D. Reid , David W. Murray

Recently classes of conic and discrete conic functions were introduced. In this paper we use the term convic instead conic. The class of convic functions properly includes the classes of convex functions, strictly quasiconvex functions and…

Optimization and Control · Mathematics 2020-11-03 S. I. Veselov , D. V. Gribanov , N. Yu. Zolotykh , A. Yu. Chirkov

We propose a fast and accurate surface reconstruction algorithm for unorganized point clouds using an implicit representation. Recent learning methods are either single-object representations with small neural models that allow for high…

Computer Vision and Pattern Recognition · Computer Science 2025-06-11 Siddhant Ranade , Gonçalo Dias Pais , Ross Tyler Whitaker , Jacinto C. Nascimento , Pedro Miraldo , Srikumar Ramalingam

In computer graphics, smooth data reconstruction on 2D or 3D manifolds usually refers to subdivision problems. Such a method is only valid based on dense sample points. The manifold usually needs to be triangulated into meshes (or patches)…

Numerical Analysis · Mathematics 2011-05-30 Li Chen , Feng Luo

High order discretization schemes play more important role in fractional operators than classical ones. This is because usually for classical derivatives the stencil for high order discretization schemes is wider than low order ones; but…

Numerical Analysis · Mathematics 2014-09-05 Minghua Chen , Weihua Deng

We give a deterministic 2^{O(n)} algorithm for computing an M-ellipsoid of a convex body, matching a known lower bound. This has several interesting consequences including improved deterministic algorithms for volume estimation of convex…

Computational Complexity · Computer Science 2014-03-05 Daniel Dadush , Santosh Vempala

This paper describes a new multilevel procedure that can solve the discrete Navier-Stokes system arising from finite volume discretizations on composite grids, which may consist of more than one level. SIMPLE is used and tested as the…

Computational Physics · Physics 2015-08-14 Alexandros Syrakos , Apostolos Goulas
‹ Prev 1 8 9 10 Next ›