English
Related papers

Related papers: Exploring the Potential Energy Landscape Over a La…

200 papers

Standard variational methods tend to obtain upper bounds on the ground state energy of quantum many-body systems. Here we study a complementary method that determines lower bounds on the ground state energy in a systematic fashion, scales…

Quantum Physics · Physics 2015-05-28 Tillmann Baumgratz , Martin B. Plenio

We propose a new method to obtain approximate solutions for the Schr\"{o}dinger equation with an arbitrary potential that possesses bound states. This method, relying on the auxiliary field technique, allows in many cases to find analytical…

Quantum Physics · Physics 2008-06-13 B. Silvestre-Brac , C. Semay , F. Buisseret

The ability of widely used sampling methods, such as molecular dynamics or Monte Carlo, to explore complex free energy landscapes is severely hampered by the presence of kinetic bottlenecks. A large number of solutions have been proposed to…

Statistical Mechanics · Physics 2014-08-29 Omar Valsson , Michele Parrinello

For any orthogonal polynomials system on real line we construct an appropriate oscillator algebra such that the polynomials make up the eigenfunctions system of the oscillator hamiltonian. The general scheme is divided into two types: a…

Classical Analysis and ODEs · Mathematics 2007-05-23 V. V. Borzov

The method reducing the solution of the Schroedinger equation for several types of power potentials to the solution of the eigenvalue problem for the infinite system of algebraic equations is developed. The finite truncation of this system…

High Energy Physics - Phenomenology · Physics 2014-11-17 R. N. Faustov , V. O. Galkin , A. V. Tatarintsev , A. S. Vshivtsev

Special bases of orthogonal polynomials are defined, that are suited to expansions of density and potential perturbations under strict particle number conservation. Particle-hole expansions of the density response to an arbitrary…

Nuclear Theory · Physics 2009-11-11 B. G. Giraud , A. Weiguny , L. Wilets

We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…

Mathematical Software · Computer Science 2010-10-08 Eric Berberich , Pavel Emeliyanenko , Michael Sagraloff

We present a multiscale mixed finite element method for solving second order elliptic equations with general $L^{\infty}$-coefficients arising from flow in highly heterogeneous porous media. Our approach is based on a multiscale spectral…

Numerical Analysis · Mathematics 2024-04-05 Christian Alber , Chupeng Ma , Robert Scheichl

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

Mathematical Physics · Physics 2011-09-16 Paul Baird

In this PhD thesis we will discuss some aspects in Commutative Algebra which have interactions with Algebraic Geometry, Representation Theory and Combinatorics. In particular, in the first chapter we will focus on understanding when certain…

Commutative Algebra · Mathematics 2011-05-30 Matteo Varbaro

Following the discovery of the brightest high-energy neutrino sources in the sky, the further detection of fainter sources is more challenging. A natural solution is to combine fainter source candidates, and instead of individual…

High Energy Astrophysical Phenomena · Physics 2025-06-03 I. Bartos , M. Ackermann , M. Kowalski

We describe an effective landscape introduced in [1] for the analysis of Constraint Satisfaction problems, such as Sphere Packing, K-SAT and Graph Coloring. This geometric construction reexpresses these problems in the more familiar terms…

Quantum Physics · Physics 2008-09-25 Florent Krzakala , Jorge Kurchan

New method for ab initio calculations of the properties of large size system based on phase-amplitude functional is presented. It is shown that Schrodinger equation for many electrons complex system including large size molecules, or…

Computational Physics · Physics 2019-10-10 Pawel Strak , Konrad Sakowski , Pawel Kempisty , Stanislaw Krukowski

Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution…

Numerical Analysis · Mathematics 2025-10-20 Jan Verschelde

Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…

Symbolic Computation · Computer Science 2015-12-22 Jean-Charles Faugère , Mohab Safey El Din , Thibaut Verron

We study the global geometry of the energy landscape of a simple model of a self-gravitating system, the self-gravitating ring (SGR). This is done by endowing the configuration space with a metric such that the dynamical trajectories are…

Statistical Mechanics · Physics 2012-10-24 Bernardo Monechi , Lapo Casetti

Molecular dynamics simulations are an invaluable tool in numerous scientific fields. However, the ubiquitous classical force fields cannot describe reactive systems, and quantum molecular dynamics are too computationally demanding to treat…

Chemical Physics · Physics 2022-08-09 Xiangyun Lei , Andrew J. Medford

For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…

Symbolic Computation · Computer Science 2025-03-17 Rafael Mohr , Yulia Mukhina

A theory of numerical path-following in toric varieties was suggested in two previous papers. The motivation is solving systems of polynomials with real or complex coefficients. When those polynomials are not assumed 'dense', solving them…

Algebraic Geometry · Mathematics 2025-06-23 Gregorio Malajovich

A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…

Symbolic Computation · Computer Science 2010-10-04 Yao Sun , Dingkang Wang
‹ Prev 1 8 9 10 Next ›