Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection

DOI10.1007/S10559-016-9868-4zbMATH Open1347.93006OpenAlexW2497975341MaRDI QIDQ333589FDOQ333589

E. G. Revunova

Publication date: 31 October 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-016-9868-4

Recommendations

• A randomized method for solving discrete ill-posed problems
• A truncated projected SVD method for linear discrete ill-posed problems
• Analysis of Discrete Ill-Posed Problems by Means of the L-Curve
• Old and new parameter choice rules for discrete ill-posed problems
• Decomposition methods for large linear discrete ill-posed problems

zbMATH Keywords

discrete ill-posed problemrandom projectiontruncated singular value decompositionmodel selection criteria

Mathematics Subject Classification ID

General systems (93A10)

Cites Work

• Regularization tools: A Matlab package for analysis and solution of discrete ill-posed problems
• Low-rank revealing \(UTV\) decompositions
• Some Comments on C P
• A new look at the statistical model identification
• Least squares after model selection in high-dimensional sparse models
• Title not available (Why is that?)
• On the Perturbation of Pseudo-Inverses, Projections and Linear Least Squares Problems
• Rank-Deficient and Discrete Ill-Posed Problems
• The truncated SVD as a method for regularization
• Model Selection and the Principle of Minimum Description Length
• Old and new parameter choice rules for discrete ill-posed problems
• A randomized method for solving discrete ill-posed problems
• Analytical study of error components for solving discrete ill-posed problems using random projections
• Title not available (Why is that?)
• Variance Estimation Using Refitted Cross-Validation in Ultrahigh Dimensional Regression
• Matrix pseudoinversion in the problem of design of associative memory
• Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds
• Randomized projective methods for the construction of binary sparse vector representations
• Some Applications of the Rank Revealing QR Factorization
• Low‐rank revealing QR factorizations
• Regularization by Truncated Total Least Squares
• Vector data transformation using random binary matrices

Cited In (4)

• A linear system output transformation for sparse approximation
• Index structures for fast similarity search for symbol strings
• Fast similarity search for graphs by edit distance
• Increasing the accuracy of solving discrete ill-posed problems by the random projection method

Uses Software

• Regularization tools
• UTV

This page was built for publication: Model selection criteria for a linear model to solve discrete ill-posed problems on the basis of singular decomposition and random projection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q333589)