Researchers have developed a new algorithm for identifying discrete-time fractional-order dynamical systems (FoDS). This algorithm simplifies the identification process by reformulating it as a least squares estimation, avoiding complex polynomial equation solving. The proposed method includes a detailed sample complexity analysis, showing that the estimation error decays at a rate of O(d/ε), where d is the state variable dimension and ε is the desired accuracy. Simulation results confirm the theoretical bounds and demonstrate the algorithm's accuracy and robustness. AI
IMPACT This research could lead to more accurate modeling of complex systems, potentially impacting fields that rely on dynamical system analysis.
RANK_REASON The cluster contains an academic paper published on arXiv detailing a new algorithm and its theoretical analysis. [lever_c_demoted from research: ic=1 ai=0.4]
AI-generated summary · Google Gemini · from 1 sources. How we write summaries →