Parameter choice rules for discrete ill-posed problems based on extrapolation methods
From MaRDI portal
Cites work
- A note on the \(\epsilon\)-algorithm
- A Polynomial Extrapolation Method for Finding Limits and Antilimits of Vector Sequences
- A posteriori error estimates for linear equations
- Acceleration of Convergence of Vector Sequences
- Acceleration Techniques for Iterated Vector and Matrix Problems
- An adaptive pruning algorithm for the discrete L-curve criterion
- An extrapolated TSVD method for linear discrete ill-posed problems with Kronecker structure
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Computational methods for large-scale inverse problems: a survey on hybrid projection methods
- Convergence acceleration for the iterative solution of the equations X = AX + f
- Convergence analysis of minimization-based noise level-free parameter choice rules for linear ill-posed problems
- Efficient implementation of minimal polynomial and reduced rank extrapolation methods
- Error estimates for large-scale ill-posed problems
- Error estimates for linear systems with applications to regularization
- Error estimates for the regularization of least squares problems
- Error Estimates for the Solution of Linear Systems
- Extrapolation methods
- Extrapolation techniques for ill-conditioned linear systems
- Généralisations de la transformation de Shanks, de la table de Padé et de l'\(\varepsilon\)-algorithme
- scientific article; zbMATH DE number 3114505 (Why is no real title available?)
- scientific article; zbMATH DE number 3876486 (Why is no real title available?)
- scientific article; zbMATH DE number 852536 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- Identifying the magnetic permeability in multi-frequency EM data inversion
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- Matrices, moments and quadrature with applications
- Non-commutative extrapolation algorithms
- Old and new parameter choice rules for discrete ill-posed problems
- On a Device for Computing the e m (S n ) Transformation
- On the kernel of vector \(\varepsilon \)-algorithm and related topics
- On the Lanczos and Golub-Kahan reduction methods applied to discrete ill-posed problems.
- Recent results on the quasi-optimality principle
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Regularized solution of a nonlinear problem in electromagnetic sounding
- Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion
- Shanks and Anderson-type acceleration techniques for systems of nonlinear equations
- Shanks sequence transformations and Anderson acceleration
- Software for limited memory restarted \(\ell^p\)-\(\ell^q\) minimization methods using generalized Krylov subspaces
- Some results about vector extrapolation methods and related fixed-point iterations
- The genesis and early developments of Aitken's process, Shanks' transformation, the \(\varepsilon\)-algorithm, and related fixed point methods
- The simplified topological -algorithms for accelerating sequences in a vector space
- The simplified topological \(\varepsilon\)-algorithms: software and applications
- The truncated SVD as a method for regularization
- The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems
- Towards a Generalized Singular Value Decomposition
- Vector extrapolation applied to truncated singular value decomposition and truncated iteration
- Vector extrapolation enhanced TSVD for linear discrete ill-posed problems
This page was built for publication: Parameter choice rules for discrete ill-posed problems based on extrapolation methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7007732)
