
handle: 11584/23634
Summary: We introduce a new algorithm to estimate the optimal regularization parameter in truncated singular value decomposition regularization methods for the numerical solution of severely ill-posed linear systems. The algorithm couples a geometrical approach to identify the corner of the \(L\)-curve associated to the problem with some heuristic rules. Numerical results are reported to highlight the performance of the algorithm with respect to other methods for the selection of the regularization parameter.
l-curve, Numerical solutions to overdetermined systems, pseudoinverses, algorithm, regularization, Ill-posedness and regularization problems in numerical linear algebra, ill-conditioned linear systems, \(L\)-curve, QA1-939, Numerical results, truncated singular value decomposition, ill-conditioned linear system, Mathematics, performance, truncated singular value decomposition (tsvd)
l-curve, Numerical solutions to overdetermined systems, pseudoinverses, algorithm, regularization, Ill-posedness and regularization problems in numerical linear algebra, ill-conditioned linear systems, \(L\)-curve, QA1-939, Numerical results, truncated singular value decomposition, ill-conditioned linear system, Mathematics, performance, truncated singular value decomposition (tsvd)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
