Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. Singapore-MIT Alliance (SMA)
  3. Computer Science (CS)
  4. Solving a Class of Higher-Order Equations over a Group Structure

Solving a Class of Higher-Order Equations over a Group Structure

Thumbnail Image
Download
Name

CS025.pdf

Size

215.7 KB

Format

Adobe PDF

Checksum (MD5)

79ad270e6602a699736a05766c8f4d9c

Author(s)
Andrei, Å tefan
•
Chin, Wei Ngan
Date Issued
January 2003
Series/Report no.
Computer Science (CS);
Abstract
In recent years, symbolic and constraint-solving techniques have been making major advances and are continually being deployed in new business and engineering applications. A major push behind this trend has been the development and deployment of sophisticated methods that are able to comprehend and evaluate important sub-classes of symbolic problems (such as those in polynomial, linear inequality and finite domains). However, relatively little has been explored in higher-order domains, such as equations with unknown functions. This paper proposes a new symbolic method for solving a class of higher-order equations with an unknown function over the complex domain. Our method exploits the closure property of group structure (for functions) in order to allow an equivalent system of equations to be expressed and solved in the first-order setting. Our work is an initial step towards the relatively unexplored realm of higher-order constraint-solving, in general; and higher-order equational solving, in particular. We shall provide some theoretical background for the proposed method, and also prototype an implementation under Mathematica. We hope that our foray will help open up more sophisticated applications, as well as encourage work towards new methods for solving higher-order constraints.
Subjects
higher-order equation
symbolic computation
Mathematica
Persistent DSpace Link
http://hdl.handle.net/1721.1/3685
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.