Identifiability of Viscoelastic Mechanical Systems
summary
Claim: a spring–dashpot network is locally identifiable iff the number of non‑monic coefficients equals the number of parameters, and global identifiability requires unique polynomial factorizations. Method: rewrite stress–strain laws as linear differential operators, reduce series/parallel assemblies to a shape factorization problem, and study the resulting polynomial coefficient map. Tools: counting, factorization of monic polynomials, and invertibility of a submatrix (a Sylvester matrix) to prove finiteness. Examples: Maxwell, Voigt and Burgers models (4 parameters → 4 coefficients) are identifiable; ambiguous assemblies are only locally identifiable.
AI-written summary · about
chapters (20)
- 0:00Intro
- 0:17Structural Identifiability
- 2:19Viscous Material
- 2:52Viscoelastic material
- 3:25Application to cardiovascular modeling
- 5:27Viscoelastic (VE) System
- 8:54Identifiability problem
- 11:28Main result
- 13:14Local Identifiability
- 15:33Generalize process of combining in Series/Parallel
- 16:25Series connection
- 17:18Parallel connection
- 17:44Types of viscoelastic models
- 19:57Shape factorization problem for a quadruple of shapes
- 21:20Example cont'd
- 21:39Solving shape factorization problem
- 23:04Global identifiability
- 23:40Real Example (Dietrich 1998)
- 24:10Summary
- 24:43References
