نتایج جستجو برای: rational canonical form

تعداد نتایج: 793017  

Journal: :Bulletin of the American Mathematical Society 1933

Journal: :The Electronic Journal of Linear Algebra 2020

Journal: :Proceedings of the Edinburgh Mathematical Society 1932

Journal: :journal of mathematical modeling 2015
kamele nassiri pirbazari mehdi azari

a common method to determine the order of minimal realization of a continuous linear time invariant descriptor system is to decompose it into slow and fast subsystems using the weierstrass canonical form. the weierstrass decomposition should be avoided because it is generally an ill-conditioned problem that requires many complex calculations especially for high-dimensional systems. the present ...

Journal: :Computer Aided Geometric Design 2018
Juan Gerardo Alcázar Heidi E. I. Dahl Georg Muntingh

We develop a characterization for the existence of symmetries of canal surfaces defined by a rational spine curve and rational radius function. In turn, this characterization inspires an algorithm for computing the symmetries of such canal surfaces. For Dupin cyclides in canonical form, we apply the characterization to derive an intrinsic description of their symmetries and symmetry groups, whi...

2013
D. Steven Mackey Niloufer Mackey Christian Mehl Volker Mehrmann

Two canonical forms for skew-symmetric matrix polynomials over arbitrary fields are characterized — the Smith form, and its skew-symmetric variant obtained via unimodular congruences. Applications include the analysis of the eigenvalue and elementary divisor structure of products of two skew-symmetric matrices, the derivation of a Smith-McMillan-like canonical form for skew-symmetric rational m...

Journal: :IOP Conference Series: Materials Science and Engineering 2018

1987
Erich Kaltofen M. S. Krishnamoorthy David Saunders

Boolean circuits of polynomial size and poly-logarithmic depth are given for computing the Hermite and Smith normal forms of polynomial matrices over finite fields and the field of rational numbers. The circuits for the Smith normal form computation are probabilistic ones and also determine very efficient sequential algorithms. Furthermore, we give a polynomial-time deterministic sequential alg...

Journal: :Int. J. Found. Comput. Sci. 2013
Vincent Carnino Sylvain Lombardy

In this paper, we extend the concept of factorization on finite words to ω-rational languages and show how to compute them. We define a normal form for Büchi automata and introduce a universal automaton for Büchi automata in normal form. We prove that, for every ω-rational language, this Büchi automaton, based on factorization, is canonical and that it is the smallest automaton that contains th...

Journal: :Proceedings of the Japan Academy, Series A, Mathematical Sciences 2016

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید