2008
DOI: 10.1007/s00607-008-0020-9
|View full text |Cite
|
Sign up to set email alerts
|

Initialisation of the adaptive Huber method for solving the first kind Abel integral equation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

9
52
0

Year Published

2009
2009
2017
2017

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 25 publications
(61 citation statements)
references
References 11 publications
9
52
0
Order By: Relevance
“…From the experimental point of view this response is uninteresting, and is normally ignored. For this reason, and also because the adaptive Huber method cannot compute singular solutions [4][5][6][7][8][9][10], we subtracted the singularity from c(t), by replacing Equation 14 by the IE:…”
Section: Resultsmentioning
confidence: 99%
See 2 more Smart Citations
“…From the experimental point of view this response is uninteresting, and is normally ignored. For this reason, and also because the adaptive Huber method cannot compute singular solutions [4][5][6][7][8][9][10], we subtracted the singularity from c(t), by replacing Equation 14 by the IE:…”
Section: Resultsmentioning
confidence: 99%
“…Readers are referred to References [4][5][6][7][8][9][10] for details of the adaptive Huber method. The kernel-dependent part of the method is fully characterized by a number of coefficients, specifically:…”
Section: Methods Extensionmentioning
confidence: 99%
See 1 more Smart Citation
“…(1), were obtained by modifying the procedures described in Refs. [8,12,13]. Hybrid algorithms, combining incomplete CR with LU decompositions were also tried, but we do not elaborate on them here, since they were not found more efficient under conditions of the present implementation.…”
Section: Numerical Experimentsmentioning
confidence: 99%
“…For an overview of the literature related to the sequential algorithms of solving equations similar to Eq. (1), the Reader is referred to Bieniasz [12,13]. In contrast to those serial algorithms, the numerical algorithm to be described here is an adaptation of the CR method for tridiagonal matrices, first described by Hockney [14] and Buzbee et al [15] for block-tridiagonal matrices, and attributed to Golub and Hockney.…”
Section: Introductionmentioning
confidence: 99%