scholarly journals Frequency-Domain Representation of First-Order Methods: A Simple and Robust Framework of Analysis

2022 ◽  
pp. 131-160
Author(s):  
Ioannis Anagnostides ◽  
Ioannis Panageas
Author(s):  
Jacob Stegenga

Medical scientists employ ‘quality assessment tools’ to assess evidence from medical research, especially from randomized trials. These tools are designed to take into account methodological details of studies, including randomization, subject allocation concealment, and other features of studies deemed relevant to minimizing bias. There are dozens of such tools available. They differ widely from each other, and empirical studies show that they have low inter-rater reliability and low inter-tool reliability. This is an instance of a more general problem called here the underdetermination of evidential significance. Disagreements about the quality of evidence can be due to different—but in principle equally good—weightings of the methodological features that constitute quality assessment tools. Thus, the malleability of empirical research in medicine is deep: in addition to the malleability of first-order empirical methods, such as randomized trials, there is malleability in the tools used to evaluate first-order methods.


2020 ◽  
Vol 108 (11) ◽  
pp. 1869-1889
Author(s):  
Ran Xin ◽  
Shi Pu ◽  
Angelia Nedic ◽  
Usman A. Khan

2013 ◽  
Vol 146 (1-2) ◽  
pp. 37-75 ◽  
Author(s):  
Olivier Devolder ◽  
François Glineur ◽  
Yurii Nesterov

Author(s):  
Vasily I. Repnikov ◽  
Boris V. Faleichik ◽  
Andrew V. Moisa

In this work we present explicit Adams-type multi-step methods with extended stability intervals, which are analogous to the stabilised Chebyshev Runge – Kutta methods. It is proved that for any k ≥ 1 there exists an explicit k-step Adams-type method of order one with stability interval of length 2k. The first order methods have remarkably simple expressions for their coefficients and error constant. A damped modification of these methods is derived. In the general case, to construct a k-step method of order p it is necessary to solve a constrained optimisation problem in which the objective function and p constraints are second degree polynomials in k variables. We calculate higher-order methods up to order six numerically and perform some numerical experiments to confirm the accuracy and stability of the methods.


Geophysics ◽  
2021 ◽  
pp. 1-147
Author(s):  
Peng Yong ◽  
Romain Brossier ◽  
Ludovic Métivier

In order to exploit Hessian information in Full Waveform Inversion (FWI), the matrix-free truncated Newton method can be used. In such a method, Hessian-vector product computation is one of the major concerns due to the huge memory requirements and demanding computational cost. Using the adjoint-state method, the Hessian-vector product can be estimated by zero-lag cross-correlation of the first-order/second-order incident wavefields and the second-order/first-order adjoint wavefields. Different from the implementation in frequency-domain FWI, Hessian-vector product construction in the time domain becomes much more challenging as it is not affordable to store the entire time-dependent wavefields. The widely used wavefield recomputation strategy leads to computationally intensive tasks. We present an efficient alternative approach to computing the Hessian-vector product for time-domain FWI. In our method, discrete Fourier transform is applied to extract frequency-domain components of involved wavefields, which are used to compute wavefield cross-correlation in the frequency domain. This makes it possible to avoid reconstructing the first-order and second-order incident wavefields. In addition, a full-scattered-field approximation is proposed to efficiently simplify the second-order incident and adjoint wavefields computation, which enables us to refrain from repeatedly solving the first-order incident and adjoint equations for the second-order incident and adjoint wavefields (re)computation. With the proposed method, the computational time can be reduced by 70% and 80% in viscous media for Gauss-Newton and full-Newton Hessian-vector product construction, respectively. The effectiveness of our method is also verified in the frame of a 2D multi-parameter inversion, in which the proposed method almost reaches the same iterative convergence of the conventional time-domain implementation.


Author(s):  
Pavel Dvurechensky ◽  
Shimrit Shtern ◽  
Mathias Staudigl

Author(s):  
S. V. Denisov ◽  
V. V. Semenov

The problems of optimization of linear distributed systems with generalized control and first-order methods for their solution are considered. The main focus is on proving the convergence of methods. It is assumed that the operator describing the model satisfies a priori estimates in negative norms. For control problems with convex and preconvex admissible sets, the convergence of several first-order algorithms with errors in iterative subproblems is proved.


Sign in / Sign up

Export Citation Format

Share Document