메뉴 건너뛰기




Volumn 4, Issue 8, 1997, Pages 236-239

Automatic bound estimation: A practical development in optimal bounding ellipsoid processing

Author keywords

Bounded error processing; Optimal bounding ellipsoid; Parameter estimation; Set membership identification; System identification

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; CONVERGENCE OF NUMERICAL METHODS; ERROR DETECTION; MATHEMATICAL MODELS; PARAMETER ESTIMATION; SIGNAL THEORY;

EID: 0031211014     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/97.611289     Document Type: Article
Times cited : (4)

References (8)
  • 1
    • 0028195828 scopus 로고
    • Unifying the landmark developments in optimal bounding ellipsoid identification
    • Jan./Feb.
    • J. R. Deller, M. Nayeri, and M. S. Liu, "Unifying the landmark developments in optimal bounding ellipsoid identification." Int. J. Automat. Contr. Signal Process., vol. 8, pp. 48-63, Jan./Feb. 1994.
    • (1994) Int. J. Automat. Contr. Signal Process. , vol.8 , pp. 48-63
    • Deller, J.R.1    Nayeri, M.2    Liu, M.S.3
  • 2
    • 0027607901 scopus 로고
    • Least square identification with error bounds for real-lime signal processing and control
    • June
    • J. R. Deller, M. Nayeri, and S. F. Odeh, "Least square identification with error bounds for real-lime signal processing and control." Proc. IEEE, vol. 81, pp. 813-849, June 1993.
    • (1993) Proc. IEEE , vol.81 , pp. 813-849
    • Deller, J.R.1    Nayeri, M.2    Odeh, S.F.3
  • 3
    • 0020103099 scopus 로고
    • On the value of information in system identification - Bounded noise case
    • E. Fogel and Y.-F. Huang, "On the value of information in system identification - Bounded noise case," Automatica. vol. 18, pp. 229-238, 1982.
    • (1982) Automatica , vol.18 , pp. 229-238
    • Fogel, E.1    Huang, Y.-F.2
  • 5
    • 0043260384 scopus 로고
    • Linear prediction analysis of speech based on set-membership theory
    • Oct.
    • J. R. Deller and T. C. Luk, "Linear prediction analysis of speech based on set-membership theory." Comput. Speech Lang., vol. 3, pp. 301-327. Oct. 1989
    • (1989) Comput. Speech Lang. , vol.3 , pp. 301-327
    • Deller, J.R.1    Luk, T.C.2
  • 8
    • 0347790841 scopus 로고
    • Do interpretable optimal bounding ellipsoid algorithms converge? - Parts I & II
    • Copenhagen, Denmark, July
    • M. Nayeri, M. S. Liu, and J. R. Deller, Jr., "Do interpretable optimal bounding ellipsoid algorithms converge? - Parts I & II." in Proc. 10th IFAC Symp. System Identification, Copenhagen, Denmark, July 1994. vol. 3, pp. 389-400.
    • (1994) Proc. 10th IFAC Symp. System Identification , vol.3 , pp. 389-400
    • Nayeri, M.1    Liu, M.S.2    Deller Jr., J.R.3


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