Approximate Schur-block ILU preconditioners for regularized solution of discrete ill-posed problems
From MaRDI portal
Publication:2298133
DOI10.1155/2019/1912535zbMath1435.65048OpenAlexW2942401220WikidataQ127976647 ScholiaQ127976647MaRDI QIDQ2298133
Suzan C. Buranay, Ovgu C. Iyikal
Publication date: 20 February 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2019/1912535
Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Preconditioners for iterative methods (65F08)
Related Items (4)
A predictor-corrector iterative method for solving linear least squares problems and perturbation error analysis ⋮ An approximation solution of linear Fredholm integro-differential equation using collocation and Kantorovich methods ⋮ Theoretical and numerical aspects of a non-stationary preconditioned iterative method for linear discrete ill-posed problems ⋮ Hybrid Operators for Approximating Nonsmooth Functions and Applications on Volterra Integral Equations with Weakly Singular Kernels
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximate inverse preconditioner for Toeplitz systems with multiple right-hand sides
- On hyperpower family of iterations for computing outer inverses possessing high efficiencies
- Moment theory and some inverse problems in potential theory and heat conduction
- A new \(L\)-curve for ill-posed problems
- On block diagonal and Schur complement preconditioning
- Extrapolation techniques for ill-conditioned linear systems
- Experimental study of ILU preconditioners for indefinite matrices
- On preconditioning Schur complement and Schur complement preconditioning
- Factorized sparse approximate inverse preconditionings. III: Iterative construction of preconditioners
- Generalized inverses. Theory and applications.
- A family of iterative methods for computing Moore-Penrose inverse of a matrix
- A new variant of L-curve for Tikhonov regularization
- Simple and efficient determination of the Tikhonov regularization parameter chosen by the generalized discrepancy principle for discrete ill-posed problems
- An efficient and stable Newton-type iterative method for computing generalized inverse \(A_{T,S}^{(2)}\)
- Well-posed stochastic extensions of ill-posed linear problems
- Improvement of the resolution of an instrument by numerical solution of an integral equation
- Factorized sparse approximate inverse preconditionings. IV: Simple approaches to rising efficiency
- A Technique for the Numerical Solution of Certain Integral Equations of the First Kind
- Factorized Sparse Approximate Inverse Preconditionings I. Theory
- Numerical tools for analysis and solution of Fredholm integral equations of the first kind
- Rank-Deficient and Discrete Ill-Posed Problems
- On the two classes of high‐order convergent methods of approximate inverse preconditioners for solving linear systems
- BILUM: Block Versions of Multielimination and Multilevel ILU Preconditioner for General Sparse Linear Systems
- On a Class of High Order Methods for Inverting Matrices
- A parallel balance scheme for banded linear systems
- Iterative Solution Methods
- ILUM: A Multi-Elimination ILU Preconditioner for General Sparse Matrices
- A Numerical Method for Solving Fredholm Integral Equations of the First Kind Using Singular Values
- On the Numerical Solution of Ill-Conditioned Linear Systems with Applications to Ill-Posed Problems
- Inverse acoustic and electromagnetic scattering theory
- Enhanced multi-level block ILU preconditioning strategies for general sparse linear systems
This page was built for publication: Approximate Schur-block ILU preconditioners for regularized solution of discrete ill-posed problems
