Regularization by truncated Cholesky factorization: a comparison of four different approaches

DOI10.1016/J.JCO.2006.07.003zbMath1117.65079OpenAlexW2073080923MaRDI QIDQ883332

Barbara Kaltenbacher

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

zbMATH Keywords

regularizationnumerical examplesCholesky factorizationill-posed linear operator equations

Mathematics Subject Classification ID

Numerical solutions to equations with linear operators (65J10) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Linear operators and ill-posed problems, regularization (47A52)

Related Items (2)

On the low-rank approximation by the pivoted Cholesky decomposition ⋮ Low rank approximation of the symmetric positive semidefinite matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Regularization by truncated Cholesky factorization: a comparison of four different approaches