An algorithm for solving parametric linear systems

DOI10.1016/S0747-7171(08)80104-6zbMath0752.34010MaRDI QIDQ1194335

William Y. Sit

Publication date: 27 September 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

complexity analysis; consistent; Gaussian elimination method; efficient algorithm for identifying all parametric values; parametric systems of linear equations; SCRATCHPAD II

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W30: Symbolic computation and algebraic computation

34A30: Linear ordinary differential equations and systems

12H20: Abstract differential equations

65L99: Numerical methods for ordinary differential equations

65J99: Numerical analysis in abstract spaces

Related Items

Decomposition of ordinary difference polynomials, Decomposition of ordinary differential polynomials, The problem of defining the singular points of quasi-linear differential-algebraic systems, A new algorithm for discussing Gröbner bases with parameters., Liouvillian solutions of linear differential equations of order three and higher, Improving the DISPGB algorithm using the discriminant ideal

Uses Software

• IBM Scratchpad

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