An algorithm for solving parametric linear systems
From MaRDI portal
Publication:1194335
DOI10.1016/S0747-7171(08)80104-6zbMath0752.34010MaRDI QIDQ1194335
Publication date: 27 September 1992
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
complexity analysisconsistentGaussian elimination methodefficient algorithm for identifying all parametric valuesparametric systems of linear equationsSCRATCHPAD II
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Linear ordinary differential equations and systems (34A30) Abstract differential equations (12H20) Numerical methods for ordinary differential equations (65L99) Numerical analysis in abstract spaces (65J99)
Related Items
Decomposition of ordinary difference polynomials ⋮ Comprehensive Gröbner basis theory for a parametric polynomial ideal and the associated completion algorithm ⋮ Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination ⋮ The problem of defining the singular points of quasi-linear differential-algebraic systems ⋮ Teaching linear algebra in a mechanized mathematical environment ⋮ Parametric equation solving and quantifier elimination in finite fields with the characteristic set method ⋮ Unnamed Item ⋮ A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases ⋮ Improving the DISPGB algorithm using the discriminant ideal ⋮ Liouvillian solutions of linear differential equations of order three and higher ⋮ Decomposition of ordinary differential polynomials ⋮ Computing Tjurina stratifications of \(\mu \)-constant deformations via parametric local cohomology systems ⋮ Parametric FGLM algorithm ⋮ Algebraic local cohomology with parameters and parametric standard bases for zero-dimensional ideals ⋮ Complexity of solving parametric polynomial systems ⋮ A logic based approach to finding real singularities of implicit ordinary differential equations ⋮ On the numerical analysis and visualisation of implicit ordinary differential equations ⋮ Comprehensive LU Factors of Polynomial Matrices ⋮ A new algorithm for discussing Gröbner bases with parameters.
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On radical zero-dimensional ideals
- Integrals of multinomial systems of ordinary differential equations
- On mechanical quantifier elimination for elementary algebra and geometry
- Biochemical systems theory and metabolic control theory: I. Fundamental similarities and differences
- Biochemical systems theory and metabolic control theory: II. The role of summation and connectivity relationships
- Gröbner bases and primary decomposition of polynomial ideals
- The Gröbner fan of an ideal
- On an installation of Buchberger's algorithm
- Solving zero-dimensional algebraic systems
- Notes on Gröbner bases
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Decomposing algebraic sets using Gröbner bases
- Bifurcations and Transitions to Chaos in the Three-Dimensional Lotka–Volterra Map
- Admissible orders and linear forms
- Admissible term orderings used in computer algebra systems
- Constructions in Algebra
- Sylvester's Identity and Multistep Integer-Preserving Gaussian Elimination
