相关论文: Convergence of the least squares shadowing method …

For a parameterized hyperbolic system $\frac{du}{dt}=f(u,s)$ the derivative of the ergodic average $\langle J \rangle = \lim_{T \to \infty}\frac{1}{T}\int_0^T J(u(t),s)$ to the parameter $s$ can be computed via the Least Squares Shadowing…

The sensitivity of long-time averages of a hyperbolic chaotic system to parameter perturbations can be determined using the shadowing direction, the uniformly-bounded-in-time solution of the sensitivity equations. Although its existence is…

The adjoint method, among other sensitivity analysis methods, can fail in chaotic dynamical systems. The result from these methods can be too large, often by orders of magnitude, when the result is the derivative of a long time averaged…

This paper develops a variant of the Least Squares Shadowing (LSS) method, which has successfully computed the derivative for several chaotic ODEs and PDEs. The development in this paper aims to simplify Least Squares Shadowing method by…

The problem of least squares regression of a $d$-dimensional unknown parameter is considered. A stochastic gradient descent based algorithm with weighted iterate-averaging that uses a single pass over the data is studied and its convergence…

This paper studies numerical methods for the approximation of elliptic PDEs with lognormal coefficients of the form $-{\rm div}(a\nabla u)=f$ where $a=\exp(b)$ and $b$ is a Gaussian random field. The approximant of the solution $u$ is an…

We provide a unified framework to proving pointwise convergence of sparse sequences, deterministic and random, at the $L^1(X)$ endpoint. Specifically, suppose that \[ a_n \in \{ \lfloor n^c \rfloor, \min\{ k : \sum_{j \leq k} X_j = n\} \}…

The least squares method allows fitting parameters of a mathematical model from experimental data. This article proposes a general approach of this method. After introducing the method and giving a formal definition, the transitivity of the…

We study a least squares estimator for an unknown parameter in the drift coefficient of a path- distribution dependent stochastic differential equation involving a small dispersion parameter epsilon greater than zero. The estimator, based…

This chapter offers a comprehensive introduction to the least-squares neural network (LSNN) method introduced in [14,16], for solving scalar first-order hyperbolic partial differential equations, specifically linear advection-reaction…

Chaotic dynamical systems are characterized by the sensitive dependence of trajectories on initial conditions. Conventional sensitivity analysis of time-averaged functionals yields unbounded sensitivities when the simulation is chaotic. The…

The purpose of this paper is to study ergodic averages with deterministic weights. More precisely we study the convergence of the ergodic averages of the type $\frac{1}{N} \sum_{k=0}^{N-1} \theta (k) f \circ T^{u_k}$ where $\theta = (\theta…

This paper develops the non-intrusive formulation of the Least-squares shadowing (LSS) method, for computing the sensitivity of long-time averaged objectives in chaotic dynamical systems. This non-intrusive formulation constrains the…

In this paper, a few dual least-squares finite element methods and their application to scalar linear hyperbolic problems are studied. The purpose is to obtain $L^2$-norm approximations on finite element spaces of the exact solutions to…

Computational methods for sensitivity analysis are invaluable tools for scientists and engineers investigating a wide range of physical phenomena. However, many of these methods fail when applied to chaotic systems, such as the…

Bilevel optimization problems are receiving increasing attention in machine learning as they provide a natural framework for hyperparameter optimization and meta-learning. A key step to tackle these problems is the efficient computation of…

We derive consistency and asymptotic normality results for quasi-maximum likelihood methods for drift parameters of ergodic stochastic processes observed in discrete time in an underlying continuous-time setting. The special feature of our…

The problem of prediction in functional linear regression is conventionally addressed by reducing dimension via the standard principal component basis. In this paper we show that an alternative basis chosen through weighted least-squares,…

We consider the well-known method of least squares on an equidistant grid with $N+1$ nodes on the interval $[-1,1]$ with the goal to approximate a function $f\in\mathcal{C}\left[-1,1\right]$ by a polynomial of degree $n$. We investigate the…

Adjoint-based sensitivity analysis methods are powerful tools for engineers who use flow simulations for design. However, the conventional adjoint method breaks down for scale-resolving simulations like large-eddy simulation (LES) or direct…