Regularization by truncated Cholesky factorization: a comparison of four different approaches
From MaRDI portal
Publication:883332
DOI10.1016/j.jco.2006.07.003zbMath1117.65079MaRDI QIDQ883332
Publication date: 4 June 2007
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2006.07.003
65J10: Numerical solutions to equations with linear operators
65J20: Numerical solutions of ill-posed problems in abstract spaces; regularization
47A52: Linear operators and ill-posed problems, regularization
Related Items
Cites Work
- Hierarchical LU decomposition-based preconditioners for BEM
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- Optimal algorithms for linear ill-posed problems yield regularization methods
- Regularization by projection with a posteriori discretization level choice for linear and nonlinear ill-posed problems
- On the characterization of self-regularization properties of a fully discrete projection method for Symm's integral equation
- Unnamed Item
- Unnamed Item
- Unnamed Item