Preconditioners for Krylov subspace methods: An overview

JW Pearson, J Pestana - GAMM‐Mitteilungen, 2020 - Wiley Online Library
When simulating a mechanism from science or engineering, or an industrial process, one is
frequently required to construct a mathematical model, and then resolve this model …

Randomized quasi-Newton updates are linearly convergent matrix inversion algorithms

RM Gower, P Richtárik - SIAM Journal on Matrix Analysis and Applications, 2017 - SIAM
We develop and analyze a broad family of stochastic/randomized algorithms for calculating
an approximate inverse matrix. We also develop specialized variants maintaining symmetry …

Inexact coordinate descent: complexity and preconditioning

R Tappenden, P Richtárik, J Gondzio - Journal of Optimization Theory and …, 2016 - Springer
One of the key steps at each iteration of a randomized block coordinate descent method
consists in determining the update to a block of variables. Existing algorithms assume that in …

B‐preconditioned minimization algorithms for variational data assimilation with the dual formulation

S Gürol, AT Weaver, AM Moore… - Quarterly Journal of …, 2014 - Wiley Online Library
Variational data assimilation problems in meteorology and oceanography require the
solution of a regularized nonlinear least‐squares problem. Practical solution algorithms are …

Improved analysis‐error covariance matrix for high‐dimensional variational inversions: Application to source estimation using a 3D atmospheric transport model

N Bousserez, DK Henze, A Perkins… - Quarterly Journal of …, 2015 - Wiley Online Library
Variational methods are widely used to solve geophysical inverse problems. Although
gradient‐based minimization algorithms are available for high‐dimensional problems …

A new preconditioning approach for an interior point‐proximal method of multipliers for linear and convex quadratic programming

L Bergamaschi, J Gondzio, Á Martínez… - … Linear Algebra with …, 2021 - Wiley Online Library
In this article, we address the efficient numerical solution of linear and quadratic
programming problems, often of large scale. With this aim, we devise an infeasible interior …

Quasi-Newton approaches to interior point methods for quadratic problems

J Gondzio, FNC Sobral - Computational Optimization and Applications, 2019 - Springer
Interior point methods (IPM) rely on the Newton method for solving systems of nonlinear
equations. Solving the linear systems which arise from this approach is the most …

A matrix-free preconditioner for sparse symmetric positive definite systems and least-squares problems

S Bellavia, J Gondzio, B Morini - SIAM Journal on Scientific Computing, 2013 - SIAM
We analyze and discuss matrix-free and limited memory preconditioners for sparse
symmetric positive definite systems and normal equations of large and sparse least-squares …

Randomised preconditioning for the forcing formulation of weak‐constraint 4D‐Var

I Daužickaitė, AS Lawless, JA Scott… - Quarterly Journal of …, 2021 - Wiley Online Library
There is growing awareness that errors in the model equations cannot be ignored in data
assimilation methods such as four‐dimensional variational assimilation (4D‐Var). If allowed …

Correlation operators based on an implicitly formulated diffusion equation solved with the Chebyshev iteration

AT Weaver, J Tshimanga… - Quarterly Journal of the …, 2016 - Wiley Online Library
Correlation operators are used in the formulation of background‐error covariance models in
variational data assimilation (VDA) and for localizing low‐rank sample estimates of …