2017
DOI: 10.1016/j.ymssp.2016.09.011
|View full text |Cite
|
Sign up to set email alerts
|

A multiplicative regularization for force reconstruction

Abstract: Additive regularizations, such as Tikhonov-like approaches, are certainly the most popular methods for reconstructing forces acting on a structure. These approaches require, however, the knowledge of a regularization parameter, that can be numerically computed using specific procedures. Unfortunately, these procedures are generally computationally intensive. For this particular reason, it could be of primary interest to propose a method able to proceed without defining any regularization parameter beforehand. … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

1
54
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 61 publications
(55 citation statements)
references
References 25 publications
1
54
0
Order By: Relevance
“…Proof. First, we derive (14). Since |d n − r| 0.25/k and |d n − r | 0.25/k, applying the asymptotic form of the Hankel function…”
Section: Analysis Of Imaging Functionsmentioning
confidence: 99%
“…Proof. First, we derive (14). Since |d n − r| 0.25/k and |d n − r | 0.25/k, applying the asymptotic form of the Hankel function…”
Section: Analysis Of Imaging Functionsmentioning
confidence: 99%
“…Incidentally, the optimal value of the regularization parameter λ (0) can not be directly estimated from the marginalized MAP [36], the L-curve principle [37] or the Generalized Cross Validation [16] before solving the minimization problem [see Ref. [35] for details]. To this end, the optimization problem is solved iteratively using an adapted Iteratively Reweighted (IR) algorithm, which allows determining in an iterative manner the regularized force vector as well as the optimal regularization parameter associated to the minimization problem.…”
Section: Initialization Of the Resolution Algorithmmentioning
confidence: 99%
“…Incidentally, the optimal value of the regularization parameter λ (0) can not be directly estimated from the marginalized MAP [23], the L-curve principle [32] or the Generalized Cross Validation [33] before solving the minimization problem [see Ref. [34] for details]. To this end, the optimization problem is solved iteratively using an Iteratively Reweighted Least Squares (IRLS) algorithm [34,35], which allows determining in an iterative manner the regularized force vector as well as the optimal regularization parameter associated to the minimization problem.…”
mentioning
confidence: 99%
“…[34] for details]. To this end, the optimization problem is solved iteratively using an Iteratively Reweighted Least Squares (IRLS) algorithm [34,35], which allows determining in an iterative manner the regularized force vector as well as the optimal regularization parameter associated to the minimization problem.…”
mentioning
confidence: 99%
See 1 more Smart Citation