Derivation of feasibility conditions in engineering problems under parametric inequality constraints with classical Fourier elimination

@article{Ioakimidis2000DerivationOF,
  title={Derivation of feasibility conditions in engineering problems under parametric inequality constraints with classical Fourier elimination},
  author={Nikolaos I. Ioakimidis},
  journal={International Journal for Numerical Methods in Engineering},
  year={2000},
  volume={48},
  pages={1583-1599}
}
  • N. Ioakimidis
  • Published 20 August 2000
  • Mathematics
  • International Journal for Numerical Methods in Engineering
Fourier (or Motzkin or even Fourier–Motzkin) elimination is the classical and equally old analogue of Gaussian elimination for the solution of linear equations to the case of linear inequalities. Here this approach (and two standard improvements) is applied to two engineering problems (involving numerical integration in fracture mechanics as well as finite differences in heat transfer in the parametric case) with linear inequality constraints. The results (solvent systems of inequalities… 
Feasibility Conditions in Engineering Problems 3 2 Compatibility of a system of linear inequalities
In this paper we show how the mathematical and engineering points of view are complementary and help to model real problems that can be stated as systems of linear inequalities. The Γ-algorithm,
Feasibility Conditions in Engineering ProblemsInvolving a Parametric System of Linear Inequalities
In this paper we apply the Γ -algorithm to obtain the feasibility conditions in different engineering problems involving a parametric system of linear inequalities. The feasibility conditions are the
A complexity perspective on entailment of parameterized linear constraints
TLDR
This paper introduces satisfiability with respect to polyhedral sets and entailment for the class of parameterized linear constraints and examines a weakening and a strengthening extension of the entailment problem.
Computational complexity of inclusion queries over polyhedral sets
TLDR
The goal of the study is to establish boundaries between hard and easy problems in this context of computational complexities of procedures for inclusion queries over polyhedral sets.
Redlog-based derivation of feasibility conditions for singular integral equations of crack problems under parametric inequality constraints
Τα προβλήματα ρωγμών στην κλασική θeωρία της διδιάστατης στατικής eλαστικότητας ανάγονται συχνά σe ιδιόμορφeς ολοκληρωτικές eξισώσeις μe πυρήνeς τύπου Cauchy, που στη συνέχeια λύνονται προσeγγιστικά

References

SHOWING 1-10 OF 37 REFERENCES
Classical numerical methods in engineering: a note on existential quantifier elimination under parametric inequality constraints
In this paper, an attempt is made to show the usefulness of computational quantifier elimination (CQE) techniques in computer algebra inside classical numerical methods in engineering for the
Simulation and Optimization by Quantifier Elimination
TLDR
The author's elimination method for parametric linear programming is extended to the non-convex case by allowing arbitrary and?orcombinations of parametriclinear inequalities as constraints as constraints, and a new strategy for finding smaller elimination sets and thus smaller elimination trees is presented.
Variable Elimination in Linear Constraints
TLDR
The thesis that variable elimination in linear constraints over the reals extends quite naturally to constraints in certain discrete domains is dwelled on.
...
...