메뉴 건너뛰기




Volumn 22, Issue 4, 2001, Pages 1160-1183

A Levinson-Galerkin algorithm for regularized trigonometric approximation

Author keywords

Levinson algorithm; Multilevel method; Toeplitz matrix; Trigonometric approximation

Indexed keywords

ALGORITHMS; BIOLOGICAL ORGANS; BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; ECHOCARDIOGRAPHY; FUNCTION EVALUATION; GALERKIN METHODS; MATRIX ALGEBRA; OPTIMIZATION; PERTURBATION TECHNIQUES; POLYNOMIALS;

EID: 0034884650     PISSN: 10648275     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1064827597329254     Document Type: Article
Times cited : (5)

References (30)
  • 10
    • 0031514137 scopus 로고    scopus 로고
    • On numerical methods for discrete least-squares approximation by trigonometric polynomials
    • (1997) Math. Comp. , vol.66 , pp. 719-741
    • Fassbender, H.1
  • 20
    • 0000570697 scopus 로고
    • Analysis of discrete ill-posed problems by means of the L-curve
    • (1992) SIAM Rev. , vol.34 , pp. 561-580
    • Hansen, P.C.1
  • 21
    • 33747441485 scopus 로고
    • The Wiener RMS (root-mean square) error criterion in filter design and prediction
    • (1947) J. Math. Phys. , vol.25 , pp. 261-278
    • Levinson, N.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.