Trade-off between information and computability: a technique for automated topological computations

doi:10.1108/03321640310474886

Login

Welcome:
Guest

Search for:

Browse:

Resources:

COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering

ISSN: 0332-1649

Online from: 1982

Subject Area: Electrical & Electronic Engineering

Content: Latest Issue | Latest Issue RSS | Previous Issues

Options: To add Favourites and Table of Contents Alerts please take a Emerald profile

Trade-off between information and computability: a technique for automated topological computations

Document Information:
Title:	Trade-off between information and computability: a technique for automated topological computations
Author(s):	Saku Suuriniemi, (Institute of Electromagnetics,Tampere University of Technology, Tampere, Finland), Lauri Kettunen, (Institute of Electromagnetics,Tampere University of Technology, Tampere, Finland)
Citation:	Saku Suuriniemi, Lauri Kettunen, (2003) "Trade-off between information and computability: a technique for automated topological computations", COMPEL: The International Journal for Computation and Mathematics in Electrical and Electronic Engineering, Vol. 22 Iss: 3, pp.481 - 494
Keywords:	Computational methods, Numerical methods, Topology
Article type:	Conceptual Paper
DOI:	10.1108/03321640310474886 (Permanent URL)
Publisher:	MCB UP Ltd
Abstract:	Finite element-based PDE solver software systems are typically method-driven. The user has to supply the data in a particular form required by a numerical method. The method refuses to start if the data is in incorrect format, and breaks down if correctly formatted data is insufficient or inconsistent. However, software can be made more flexible with data-driven approach. The decisions on existence and uniqueness of the solution, as well as the choice of suitable computing methods are based on the data. This calls for a new stage of data processing for a solver, which is not essentially an expert system. The questions are formalizable and their solution must be based on efficient and robust computational techniques. We present an elementary computational technique for automatic treatment of topological problems arising from potential theory, boundary condition inspection, and coupled problems. The approach is based on computing Smith normal form of the non-oriented boundary operator matrices, whose elements are from the ring N?mod?2, i.e. only 0s and 1s, instead of the integers. This approach obviates the problems of excessive computation time and risk of overflow in integer computations.