arXivDaily arXiv每日学术速递 周一至周五更新
重置
cs.NA数值分析3
2602.13513 2026-06-11 math.OC cs.CE cs.LG cs.NA math.DS math.NA

Learning Gradient Flow: Using Equation Discovery to Accelerate Engineering Optimization

Grant Norman, Conor Rowan, Kurt Maute, Alireza Doostan

详情
Comments
44 pages, 13 figures. Submitted to CMAME. Changed Topology Optimization example to be 250% acceleration
英文摘要

In this work, we investigate the use of data-driven equation discovery for dynamical systems to model and forecast continuous-time dynamics of unconstrained optimization problems. To avoid expensive evaluations of the objective function and its gradient, we leverage trajectory data on the optimization variables to learn the continuous-time dynamics associated with gradient descent, Newton's method, and ADAM optimization. The discovered gradient flows are then solved as a surrogate for the original optimization problem. To this end, we introduce the Learned Gradient Flow (LGF) optimizer, which is equipped to build surrogate models of variable polynomial order in full- or reduced-dimensional spaces at user-defined intervals in the optimization process. We demonstrate the efficacy of this approach on several standard problems from engineering mechanics and scientific machine learning, including two inverse problems, structural topology optimization, and two forward solves with different discretizations. Our results suggest that the learned gradient flows can significantly expedite convergence by capturing critical features of the optimization trajectory while avoiding expensive evaluations of the objective and its gradient.

1303.2033 2026-06-11 cs.DS cs.IT cs.NA math.IT math.NA

Extended Fourier analysis of signals

Vilnis Liepins

详情
Comments
52 pages, 11 figures
英文摘要

This summary of the doctoral thesis provides a comprehensive formulation of the Extended Discrete Fourier Transform (EDFT), derived directly from the Fourier integral and its orthogonality properties. The method is obtained by solving weighted least-squares estimators in both continuous and discrete domains, yielding an adaptive frequency-domain representation that remains fully consistent with the classical Fourier framework. In the special case of uniformly sampled data on a uniform frequency grid of the same size, the EDFT reduces exactly to the classical Discrete Fourier Transform (DFT). However, when the analysis grid exceeds the number of observed samples, EDFT circumvents conventional zero-padding by optimizing the transformation basis over the extended frequency set. This enables accurate spectral estimation from incomplete or nonuniformly sampled data. Consequently, the EDFT achieves enhanced frequency resolution in regions of strong spectral content while maintaining global resolution balance, thereby remaining consistent with the uncertainty principle. The inverse EDFT reconstructs the original signal and produces extrapolated or interpolated samples wherever spectral information is available. The EDFT requires no explicit separation of deterministic and stochastic components and accurately captures broadband, transient, and sinusoidal features simultaneously. Simulation studies confirm its robustness under nonuniform sampling, multiple Nyquist zones, missing-data conditions, and signals with mixed spectra comprising both line and continuous components. Although iterative computation of the EDFT entails higher numerical cost compared to the classical DFT, this limitation - significant in the 1990s - has been largely mitigated by modern computational resources, rendering the EDFT practical for contemporary signal analysis applications.

2509.10335 2026-06-11 math.NA cs.NA

Mathematical and numerical study of symmetry and positivity of the tensor-valued spring constant defined from P1-FEM for two- and three-dimensional linear elasticity

Oussama Ounissi, Masato Kimura, Hirofumi Notsu

详情
英文摘要

In this study, we consider a spring-block system that approximates a $d$-dimensional linear elastic body, where $d=2$ or $d=3$. We derive a $d\times d$ matrix as the spring constant using the P1 finite element method with a triangular mesh for the linear elasticity equations. We mathematically analyze the symmetry and positive-definiteness of the spring constant. Even if we assume full symmetry of the elasticity tensor, the symmetry of the matrix obtained as the spring constant is not trivial. However, we have succeeded in proving this in a unified manner for both 2D and 3D cases. This is an alternative proof for the 2D case in Notsu-Kimura (2014) and is a new result for the 3D case. We provide a necessary and sufficient condition for the spring constant to be positive-definite in the case of an isotropic elasticity tensor, along with a sufficient condition in terms of mesh regularity and the Poisson ratio. These theoretical results are supported by several numerical experiments. The positive-definiteness of the spring constant derived from the finite element method plays a vital role in fracture simulations of elastic bodies using the spring-block system.