Computer Algebra in Scientific Computing
From MaRDI portal
Publication:5479223
DOI10.1007/11555964zbMath1144.68384MaRDI QIDQ5479223
Rudolf Berghammer, Frank Neumann
Publication date: 7 July 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11555964
68W30: Symbolic computation and algebraic computation
Related Items
Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means, Tool-Based Relational Investigation of Closure-Interior Relatives for Finite Topological Spaces, Software Development in Relation Algebra with Ampersand, Relational Construction of Specific Timetables, A general method for representing sets of relations by vectors, RelView, Control of Condorcet voting: complexity and a relation-algebraic approach, Computing and visualizing Banks sets of dominance relations using relation algebra and RelView, Programming and automating mathematics in the Tarski-Kleene hierarchy, Computing minimal extending sets by relation-algebraic modeling and development, Solving computational tasks on finite topologies by means of relation algebra and the \textsc{RelView} tool, Contact, closure, topology, and the linking of row and column types of relations, Relation-algebraic specification and solution of special university timetabling problems, Cardinality of relations with applications, Applying relation algebra and RelView to solve problems on orders and lattices, Relational measures and integration in preference modeling, Embedding mappings and splittings with applications, Cryptomorphic topological structures: a computational, relation-algebraic approach, Relation algebra as programming language using the Ampersand compiler, On the use of binary decision diagrams for solving problems on simple games, Relation-algebraic modeling and solution of chessboard independence and domination problems, Order- and graph-theoretic investigation of dimensions of finite topological spaces and Alexandroff spaces, Combining relation algebra and data refinement to develop rectangle-based functional programs for reflexive-transitive closures, Using relation-algebraic means and tool support for investigating and computing bipartitions, Relations in linear algebra, Experimental investigation of sufficient criteria for relations to have kernels, Implementing Relational Specifications in a Constraint Functional Logic Language, Simple Rectangle-Based Functional Programs for Computing Reflexive-Transitive Closures, Relation Algebras, Matrices, and Multi-valued Decision Diagrams, Column-Wise Extendible Vector Expressions and the Relational Computation of Sets of Sets, Relation Algebra and RelView in Practical Use: Construction of Special University Timetables, Multi-objective Problems in Terms of Relational Algebra, On Automating the Calculus of Relations, Computing and Visualizing Closure Objects Using Relation Algebra and RelView