Results 1  10
of
4,063,395
Jordan Normal and Rational Normal Form Algorithms
"... In this paper, we present a determinist Jordan normal form algorithms based on the Fadeev formula: (λ · I − A) · B(λ) = P (λ) · I where B(λ) is (λ · I − A)’s comatrix and P (λ) is A’s characteristic polynomial. This rational Jordan normal form algorithm differs from usual algorithms since it is n ..."
Abstract
 Add to MetaCart
In this paper, we present a determinist Jordan normal form algorithms based on the Fadeev formula: (λ · I − A) · B(λ) = P (λ) · I where B(λ) is (λ · I − A)’s comatrix and P (λ) is A’s characteristic polynomial. This rational Jordan normal form algorithm differs from usual algorithms since
A NORMAL FORM ALGORITHM FOR DIFFERENTIAL DEFORMATIONS
, 2001
"... Abstract. We introduce the notion of a formal differential deformation of a local Artinian algebra and describe a normal form algorithm to compute presentations of differential deformations. We show that the microlocal structure of the Brieskorn lattice of an isolated hypersurface singularity can be ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We introduce the notion of a formal differential deformation of a local Artinian algebra and describe a normal form algorithm to compute presentations of differential deformations. We show that the microlocal structure of the Brieskorn lattice of an isolated hypersurface singularity can
A New Criterion for Normal Form Algorithms
 Proc. AAECC, volume 1719 of LNCS
, 1999
"... In this paper, we present a new approach for computing normal forms in the quotient algebra A of a polynomial ring R by an ideal I. It is based on a criterion, which gives a necessary and sufficient condition for a projection onto a set of polynomials, to be a normal form modulo the ideal I. This cr ..."
Abstract

Cited by 65 (18 self)
 Add to MetaCart
In this paper, we present a new approach for computing normal forms in the quotient algebra A of a polynomial ring R by an ideal I. It is based on a criterion, which gives a necessary and sufficient condition for a projection onto a set of polynomials, to be a normal form modulo the ideal I
Efficient Parallelizations of Hermite and Smith Normal Form Algorithms
"... Hermite and Smith normal form are important forms of matrices used in linear algebra. These terms have many applications in group theory and number theory. As the entries of the matrix and of its corresponding transformation matrices can explode during the computation, it is a very difficult proble ..."
Abstract
 Add to MetaCart
form algorithms. These are the first parallelizations of algorithms for computing the normal forms with corresponding transformation matrices, both over the rings Z and F[x]. We show that our parallel versions have good efficiency, i.e., by doubling the processes, the execution time is nearly halved
Admissible Orderings and Bounds for Gröbner Basis Normal Form Algorithms
, 1997
"... The concepts of admissible orderings and normal form algorithm are basic in Buchberger's Gröbner basis algorithm. We present a constructive and elementary proof of Robbiano's characterization theorem for admissible orderings. Using this characterization, we give a bound on the complexity o ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The concepts of admissible orderings and normal form algorithm are basic in Buchberger's Gröbner basis algorithm. We present a constructive and elementary proof of Robbiano's characterization theorem for admissible orderings. Using this characterization, we give a bound on the complexity
Normal Form Algorithms for Extended ContextFree Grammars
 Theoretical Computer Science
, 2000
"... We investigate the complexity of a variety of normalform transformations for extended contextfree grammars, where by extended we mean that the set of righthand sides for each nonterminal in such a grammar is a regular set. The study is motivated by the implementation project GraMa which will p ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
free grammars (the symbolthreaded expression forest), a new normal form for these grammars (dot normal form) and new regular expression algorithms. 1 Introduction In the 1960's, extended contextfree grammars were introduced, based on BackusNaur form, as a useful abbreviatory notation that made
A Normal Form Algorithm For Regular Differential Chains
, 2013
"... Abstract. This paper presents a new algorithm for computing the normal form of a differential rational fraction modulo differential ideals presented by regular differential chains. An application to the computation of power series solutions is presented and illustrated with the new DifferentialAlgeb ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. This paper presents a new algorithm for computing the normal form of a differential rational fraction modulo differential ideals presented by regular differential chains. An application to the computation of power series solutions is presented and illustrated with the new Differential
Extended ContextFree Grammars and Normal Form Algorithms
, 1998
"... We investigate the complexity of a variety of normalform transformations for extended contextfree grammars, where by extended we mean that the set of righthand sides for each nonterminal in such a grammar is a regular set. The study is motivated by the implementation project GraMa which will prov ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
symbolthreaded expression forest), a new normal form for these grammars (dot normal form) and new regular expression algorithms. 1 Introduction in the 1960's, extended contextfree grammars were introduced, using BackusNaur form, as a useful abbreviatory notation that made contextfree grammars
Transition Diagram Systems and Normal Form Algorithms
, 1998
"... We investigate the complexity of a variety of normalform transformations for transition diagram systems, which are a parsing view of extended contextfree grammars. A transition diagram system is a finite collection of finitestate machines each of which is labeled with a unique nonterminal symbol. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We investigate the complexity of a variety of normalform transformations for transition diagram systems, which are a parsing view of extended contextfree grammars. A transition diagram system is a finite collection of finitestate machines each of which is labeled with a unique nonterminal symbol
Results 1  10
of
4,063,395