Symbolic domain decomposition

DOI10.1007/978-3-642-14128-7_16MaRDI QIDQ3582706zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Jacques Carette, Alan P. Sexton, Volker Sorge, Stephen M. Watt

Publication date 24 August 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1004.5549

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Abstract: 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.

Recommendations

• Decomposition of domains
• scientific article; zbMATH DE number 1504716
• scientific article; zbMATH DE number 554614
• Domain decomposition splittings
• Arlequin based PGD domain decomposition

Cited in

(1)

• Purely Catalytic P Systems over Integers and Their Generative Power

This page was built for publication: Symbolic domain decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3582706)