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,657 papers · 148 categories

Trend · papers per month

9182736 · May 202619922001200920172026
48 results for Stiff PDEs

Physics-informed GANs estimate elastic moduli from mechanical tests.

problem Estimating spatially-varying elastic moduli from measured deformations.
method Physics-informed Generative Adversarial Networks (PI-GANs) with PDE constraints.
result Generated stiffness samples match true distribution statistics.

LiLaN uses linear latent networks to solve stiff ODEs efficiently.

problem Solving stiff ordinary differential equations (StODEs) requires expensive methods.
method LiLaN integrates latent dynamics analytically, avoiding explicit/implicit integration.
result LiLaN can approximate stiff nonlinear systems to any accuracy epsilon.

New boundary treatment improves accuracy for complex PDEs.

problem Order reduction in high-order IMEX schemes for multidimensional PDEs.
method Novel boundary treatment algorithms for Cartesian meshes, treating implicit-explicit stages similarly to interior points.
result Recovery of designed order of convergence by numerical verification.

In this paper we develop a new perspective on generalization of neural networks by proposing and investigating the concept of a neural network stiffness. We measure how stiff a network is by looking at how a small gradient step in the network's parameters on one example affects the loss on another example. Higher stiff…

2019-01-28abs ↗pdf ↗

This paper presents a new method for solving systems with polynomial stiffness.

problem Finding analytical solutions to nonlinear differential equations with polynomial stiffness is challenging.
method The paper introduces a geometric/algebraic method using generating series and shuffle product.
result The method provides a recursive schematic that can be automated and applied to systems with polynomial stiffness.

Researchers reconstruct stiffness tensors from limited data in anisotropic elasticity.

problem Reconstructing stiffness tensors from partial data around one polarization.
method Using algebraic geometry and slowness surfaces, the approach leverages the algebraic geometry of families of slowness surfaces.
result For tensors in a dense open subset, a small amount of data around one polarization uniquely determines the entire slowness surface and stiffness tensor.

Physics-informed model predicts beam stiffness and monitors structural health.

problem Predicting and monitoring the stiffness of Euler-Bernoulli beams.
method Physics-informed Gaussian process model using the Euler-Bernoulli beam equation.
result Model accurately predicts bending stiffness and detects structural damage.

AMORE uses neural operators to efficiently predict multiple thermochemical states in stiff chemical kinetics.

problem Efficiently integrating stiff chemical kinetics systems to reduce computational cost.
method Developed AMORE, a framework of adaptive multi-output operator network with two adaptive loss functions.
result Demonstrated improved accuracy and efficiency in predicting thermochemical states from initial conditions.

A novel method optimizes variable-stiffness structures for better strength and weight.

problem Optimizing variable-stiffness structures for higher strength and lighter weight.
method A novel multi-stage concurrent topology optimization scheme combining DMO, S-BPTO, and CFAO.
result The method ensures better fibre angle convergence and stable optimization.

In our previous article [Rad16], we investigated the asymptotic behaviour of orthogonal Bianchi class B perfect fluids close to the initial singularity and proved the Strong Cosmic Censorship conjecture in this setting. In several of the statements, the case of a stiff fluid had to be excluded. The present paper fills …

2017-12-07abs ↗pdf ↗

Prob-GParareal adds uncertainty quantification to PinT solvers for differential equations.

problem Uncertainty in numerical solutions of differential equations.
method Prob-GParareal uses Gaussian processes to model Parareal correction function, providing probabilistic forecasts.
result Prob-GParareal yields accurate and robust probabilistic forecasts on various ODE systems.

Physics-informed deep learning approximates strain gradient plasticity solutions.

problem Stiffness and computational challenges in solving strain gradient plasticity models.
method Physics-informed deep learning (PIDL) with modified loss functions and optimization schemes.
result PIDL methods address stiffness and computational challenges in strain gradient plasticity.

Study gauge freedoms in elastic wave equations and Dirichlet-to-Neumann map.

