Computer Science – Symbolic Computation
Scientific paper
2010-04-30
Computer Science
Symbolic Computation
Calculemus 2010 (17th Symposium on the Integration of Symbolic Computation and Mechanised Reasoning), part of Conferences on I
Scientific paper
Decomposing the domain of a function into parts has many uses in mathematics. A domain may naturally be a union of pieces, a function may be defined by cases, or different boundary conditions may hold on different regions. For any particular problem the domain can be given explicitly, but when dealing with a family of problems given in terms of symbolic parameters, matters become more difficult. This article shows how hybrid sets, that is multisets allowing negative multiplicity, may be used to express symbolic domain decompositions in an efficient, elegant and uniform way, simplifying both computation and reasoning. We apply this theory to the arithmetic of piecewise functions and symbolic matrices and show how certain operations may be reduced from exponential to linear complexity.
Carette Jacques
Sexton Alan P.
Sorge Volker
Watt Stephen M.
No associations
LandOfFree
Symbolic Domain Decomposition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Symbolic Domain Decomposition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symbolic Domain Decomposition will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-388529