Shavarovskii, 2004 - Google Patents
On some “tame” and “wild” aspects of the problem of semiscalar equivalence of polynomial matricesShavarovskii, 2004
- Document ID
- 14188653407438734459
- Author
- Shavarovskii B
- Publication year
- Publication venue
- Mathematical Notes
External Links
Snippet
The problem of reducing polynomial matrices to canonical form by using semiscalar equivalent transformations is studied. This problem is wild as a whole. However, it is tame in some special cases. In the paper, classes of polynomial matrices are singled out for which …
- 230000001131 transforming 0 abstract description 19
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30312—Storage and indexing structures; Management thereof
- G06F17/30321—Indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/14—Fourier, Walsh or analogous domain transformations, e.g. Laplace, Hilbert, Karhunen-Loeve, transforms
- G06F17/141—Discrete Fourier transforms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30289—Database design, administration or maintenance
- G06F17/30303—Improving data quality; Data cleansing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/38—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
- G06F7/48—Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
- G06F7/52—Multiplying; Dividing
- G06F7/523—Multiplying only
- G06F7/53—Multiplying only in parallel-parallel fashion, i.e. both operands being entered in parallel
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/3061—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F17/30613—Indexing
- G06F17/30619—Indexing indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/11—Complex mathematical operations for solving equations, e.g. nonlinear equations, general mathematical optimization problems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/16—Matrix or vector computation, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
- G06F7/72—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers using residue arithmetic
- G06F7/724—Finite field arithmetic
- G06F7/726—Inversion; Reciprocal calculation; Division of elements of a finite field
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Harada et al. | Binary linear complementary dual codes | |
| Soloviev | Integrability of the pentagram map | |
| Sasao | Index Generation Functions: Tutorial. | |
| Cluzeau | Factorization of differential systems in characteristic p | |
| Shavarovskii | On some “tame” and “wild” aspects of the problem of semiscalar equivalence of polynomial matrices | |
| Strzeboński et al. | Univariate real root isolation in multiple extension fields | |
| Bhatnagar et al. | Elliptic well-poised Bailey transforms and lemmas on root systems | |
| Matolcsi | A Walsh-Fourier approach to the circulant Hadamard conjecture | |
| Abramov et al. | Resolving sequences of operators for linear ordinary differential and difference systems of arbitrary order | |
| Avrachenkov et al. | The first Laurent series coefficients for singularly perturbed stochastic matrices | |
| Jiro | Three dimensional Saito free divisors and singular curves | |
| Hu et al. | Ranks of permutative matrices | |
| Milovanović | A note on extraction of orthogonal polynomials from generating function for reciprocal of odd numbers | |
| Cannon | Some combinatorial and symbol manipulation programs in group theory | |
| Grigoriev et al. | Algorithms for sparse rational interpolation | |
| Majumder | Values shared by meromorphic functions and their derivatives | |
| Bremner et al. | Jordan quadruple systems | |
| Pradhan et al. | Mathematical framework for representing discrete functions as word-level polynomials | |
| Smirnov | A bilinear algorithm of length 22 for approximate multiplication of 2× 7 and 7× 2 matrices | |
| Mühlbach | On interpolation by rational functions with prescribed poles with applications to multivariate interpolation | |
| Buring et al. | The Expansion star mod o (h (4)) and Computer-Assisted Proof Schemes in the Kontsevich Deformation Quantization | |
| Gavrilova | Refined littlewood identity for spin hall-littlewood symmetric rational functions | |
| Pozdnichenko et al. | Algorithms and software for obtaining dissimilar order and high order of symbolic sequences | |
| Olshevskyi | Metric properties of Cayley graphs of alternating groups | |
| Liu et al. | Formal proof of prefix adders |