Annealing-based approach to solving partial differential equations

• URL: http://arxiv.org/abs/2406.17364v3
• Date: Fri, 08 Nov 2024 23:14:59 GMT
• Title: Annealing-based approach to solving partial differential equations
• Authors: Kazue Kudo,
• Abstract summary: Discretizing a PDE yields a system of linear equations. A general eigenvalue problem can be transformed into an optimization problem. The proposed algorithm requires iterative computations.
• Score: 0.0
• License:
• Abstract: Solving partial differential equations (PDEs) using an annealing-based approach involves solving generalized eigenvalue problems. Discretizing a PDE yields a system of linear equations (SLE). Solving an SLE can be formulated as a general eigenvalue problem, which can be transformed into an optimization problem with an objective function given by a generalized Rayleigh quotient. The proposed algorithm requires iterative computations. However, it enables efficient annealing-based computation of eigenvectors to arbitrary precision without increasing the number of variables. Investigations using simulated annealing demonstrate how the number of iterations scales with system size and annealing time. Computational performance depends on system size, annealing time, and problem characteristics.

Related papers

• Gaussian Process Regression for Inverse Problems in Linear PDEs [7.793266750812356]
  This paper introduces a computationally efficient algorithm in system theory for solving inverse problems governed by linear partial differential equations (PDEs) An example application includes identifying the wave speed from noisy data for classical wave equations, which are widely used in physics.
  arXiv  Detail & Related papers  (2025-02-06T18:20:38Z)
• Explicit near-optimal quantum algorithm for solving the advection-diffusion equation [0.0]
  An explicit quantum algorithm is proposed for modeling dissipative initial-value problems. We propose a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. The proposed algorithm can be used for modeling a wide class of nonunitary initial-value problems.
  arXiv  Detail & Related papers  (2025-01-19T19:03:29Z)
• Nonlinear Operator Learning Using Energy Minimization and MLPs [0.5898893619901381]
  We develop and evaluate a method for learning solution operators to nonlinear problems governed by partial differential equations. The approach is based on a finite element discretization and aims at representing the solution operator by an iteration that takes latent variables as input.
  arXiv  Detail & Related papers  (2024-12-05T20:19:16Z)
• Warm Start Marginal Likelihood Optimisation for Iterative Gaussian Processes [30.475300015723256]
  We introduce a three-level hierarchy of marginal likelihood optimisation for iterative Gaussian processes. We then propose to amortise computations by reusing solutions of linear system solvers as initialisations in the next step.
  arXiv  Detail & Related papers  (2024-05-28T16:22:18Z)
• Parallel-in-Time Probabilistic Numerical ODE Solvers [35.716255949521305]
  Probabilistic numerical solvers for ordinary differential equations (ODEs) treat the numerical simulation of dynamical systems as problems of Bayesian state estimation. We build on the time-parallel formulation of iterated extended Kalman smoothers to formulate a parallel-in-time probabilistic numerical ODE solver.
  arXiv  Detail & Related papers  (2023-10-02T12:32:21Z)
• Probabilistic Unrolling: Scalable, Inverse-Free Maximum Likelihood Estimation for Latent Gaussian Models [69.22568644711113]
  We introduce probabilistic unrolling, a method that combines Monte Carlo sampling with iterative linear solvers to circumvent matrix inversions. Our theoretical analyses reveal that unrolling and backpropagation through the iterations of the solver can accelerate gradient estimation for maximum likelihood estimation. In experiments on simulated and real data, we demonstrate that probabilistic unrolling learns latent Gaussian models up to an order of magnitude faster than gradient EM, with minimal losses in model performance.
  arXiv  Detail & Related papers  (2023-06-05T21:08:34Z)
• Symbolic Recovery of Differential Equations: The Identifiability Problem [52.158782751264205]
  Symbolic recovery of differential equations is the ambitious attempt at automating the derivation of governing equations. We provide both necessary and sufficient conditions for a function to uniquely determine the corresponding differential equation. We then use our results to devise numerical algorithms aiming to determine whether a function solves a differential equation uniquely.
  arXiv  Detail & Related papers  (2022-10-15T17:32:49Z)
• Semi-supervised Learning of Partial Differential Operators and Dynamical Flows [68.77595310155365]
  We present a novel method that combines a hyper-network solver with a Fourier Neural Operator architecture. We test our method on various time evolution PDEs, including nonlinear fluid flows in one, two, and three spatial dimensions. The results show that the new method improves the learning accuracy at the time point of supervision point, and is able to interpolate and the solutions to any intermediate time.
  arXiv  Detail & Related papers  (2022-07-28T19:59:14Z)
• Analysis of Truncated Orthogonal Iteration for Sparse Eigenvector Problems [78.95866278697777]
  We propose two variants of the Truncated Orthogonal Iteration to compute multiple leading eigenvectors with sparsity constraints simultaneously. We then apply our algorithms to solve the sparse principle component analysis problem for a wide range of test datasets.
  arXiv  Detail & Related papers  (2021-03-24T23:11:32Z)
• The Connection between Discrete- and Continuous-Time Descriptions of Gaussian Continuous Processes [60.35125735474386]
  We show that discretizations yielding consistent estimators have the property of invariance under coarse-graining' This result explains why combining differencing schemes for derivatives reconstruction and local-in-time inference approaches does not work for time series analysis of second or higher order differential equations.
  arXiv  Detail & Related papers  (2021-01-16T17:11:02Z)
• Multipole Graph Neural Operator for Parametric Partial Differential Equations [57.90284928158383]
  One of the main challenges in using deep learning-based methods for simulating physical systems is formulating physics-based data. We propose a novel multi-level graph neural network framework that captures interaction at all ranges with only linear complexity. Experiments confirm our multi-graph network learns discretization-invariant solution operators to PDEs and can be evaluated in linear time.
  arXiv  Detail & Related papers  (2020-06-16T21:56:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.