Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
From MaRDI portal
(Redirected from Publication:5161747)
Recommendations
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
- On relaxed greedy randomized augmented Kaczmarz methods for solving large sparse inconsistent linear systems
- On greedy randomized augmented Kaczmarz method for solving large sparse inconsistent linear systems
- On a fast deterministic block Kaczmarz method for solving large-scale linear systems
- scientific article; zbMATH DE number 5116799
Cites work
- A fast randomized algorithm for overdetermined linear least-squares regression
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A randomized Kaczmarz algorithm with exponential convergence
- A Randomized Solver for Linear Systems with Exponential Convergence
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- Accelerated projection methods for computing pseudoinverse solutions of systems of linear equations
- Applied iterative methods.
- Atomic decomposition by basis pursuit
- Blendenpik: Supercharging LAPACK's Least-Squares Solver
- Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of equations
- Convergence of inner-iteration GMRES methods for rank-deficient least squares problems
- Convergence rates for Kaczmarz-type algorithms
- Distributed estimation via iterative projections with application to power network monitoring
- GMRES methods for least squares problems
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- GPU computing with Kaczmarz's and other iterative algorithms for linear systems
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- scientific article; zbMATH DE number 2111135 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- Inner-Iteration Krylov Subspace Methods for Least Squares Problems
- Iterative algorithms for large partitioned linear systems, with applications to image reconstruction
- LSRN: A parallel iterative solver for strongly over- or underdetermined systems
- Methods of conjugate gradients for solving linear systems
- Multistep matrix splitting iteration preconditioning for singular linear systems
- On convergence rate of the randomized Kaczmarz method
- On greedy randomized coordinate descent methods for solving large linear least-squares problems.
- On greedy randomized Kaczmarz method for solving large sparse linear systems
- On partially randomized extended Kaczmarz method for solving large sparse overdetermined inconsistent linear systems
- On relaxed greedy randomized Kaczmarz methods for solving large sparse linear systems
- On the Meany inequality with applications to convergence analysis of several row-action iteration methods
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Projection method for solving a singular system of linear equations and its applications
- Randomized approximation of the Gram matrix: exact computation and probabilistic bounds
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Solution of Sparse Indefinite Systems of Linear Equations
- The N‐Step Iteration Procedures
- The University of Florida sparse matrix collection
Cited in
(16)- GMRES methods for tomographic reconstruction with an unmatched back projector
- Restarted randomized surrounding methods for solving large linear equations
- On fast greedy block Kaczmarz methods for solving large consistent linear systems
- Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
- A Flexible Inner-Outer Preconditioned GMRES Algorithm
- A semi-randomized Kaczmarz method with simple random sampling for large-scale linear systems
- Randomized Douglas–Rachford Methods for Linear Systems: Improved Accuracy and Efficiency
- A subspace constrained randomized Kaczmarz method for structure or external knowledge exploitation
- On pseudoinverse-free randomized methods for linear systems: unified framework and acceleration
- Preprocessed GMRES for fast solution of linear equations
- An accelerated surrogate hyperplane Kaczmarz method based on two-dimensional search
- Randomized block residual steepest descent method with k-means clustering for large sparse linear systems
- Orthogonal block Kaczmarz inner-iteration preconditioned flexible GMRES method for large-scale linear systems
- The equivalence of the randomized extended Gauss-Seidel and randomized extended Kaczmarz methods
- A residual-based randomized Kaczmarz method for solving linear feasibility problems
- Restarted relaxed greedy randomized surrounding method for large sparse linear systems
This page was built for publication: Kaczmarz-type inner-iteration preconditioned flexible GMRES methods for consistent linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5161747)
