Schultz matrix iteration based method for stable solution of discrete ill-posed problems
From MaRDI portal
Recommendations
- An efficient discretization scheme for solving ill-posed problems
- Publication:4952742
- The structure of iterative methods for symmetric linear discrete ill-posed problems
- Discretization and iterational approximation of solutions of nonlinear ill-posed problems
- scientific article; zbMATH DE number 953036
- Approximate Schur-block ILU preconditioners for regularized solution of discrete ill-posed problems
- A discrete scheme of Landweber iteration for solving nonlinear ill-posed problems
- An approach to the discretization of ill-posed problems
- scientific article; zbMATH DE number 2132105
- On the numerical properties of the Schur approach for solving the matrix Riccati equation
Cites work
- scientific article; zbMATH DE number 4001918 (Why is no real title available?)
- scientific article; zbMATH DE number 936298 (Why is no real title available?)
- scientific article; zbMATH DE number 3227378 (Why is no real title available?)
- scientific article; zbMATH DE number 3298300 (Why is no real title available?)
- scientific article; zbMATH DE number 3111121 (Why is no real title available?)
- A Hyperpower Iterative Method for Computing Matrix Products Involving the Generalized Inverse
- A Projection‐Based Approach to General‐Form Tikhonov Regularization
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- An Iteration Formula for Fredholm Integral Equations of the First Kind
- An adaptive pruning algorithm for the discrete L-curve criterion
- An optimum cubically convergent iterative method of inverting a linear bounded operator in Hilbert space
- Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
- Choosing regularization parameters in iterative methods for ill-posed problems
- Discrete inverse problems. Insight and algorithms.
- Fundamentals of Computerized Tomography
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Generalized inverses. Theory and applications.
- Improvement of Space-Invariant Image Deblurring by Preconditioned Landweber Iterations
- Iterative method for computing the Moore-Penrose inverse based on Penrose equations
- Iterative methods for ill-posed problems and semiconvergent sequences
- Iterative regularization with minimum-residual methods
- On Iterative Computation of Generalized Inverses and Associated Projections
- On hyperpower family of iterations for computing outer inverses possessing high efficiencies
- On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse
- On the filtering effect of iterative regularization algorithms for discrete inverse problems
- Projected Landweber method and preconditioning
- Regularization methods for large-scale problems
- Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
- Remarks on choosing a regularization parameter using the quasi-optimality and ratio criterion
- SIRT- and CG-type methods for the iterative solution of sparse linear least-squares problems
- Semi-convergence and relaxation parameters for a class of SIRT algorithms
- Semi-convergence properties of Kaczmarz's method
- Semiconvergence and Relaxation Parameters for Projected SIRT Algorithms
- Steepest descent, CG, and iterative regularization of ill-posed problems
Cited in
(3)- Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method
- Efficient space-dependent source retrieval method for a time-fractional diffusion model
- Adaptive coefficients iterative method for computing matrix inverse
This page was built for publication: Schultz matrix iteration based method for stable solution of discrete ill-posed problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q725513)
