2004
DOI: 10.1002/0471650412
|View full text |Cite
|
Sign up to set email alerts
|

An Introduction to Numerical Analysis for Electrical and Computer Engineers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
33
0

Year Published

2006
2006
2017
2017

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 63 publications
(34 citation statements)
references
References 0 publications
0
33
0
Order By: Relevance
“…Nevertheless, the number of iterations is greater that of the other two methods. We believe that a catastrophic cancelation [18] has been occurred here. Since, in both cases the optimal relaxation parameter is almost equal to 1.…”
Section: Examplementioning
confidence: 70%
“…Nevertheless, the number of iterations is greater that of the other two methods. We believe that a catastrophic cancelation [18] has been occurred here. Since, in both cases the optimal relaxation parameter is almost equal to 1.…”
Section: Examplementioning
confidence: 70%
“…Note that since f (γ) is differentiable and its derivative f (γ) can be easily obtained, one can use Newton's method [14] to obtain the root. The method can be applied by setting an initial value γ k=0 , where k denotes the iteration number.…”
Section: The Proposed Regularization Approachmentioning
confidence: 99%
“…In the numerical analysis, the Chebyshev nodes are the roots of the Chebyshev polynomial of the first kind. They are often used as nodes in polynomial interpolation because the resulting interpolation polynomial minimizes the problems of Runge's phenomenon [8]. For a given n, the n Chebyshev nodes are Polynomial interpolation is the interpolation of a given data set by a polynomial.…”
Section: Signal Processing Schemementioning
confidence: 99%