Regularization by truncated Cholesky factorization: a comparison of four different approaches (Q883332): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hierarchical LU decomposition-based preconditioners for BEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4377756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4895893 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization by projection with <i>a posteriori</i> discretization level choice for linear and nonlinear ill-posed problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the characterization of self-regularization properties of a fully discrete projection method for Symm's integral equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithms for linear ill-posed problems yield regularization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3790554 / rank
 
Normal rank

Latest revision as of 20:32, 25 June 2024

scientific article
Language Label Description Also known as
English
Regularization by truncated Cholesky factorization: a comparison of four different approaches
scientific article

    Statements

    Regularization by truncated Cholesky factorization: a comparison of four different approaches (English)
    0 references
    4 June 2007
    0 references
    Due to the principle of regularization by restricting the number of degrees of freedom, truncating the Cholesky factorization of a symmetric positive definite matrix can be expected to have a stabilizing effect. Based on this idea, the author considers four different approaches for regularizing ill-posed linear operator equations. Convergence in the noise free case and in the situation of noisy data is analyzed. Numerical tests illustrate the theoretical results.
    0 references
    0 references
    0 references
    0 references
    0 references
    regularization
    0 references
    Cholesky factorization
    0 references
    numerical examples
    0 references
    ill-posed linear operator equations
    0 references
    0 references