Computer Algebra in Scientific Computing

Dr. Wolfram Koepf ist im Fachbereich Informatik/Mathematik/Naturwissenschaften der Hochschule für Technik, Wirtschaft und Kultur in Leipzig tätig.

Construction of Irreducible Polynomials over Finite Fields.- Factorization of Polynomials and GCD Computations for Finding Universal Denominators.- A Role of Symbolic Computations in Beam Physics.- Thomas Decomposition of Algebraic and Differential Systems.- On Multivariate Homogeneous Polynomial Decomposition.- Computing Matrix Representations of Filiform Lie Algebras.- Type Specialization in Aldor.- An Algebraic Implicitization and Specialization of Minimum KL-Divergence Models.- On Sufficient Conditions for Integrability of a Planar System of ODEs Near a Degenerate Stationary Point.- Symbolic-Numeric Algorithms for Computer Analysis of Spheroidal Quantum Dot Models.- On Reduction of Lagrange Systems.- Series Transformations to Improve and Extend Convergence.- Differential Resultant, Computer Algebra and Completely Integrable Dynamical Systems.- Generic, Type-Safe and Object Oriented Computer Algebra Software.- Implementing Data Parallel Rational Multiple-Residue Arithmetic in Eden.- Fast Generalized Bruhat Decomposition.- Computational Science in Armenia (Invited Talk).- From Petri Nets to Polynomials: Modeling, Algorithms, and Complexity (Abstract) (Invited Talk).- Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests.- Term Cancellations in Computing Floating-Point Gröbner Bases.- One Class of Third-Order Linear ODE's.- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials.- Derivation of Explicit Difference Schemes for Ordinary Differential Equations with the Aid of Lagrange-Burmann Expansions.- Parametric Qualitative Analysis of Ordinary Differential Equations: Computer Algebra Methods for Excluding Oscillations (Extended Abstract) (Invited Talk).- An Analytical Model forthe Probability Characteristics of a Crack Hitting an Encapsulated Self-healing Agent in Concrete.- Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases.