A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic n-roots
✍ Scribed by Göran Björck; Ralf Fröberg
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 512 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0747-7171
No coin nor oath required. For personal study only.
✦ Synopsis
This paper deals with the problem of using symbolic algebra to count the solutions of lnhomogeneous systems of algebraic equations. A trick is presented whereby the faster algorithms for the homogeneous ease can be used in the in.homogeneous case. The method is applied to the cyclic n-roots studied by one of the authors (and sometimes referred to as solutions to Arnborg's system or Davenport's problem).
📜 SIMILAR VOLUMES
Simple techniques of network thermodynamics are used to obtain the numerical solution of the Nernst-Planck and Poisson equation system. A network model for a particular physical situation, namely ionic transport through a thin membrane with simultaneous diffusion, convection and electric current, is