Efficient solution of parameter identification problems with H¹ regularization
From MaRDI portal
Efficient solution of parameter identification problems with $H^1$ regularization
Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Numerical computation of matrix norms, conditioning, scaling (65F35) Numerical solutions to equations with linear operators (65J10)
Abstract: We consider the identification of spatially distributed parameters under regularization. Solving the associated minimization problem by Gauss-Newton iteration results in linearized problems to be solved in each step that can be cast as boundary value problems involving a low-rank modification of the Laplacian. Using algebraic multigrid as a fast Laplace solver, the Sherman-Morrison-Woodbury formula can be employed to construct a preconditioner for these linear problems which exhibits excellent scaling w.r.t. the relevant problem parameters. We first develop this approach in the functional setting, thus obtaining a consistent methodology for selecting boundary conditions that arise from the regularization. We then construct a method for solving the discrete linear systems based on combining any fast Poisson solver with the Woodbury formula. The efficacy of this method is then demonstrated with scaling experiments. These are carried out for a common nonlinear parameter identification problem arising in electrical resistivity tomography.
Recommendations
- A fast iterative method for solving regularized parameter identification problems in elliptic boundary value problems
- An efficient linear solver for nonlinear parameter identification problems
- Multigrid solution of a linearized, regularized least-squares problem in electrical impedance tomography
- An overlapping domain decomposition method for parameter identification problems
- On level set regularization for highly ill-posed distributed parameter estimation problems
Cites work
- HSL_MI20 : An efficient AMG preconditioner for finite element problems in 3D
- A fast solver for an H1 regularized PDE-constrained optimization problem
- A hybrid LSMR algorithm for large-scale Tikhonov regularization
- A Note on Preconditioning for Indefinite Linear Systems
- A note on preconditioning nonsymmetric matrices
- A Note on the Superlinear Convergence of GMRES
- A Robust Preconditioner with Low Memory Requirements for Large Sparse Least Squares Problems
- An improved preconditioned LSQR for discrete ill-posed problems
- Bayes meets Krylov: statistically inspired preconditioners for CGLS
- Block triangular preconditioners for nonsymmetric saddle point problems: Field-of-values analysis
- Computational Methods for Inverse Problems
- Computational methods in geophysical electromagnetics
- Continuity of Solutions of Parabolic and Elliptic Equations
- Convergence analysis of LSQR for compact operator equations
- Finite elements and fast iterative solvers. With applications in incompressible fluid dynamics
- Geometric aspects of the theory of Krylov subspace methods
- Gmsh: a 3-D finite element mesh generator with built-in pre- and post-processing facilities
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 911331 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Inner-Iteration Krylov Subspace Methods for Least Squares Problems
- Inverse acoustic and electromagnetic scattering theory
- Iterative solution of symmetric quasi-definite linear systems
- Krylov subspace methods. Principles and analysis.
- Large-Scale Inverse Problems in Imaging
- Mixed finite element methods and applications
- Numerical methods in matrix computations
- On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems
- Optimal Preconditioning for Raviart--Thomas Mixed Formulation of Second-Order Elliptic Problems
- Preconditioned iterative methods for solving linear least squares problems
- Preconditioner based on the Sherman-Morrison formula for regularized least squares problems
- Preconditioners for rank deficient least squares problems
- Preconditioning discretizations of systems of partial differential equations.
- Preconditioning linear least-squares problems by identifying a basis matrix
- Preconditioning of linear least squares by robust incomplete factorization for implicitly held normal equations
- Priorconditioners for linear systems
- Solution of Sparse Indefinite Systems of Linear Equations
- Some Superlinear Convergence Results for the Conjugate Gradient Method
- Spectral method approximation of flow optimal control problems with H^1-norm state constraint
- Stability of Conjugate Gradient and Lanczos Methods for Linear Least Squares Problems
- Stability of linear GMRES convergence with respect to compact perturbations
- Subspace preconditioned LSQR for discrete ill-posed problems
- Superlinear convergence of Krylov subspace methods for self-adjoint problems in Hilbert space
- The State-of-the-Art of Preconditioners for Sparse Linear Least-Squares Problems
- Two-level preconditioners for regularized inverse problems. I: Theory
This page was built for publication: Efficient solution of parameter identification problems with $H^1$ regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409906)
