Publication | Closed Access
A differentially algebraic elimination theorem with application to analog computability in the calculus of variations
57
Citations
8
References
1985
Year
Mathematical ProgrammingNumerical AnalysisAlgebraic Differential EquationEngineeringVariational AnalysisElimination TheoremAlgebraic MethodAlgebraic AnalysisInverse ProblemsComputer ScienceNonlinear EquationAnalog ComputabilityDifferential AlgebraCalculus Of VariationComputability Theory
An elimination theorem is proved in differential algebra, from which it follows that an analytic solution of virtually any ordinary differential equation that you can "write down" must actually solve an algebraic differential equation. As a corollary, it follows that the solutions of a large class of variational problems can be produced by an analog computer.
| Year | Citations | |
|---|---|---|
Page 1
Page 1