Robustness of Solutions of Almost Every System of Equations

DOI10.1137/22M1483529MaRDI QIDQ5044540zbMATH OpenOpenAlexFDO

Authors Sana Jahedi, Timothy Sauer, James A. Yorke

Publication date 1 November 2022

Published in SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2202.00503

zbMATH Keywords

robustnessprevalencenonlinear equationsimplicit function theoremconstant rank theoremstructured systemsgeneric rank

Mathematics Subject Classification ID

General applied mathematics (00A69) Iterative numerical methods for linear systems (65F10) General theory of mathematical modeling (00A71)

Abstract: In mathematical modeling, it is common to have an equation $F(p)=c$ where the exact form of $F$ is not known. This article shows that there are large classes of $F$ where almost all $F$ share the same properties. The classes we investigate are vector spaces $mathcalF$ of $C^1$ functions $F:mathbb{R}^{N}omathbb{R}^M$ that satisfy the following condition: $mathcalF$ has ``almost constant rank (ACR) if there is a constant integer $ho(mathcalF)geq0$ such that rank$(DF(p))=ho(mathcalF)$ for ``almost every $FinmathcalF$ and almost every $pinmathbb{R}^N$. If the vector space $mathcalF$ is finite-dimensional, then ``almost every is with respect to Lebesgue measure on $mathcalF$, and otherwise, it means almost every in the sense of prevalence, as described herein. Most function spaces commonly used for modeling purposes are ACR. In particular, we show that if all of the functions in $mathcalF$ are linear or polynomial or real analytic, or if $mathcalF$ is the set of all functions in a ``structured system, then $mathcalF$ is ACR. For each $F$ and $p$, the solution set of $pinmathbb{R}^N$ is SolSet$(p):=x:F(x)=F(p).$ A solution set of $F(p)=c$ is called robust if it persists despite small changes in $F$ and $c$. The following two global results are proved for almost every $F$ in an ACR vector space $mathcalF$: (1) Either the solution set SolSet$(p)$ is robust for almost every $pinmathbb{R}^N$, or none of the solution sets are robust. (2) The solution set SolSet$(p)$ is a $C^{i}nfty$-manifold of dimension $d=N-ho(mathcalF)$. In particular, $d$ is the same for almost every $FinmathcalF$.

Recommendations

• Robust satisfiability of systems of equations
• Robust satisfiability of systems of equations
• Robustness in difference equations
• On the Robustness of Functional Equations
• Robustness of linear systems
• Robustness of solutions of an infinite-dimensional algebraic Sylvester equation under bounded perturbations
• Robust Solutions to a General Class of Approximation Problems
• A quantitative metric for robustness of nonlinear algebraic equation solvers
• Stability robustness of almost linear state equations
• Robustness of equations under operational extensions

Cites work

• An introduction to manifolds. 2nd revised ed.
• Embedology
• Hausdorff Measure of Critical Images on Banach Manifolds
• ON MATRICES DEPENDING ON PARAMETERS
• On sets of Haar measure zero in abelian Polish groups
• Prevalence
• Prevalence. An addendum to: “Prevalence: a translation-invariant ‘almost every’ on infinite-dimensional spaces” [Bull. Amer. Math. Soc. (N.S.) 27 (1992), no. 2, 217–238; MR1161274 (93k:28018)]
• Prevalence: a translation-invariant “almost every” on infinite-dimensional spaces
• Stability analysis of uncertain genetic sum regulatory networks
• The Prevalence of Continuous Nowhere Differentiable Functions
• The measure of the critical values of differentiable maps
• The vectorization of ITPACK 2C
• The zero set of a real analytic function

Cited in

(4)

• Homeostasis in networks with multiple inputs
• Robust steady states in ecosystems with symmetries
• Structured Systems of Nonlinear Equations
• Extinction of Multiple Populations and a Team of Die-Out Lyapunov Functions

This page was built for publication: Robustness of Solutions of Almost Every System of Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5044540)