<?xml version='1.0' encoding='UTF-8'?>
<doi_batch version="5.4.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.crossref.org/schema/5.4.0" xsi:schemaLocation="http://www.crossref.org/schema/5.4.0 https://www.crossref.org/schemas/crossref5.4.0.xsd" xmlns:jats="http://www.ncbi.nlm.nih.gov/JATS1" xmlns:fr="http://www.crossref.org/fundref.xsd" xmlns:ai="http://www.crossref.org/AccessIndicators.xsd" xmlns:rel="http://www.crossref.org/relations.xsd" xmlns:mml="http://www.w3.org/1998/Math/MathML">
  <head>
    <doi_batch_id>NONE</doi_batch_id>
    <timestamp>20260610120003526</timestamp>
    <depositor>
      <depositor_name>wseas/wseas</depositor_name>
      <email_address>content-registration-form+ja@crossref.org</email_address>
    </depositor>
    <registrant>content-registration-form</registrant>
  </head>
  <body>
    <journal>
      <journal_metadata>
        <full_title>International Journal of Computational and Applied Mathematics &amp; Computer Science</full_title>
        <issn media_type="electronic">2769-2477</issn>
      </journal_metadata>
      <journal_article>
        <titles>
          <title>Robust Suboptimal Recursive Least-Squares Fixed-Lag Smoothing Technique with Polynomial/ Fourier Series Approximations of Covariance Information for Linear Continuous-Time Stochastic Systems with Uncertainties</title>
        </titles>
        <contributors>
          <person_name sequence="first" contributor_role="author">
            <given_name>Seiichi</given_name>
            <surname>Nakamori</surname>
            <affiliations>
              <institution>
                <institution_name>Professor Emeritus, Faculty of Education, Kagoshima University, 1-20-6, Korimoto, Kagoshima, 890-0065, JAPAN </institution_name>
              </institution>
            </affiliations>
          </person_name>
        </contributors>
        <jats:abstract>
          <jats:p>The dual use of covariance information enables filtering and smoothing algorithms to effectively capture statistical dependencies and mitigate the effects of system uncertainties and observation noise. In the fixed-point smoother and filter, the existing literature approximates covariance information using finite Fourier series expansions. Building upon this foundation, the present work originally introduces a newly designed robust recursive least-squares fixed-lag (FL) smoother tailored for linear continuous-time stochastic systems with uncertainties. In this framework, the autocovariance function of the degraded signal is modeled as a semidegenerate function, while the cross-covariance function between the signal and the observed measurements is represented as a degenerate function. This paper emphasizes approximating both covariance structures using polynomials and finite Fourier series, thereby enabling flexible, computationally efficient modeling of statistical dependencies essential for robust state estimation. As demonstrated in the numerical simulation example, the mean-square values (MSVs) of the approximation errors associated with both the autocovariance and cross-covariance functions are negligible, indicating high fidelity in the modeling process. Based on polynomial approximations, the estimation accuracy of both the robust filter and the FL smoother is evaluated, highlighting their effectiveness in capturing key statistical dependencies. Additionally, the simulation includes a comparative example in which signal estimation is performed using covariance data approximated via finite Fourier series expansions. The results indicate that both the polynomial- and Fourier-based approximations strategies reliably and consistently support the robustness of the proposed estimation framework.