problem Recover stiffness tensor and density from Dirichlet-to-Neumann map.
method Analyze invariance under coordinate transformations and gauge freedoms.
result Present gauge freedoms in the Dirichlet-to-Neumann map for Riemannian elastic wave equation.

The simplest field theory description of the multivariate statistics of forward rate variations over time and maturities, involves a quadratic action containing a gradient squared rigidity term. However, this choice leads to a spurious kink (infinite curvature) of the normalized correlation function for coinciding matu…

2004-03-29abs ↗pdf ↗

Certain solutions of a sextic sigma-model Lagrangian reminiscent of Skyrme model correspond to perfect fluids with stiff matter equation of state. We analyse from a differential geometric perspective this correspondence extended to general barotropic fluids.

2010-06-06abs ↗pdf ↗

A new method uses SPDEs to efficiently model random fields on complex domains.

problem Efficient representation of random fields on complex domains for engineering and machine learning.
method Uses SPDEs to develop a scalable framework for statFEM and GP regression.
result Can model anisotropic, non-stationary random fields with arbitrary smoothness.

Efficiently infers latent SDEs with scalable memory and time costs.

problem Inference of latent SDEs with high time and memory complexity.
method Amortized reparametrization of expectations under linear SDEs, coupled with efficient gradient approximation.
result Achieves similar performance to adjoint sensitivities with fewer model evaluations.

Fourier Neural Operators accurately predict dynamics of high-dimensional ionic models.

problem Approximating stiff, multiscale ionic models using neural networks.
method Fourier Neural Operators for learning dynamics of high-dimensional ionic models.
result Fourier Neural Operators can accurately predict dynamics of high-dimensional ionic models.

A linkage is a finite graph with lengths assigned to each edge. A planar realization is a map to the plane which preserves edge lengths. It can be thought of as a mechanical device formed from stiff rods and rotating joints. We look at the configuration space of all planar realizations of a linkage (following work of K…

1998-07-04abs ↗pdf ↗

We propose Symplectic Recurrent Neural Networks (SRNNs) as learning algorithms that capture the dynamics of physical systems from observed trajectories. An SRNN models the Hamiltonian function of the system by a neural network and furthermore leverages symplectic integration, multiple-step training and initial state op…

2019-09-29abs ↗pdf ↗

Optimizes natural frequencies of cellular composites with various microstructures.

problem Designing cellular composites with diverse microstructures for maximizing natural frequencies.
method Data-driven topology optimization with a latent-variable Gaussian process model.
result Cellular designs with multiclass microstructures achieve higher natural frequencies.

Solves second-order PDEs using quotients and differential invariants.

problem Solving second-order PDEs with first-order quotients.
method Solve the quotient PDE using differential invariants, then add new constraints to solve the original PDE.
result New method for solving second-order scalar PDEs with infinite-dimensional symmetry algebras.

PRISMA uses PDE residuals for fast, robust, and accurate inference.

problem Slow gradient-based optimization and instability in PDE residual-based methods.
method Integrates PDE residuals directly into the model's architecture via attention mechanisms in the spectral domain.
result Competitive accuracy with significantly lower inference costs and faster speeds.

LIQSS method improves accuracy and efficiency for power system simulations.

problem Accurately modeling and simulating long-duration mission profiles of Naval power systems.
method Linear Implicit Quantized State System (LIQSS) method for stiff, nonlinear, differential algebraic equations.
result LIQSS1 method yields results within 1% accuracy of continuous methods and increases efficiency logarithmically with quantization size.

Using the theory of the symmetry group for PDEs [15, 17], we derive the symmetry group G associated to surfaces PDE. Several group invariant solutions of the surfaces PDE are given by solving a reduced system of partial differential equations.

2010-07-07abs ↗pdf ↗

Develops arithmetic PDE geometry concepts like curvature and cohomology.

problem Creating a geometry framework for arithmetic PDEs.
method Introducing arithmetic analogues of Levi-Civita and Chern connections, then developing curvature and characteristic classes.
result Arithmetic analogues of curvature and characteristic classes have been developed.