A probabilistic algorithm to test local algebraic observability in polynomial time (Q5894826): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jsco.2002.0532 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: ObservabilityTest / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Kronecker / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2675964770 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0010045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of partial derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A uniform approach for Hermite Padé and simultaneous Padé approximants and their matrix-type generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Manipulating Formal Power Series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kronecker's and Newton's approaches to solving: a first comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatique et corps différentiels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3973334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gröbner free alternative for polynomial system solving / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear controllability and observability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization-free decomposition algorithms in differential algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kähler differentials and differential algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5680222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4724470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: System identifiability based on the power series expansion of the solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Associative differential operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound for the order of characteristic set elements of an ordinary prime differential ideal and some applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Similarity transformation approach to identifiability analysis of nonlinear compartmental models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility by algebraic projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4747970 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JSCO.2002.0532 / rank
 
Normal rank

Latest revision as of 01:03, 10 December 2024

scientific article; zbMATH DE number 1801681
Language Label Description Also known as
English
A probabilistic algorithm to test local algebraic observability in polynomial time
scientific article; zbMATH DE number 1801681

    Statements

    A probabilistic algorithm to test local algebraic observability in polynomial time (English)
    0 references
    17 September 2002
    0 references

    Identifiers