</jats:p>
        </jats:abstract>
        <publication_date media_type="print">
          <month>06</month>
          <day>10</day>
          <year>2026</year>
        </publication_date>
        <publication_date media_type="online">
          <month>06</month>
          <day>10</day>
          <year>2026</year>
        </publication_date>
        <pages>
          <first_page>38</first_page>
        </pages>
        <publisher_item>
          <item_number item_number_type="article_number">5</item_number>
        </publisher_item>
        <ai:program name="AccessIndicators">
          <ai:license_ref>https://creativecommons.org/licenses/by/4.0/deed.en_US</ai:license_ref>
        </ai:program>
        <doi_data>
          <doi>10.37394/232028.2026.6.5</doi>
          <resource>https://wseas.com/journals/camcs/2026/a10camcs-005(2026).pdf</resource>
        </doi_data>
        <citation_list>
          <citation key="ref0">
            <unstructured_citation>U. Lagerblad, H. Wentzel, A. Kulachenko, Study of a fixed-lag Kalman smoother for input and state estimation in vibrating structures, Inverse Problems in Science and Engineering, Vol. 9, 2021, pp. 1260–128. [Online]. Available: https://www.tandfonline.com/doi/full/10.1080/ 17415977.2020.1845669. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref1">
            <unstructured_citation>S. Yi, M. Zorzi, Robust fixed-lag smoothing under model perturbations, Journal of the Franklin Institute, Vol. 360, 2023, pp. 458– 483. [Online]. Available: https://www.sciencedirect.com/science/article/ abs/pii/S0016003222007918. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref2">
            <unstructured_citation>T.-C. Dong-Si, A. I. Mourikis, Motion tracking with fixed-lag smoothing: Algorithm and consistency analysis. Proc IEEE Int Conf Rob Autom., Shanghai, China, 2011, pp. 5655–5662. [Online]. Available: https://ieeexplore.ieee.org/document/5980267. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref3">
            <unstructured_citation>B. Kwon, P. S. Kim, Novel unbiased optimal receding-horizon fixed-lag smoothers for linear discrete time-varying systems, Appl. Sci., Vo. 12, 2022, 7832. [Online]. Available: https://www.mdpi.com/2076- 3417/12/15/7832. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref4">
            <unstructured_citation>B. Chen, J. K. Tugnait, Interacting multiple model fixed-lag smoothing algorithm for Markovian switching systems, IEEE Transactions on Aerospace and Electronic Systems, Vol. 36, 2000, pp. 243–250. [Online]. Available: Interacting multiple model fixed-lag smoothing algorithm for Markovian switching systems | IEEE Journals &amp; Magazine | IEEE Xplore. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref5">
            <unstructured_citation>H. Wang, H. Zhang, G. Duan, H/sub /spl infin// fixed-lag smoothing for descriptor systems, Proceedings of the 2005, American Control Conference 2005, Portland, OR, USA, 2005, Vol. 4, 2005, pp. 2919–2924. [Online]. Available: H/sub /spl infin// fixed-lag smoothing for descriptor systems | IEEE Conference Publication | IEEE Xplore. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref6">
            <unstructured_citation>K. Li, G. Zhou, L. Xu, Fixed-lag smoothing with linear equality constraints, 2017 20th International Conference on Information Fusion (Fusion), Xi'an, China, 2017, pp. 1–8. [Online]. Available: Fixed-lag smoothing with linear equality constraints | IEEE Conference Publication | IEEE Xplore. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref7">
            <unstructured_citation>F. Papi, M. Bocquel, M. Podt, Y. Boers, Fixed-lag smoothing for bayes optimal knowledge exploitation in target tracking, IEEE Trans Signal Process., Vol. 62, 2014, pp. 3143–3152. [Online]. Available: Fixed-Lag Smoothing for Bayes Optimal Knowledge Exploitation in Target Tracking | IEEE Journals &amp; Magazine | IEEE Xplore. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref8">
            <unstructured_citation>S.-L. Sun, Distributed optimal component fusion weighted by scalars for fixed-lag Kalman smoother, Automatica, Vol. 41, 2005, pp. 2153–2159. [Online]. Available: https://www.sciencedirect.com/science/article/ abs/pii/S0005109805002670. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref9">
            <unstructured_citation>F. S. Cattivelli, A. H. Sayed, Diffusion strategies for distributed Kalman filtering and smoothing, IEEE Trans Autom Control, Vol. 55, 2010, 55, pp. 2069–2084. [Online]. Available: Diffusion Strategies for Distributed Kalman Filtering and Smoothing | IEEE Journals &amp; Magazine | IEEE Xplore. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref10">
            <unstructured_citation>B. Kwon, Z. Quan, S. Han, A robust fixed-lag receding horizon smoother for uncertain state space models, Int J Adapt Control Signal Process, Vol. 29, 2015, pp. 1354–1366.[Online]. Available: OASIS Repository@POSTECHLIBRARY: A robust fixed-lag receding horizon smoother for uncertain state space models. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref11">
            <unstructured_citation>P. S. Kim, A computationally efficient fixedlag smoother using recent finite measurements, Measurement, Vol. 46, 2013, pp. 846–850. [Online]. Available: https://www.sciencedirect.com/science/article/ abs/pii/S0263224112003703. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref12">
            <unstructured_citation>H. Lee, S. Han, A continuous finite-time convergence fixed-lag FIR smoother using multiple IIR filters, J Franklin Inst., Vol. 359, 2022, pp. 5798–5826. [Online]. Available: https://www.sciencedirect.com/science/article/ abs/pii/S0016003222003155. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref13">
            <unstructured_citation>O. U. Rehman, I. R. Petersen, A robust continuous time fixed lag smoother for nonlinear uncertain systems, 52nd IEEE Conference on Decision and Control, Firenze, Italy, 2013, pp. 3750–3755. [Online]. Available: A robust continuous time fixed lag smoother for nonlinear uncertain systems | IEEE Conference Publication | IEEE Xplore (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref14">
            <unstructured_citation>A. Al-Hagri, L. Caglio, H. Stang, E. Katsanos, Application of fixed-lag Kalman smoother for nonlinear state estimation, J. Phys.: Conf. Series, 2647, 2024, 182034. [Online]. Available: https://iopscience.iop.org/article/10.1088/1742 -6596/2647/18/182034. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref15">
            <unstructured_citation>S. Nakamori, Design of recursive least-squares fixed-lag smoother using covariance information in linear continuous stochastic systems, Applied Mathematical Modelling, Vol. 31, 2007, pp. 1609-1620. [Online]. Available: https://www.sciencedirect.com/science/article/ pii/S0307904X06001193. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref16">
            <unstructured_citation>R. Bellman, S. Ueno, Invariant imbedding and the resolvent of Fredholm integral equations with semi-degenerate kernels, Journal of Mathematical Analysis and Applications, Vol. 44, 1973, pp. 264-273. [Online]. Available: https://www.sciencedirect.com/science/article/ pii/0022247X73900425. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref17">
            <unstructured_citation>L. V. Fausett, Applied Numerical Analysis Using MATLAB, Pearson Prentice Hall, Upper Saddle River, NJ, USA, 2008. [Online]. Available: https://books.google.co.jp/books/about/Applie d_Numerical_Analysis_Using_MATLAB.htm l?id=15CfQAAACAAJ&amp;redir_esc=y. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref18">
            <unstructured_citation>S. Boyd, Lecture 6 Least-squares application. [Online]. Available: https://see.stanford.edu/materials/lsoeldsee263 /06-ls-app.pdf. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref19">
            <unstructured_citation>W. K. Nicholson, Best Approximation and Least Squares, LibreTexts Mathematics. [Online]. Available: https://math.libretexts.org/Bookshelves/Linear _Algebra/Linear_Algebra_with_Applications_ (Nicholson)/05%3A_Vector_Space_R/5.06%3 A_Best_Approximation_and_Least_Squares. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
          <citation key="ref20">
            <unstructured_citation>R. L. Burden, J. D. Faires, A. M. Burden, Numerical Analysis, 10th ed., Engage Learning: Australia, Brazil, Mexico, Singapore, United Kingdom, United States , 2015. [Online]. Available: https://www.amazon.com/NumericalAnalysis-Richard-L-Burden/dp/1305253663. (Accessed: January 18, 2026).</unstructured_citation>
          </citation>
        </citation_list>
      </journal_article>
    </journal>
  </body>
</doi_batch>
