Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

316292123 · May 202619922001200920172026
48 results for Burger's Equation

Let f,g:RRf,g:{\Bbb R}\to{\Bbb R} be integrable functions, ff nowhere zero, and φ(u)=du/f(u)φ(u)=\int du/f(u) be invertible. An exact solution to the generalized nonhomogeneous inviscid Burgers' equation ut+g(u).ux=f(u)u_t+g(u).u_x=f(u) is given, by quadratures.

2009-08-25abs ↗pdf ↗

Continuous functions on graphs in Carnot groups satisfy a Burgers' type equation.

problem Characterizing CH1C^1_{\mathrm{H}}-regularity of graphs in Carnot groups of step 2.
method Proving equivalence between distributional solutions of Burgers' type equations and CH1C^1_{\mathrm{H}}-regularity of graphs.
result Continuous functions on graphs in Carnot groups of step 2 satisfy a Burgers' type equation in the distributional sense.

The paper analyzes the score field of diffusion models using Burgers dynamics.

problem Understanding the evolution of score fields in diffusion models.
method Analyzes the score field through Burgers-type evolution law for diffusion models.
result Identifies a universal \( anh\) interfacial term in the score field.

Preliminary group classification for a class of generalized inviscid Burger's equations in the general form ut+g(x,u)ux=f(x,u)u_t+g(x, u)u_x = f(x, u) is given and additional equivalence transformations are found. Adduced results complete and essentially generalize recent works on the subject . A number of new interesting nonlinear in…

2010-09-21abs ↗pdf ↗

The present paper solves the problem of the group classification of the general Burgers' equation ut=f(x,u)ux2+g(x,u)uxxu_t=f(x,u)u_x^2+g(x,u)u_{xx}, where ff and gg are arbitrary smooth functions of the variable xx and uu, by using Lie method. The paper is one of the few applications of an algebraic approach to the problem of group c…

2009-08-26abs ↗pdf ↗

This paper is concerned with the following Markovian stochastic differential equation of mean-reversion type \[ dR_t= (θ+σα(R_t, t))R_t dt +σR_t dB_t \] with an initial value R0=r0RR_0=r_0\in\mathbb{R}, where θRθ\in\mathbb{R} and σ>0σ>0 are constants, and the mean correction function $α:\mathbb{R}\times[0,\infty)\to α(x,t)\…

2013-05-08abs ↗pdf ↗

In this paper, we will generalize the Bott-Virasoro group, applying the concept of the connection cochain, and derive the Euler equations corresponding to the generalized Bott-Virasoro group. We will show the relationships between the new Euler equations and the old ones. Moreover, we will study the geodesic equation c…

2019-09-25abs ↗pdf ↗

PDE-NetGen converts physical equations to neural networks for various scientific problems.

problem Bridging physics and deep learning for efficient neural network architectures.
method Combines symbolic calculus and neural network generation to translate PDEs into NN architectures.
result Generates compact, computationally-efficient physics-informed NN architectures.

New method uses models from regularity structures as features in machine learning.

problem Learning solutions to PDEs with low regularity.
method Developed a flexible definition of model feature vectors and two algorithms for combining them with linear regression.
result Advantage in learning solutions to PDEs compared to alternative methods.

We consider a natural Riemannian metric on the infinite dimensional manifold of all embeddings from a manifold into a Riemannian manifold, and derive its geodesic equation in the case $\Emb(\Bbb R,\Bbb R)$ which turns out to be Burgers' equation. Then we derive the geodesic equation, the curvature, and the Jacobi equat…

1998-01-26abs ↗pdf ↗

Study on the geometric Dyson Brownian motion of non-square matrix products.

problem Understanding the spectrum of a product of non-square random matrices.
method Proportional depth-width limit followed by mean-field limit, solving Burgers equation.
result Free log-normal law is obtained in the identity-start case.

A new method predicts non-Markovian closure terms for complex systems.

problem Predicting the effect of unresolved variables on resolved dynamics in high-dimensional systems.
method Mamba-Assisted Closure (MAC) framework: sequence model trained to predict closure from resolved trajectory, coupled with reduced-order equations.
result Substantially outperforms existing methods in predictive accuracy and long-time stability.

We develop a new geometric framework suitable for dealing with Hamiltonian field theories with dissipation. To this end we define the notions of kk-contact structure and kk-contact Hamiltonian system. This is a generalization of both the contact Hamiltonian systems in mechanics and the kk-symplectic Hamiltonian syst…

2019-05-17abs ↗pdf ↗

PINNs struggle with data-to-PDE inconsistencies, limiting their accuracy.

problem Data inconsistency in PINNs affects their accuracy and convergence.
method Systematic analysis of PINNs with varying data fidelity and residual errors.
result PINNs saturate at an error level dictated by data inconsistency.

Paper proposes a new approach to optimal transport for vector and matrix densities.

problem Optimal transport for vector and matrix densities with positivity and action transitivity constraints.
method Gauge-theoretic approach using semi-direct product groups of diffeomorphisms and gauge transformations.
result Bures-type metrics on semi-direct product groups relate to Wasserstein-type metrics on vector and matrix densities via Riemannian submersions.

AI learns reduced-order models for computational science.

problem Discovering efficient reduced-order models for complex simulations.
method Reinforcement learning framework to discover models expressed in analytical form, evaluated a posteriori, and guided by integral quantities.
result AI discovers interpretable models for specific solvers, improving efficiency and accuracy.

We introduce DeepMoD, a Deep learning based Model Discovery algorithm. DeepMoD discovers the partial differential equation underlying a spatio-temporal data set using sparse regression on a library of possible functions and their derivatives. A neural network approximates the data and constructs the function library, b…

2019-04-20abs ↗pdf ↗

Graph Neural Simulators improve data efficiency for PDE surrogates.

problem Lack of data efficiency in neural operators for PDE systems.
method Graph Neural Simulators (GNS) leverage message-passing and numerical time-stepping to learn PDE dynamics efficiently.
result GNS achieves less than 1% relative L2 error using only 3% of available trajectories.

NOGaP uses neural operators and GPs to solve PDEs with uncertainty quantification.

problem Lack of uncertainty measures in neural operator solutions for PDEs.
method NOGaP combines neural operators with Gaussian Processes to provide probabilistic solutions.
result NOGaP offers improved prediction accuracy and uncertainty quantification.

In this paper, we introduce two notions on a surface in a contact manifold. The first one is called degree of transversality (DOT) which measures the transversality between the tangent spaces of a surface and the contact planes. The second quantity, called curvature of transversality (COT), is designed to give a compar…

2011-09-02abs ↗pdf ↗

Develops geometric framework for dissipative field equations.

problem Dissipative field equations and their geometric analysis.
method Canonical kk-contact manifolds, kk-contactifications, splitting results, regularity conditions, criteria for PDEs.
result Explicit Hamiltonian descriptions for various nonlinear PDEs.

This study evaluates the importance of design of experiments for PINN in physics-informed deep learning.

problem Accuracy of PINN predictions depends on the design of experiment scheme.
method Comparative study of five PDEs using different design of experiment schemes.
result Hammersley sampling-based PINN outperforms other design of experiment schemes.

Tight maps was introduced along tight homomorphisms by Burger, Iozzi and Wienhard with aims towards maximal representations. In this paper we classify tight maps into classical Hermitian symmetric spaces and give a partial result for the exceptional spaces.

2012-06-20abs ↗pdf ↗