An adaptive pruning algorithm for the discrete L-curve criterion (Q2508955): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Efficient determination of multiple regularization parameters in a generalized L-curve framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: The triangle method for finding the corner of the L-curve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limitations of the \(L\)-curve method in ill-posed problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deconvolution and regularization with Toeplitz matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Use of the L-Curve in the Regularization of Discrete Ill-Posed Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3023936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-convergence of the L-curve regularization parameter selection method / rank
 
Normal rank

Revision as of 20:59, 24 June 2024

scientific article
Language Label Description Also known as
English
An adaptive pruning algorithm for the discrete L-curve criterion
scientific article

    Statements

    An adaptive pruning algorithm for the discrete L-curve criterion (English)
    0 references
    0 references
    0 references
    0 references
    20 October 2006
    0 references
    discrete ill-posed problems
    0 references
    L-curve criterion
    0 references
    regularization
    0 references
    parameter-choice method
    0 references
    least squares method
    0 references
    algorithm
    0 references
    numerical examples
    0 references
    singular value decomposition
    0 references
    conjugate gradient
    0 references

    Identifiers