DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Polynomial matrix
Polynomial matrix
Polynomial Flows in the Plane
On Multivariate Interpolation
Stabilization, Estimation and Control of Linear Dynamical Systems with Positivity and Symmetry Constraints
Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizations
Polynomial Parametrization for the Solutions of Diophantine Equations and Arithmetic Groups
The Images of Non-Commutative Polynomials Evaluated on 2 × 2 Matrices
The Computation of the Inverse of a Square Polynomial Matrix ∗
Block Circulant Matrix with Circulant Polynomial Matrices As Its Blocks G.Ramesh, * R.Muthamilselvam,** * Associate Professor of Mathematics, Govt
Matrix Algebra and Control
Polynomial Matrix Decompositions
Quasi-Rational Canonical Forms of a Matrix Over a Number Field
On the Covariance Completion Problem Under a Circulant Structure
Computing the Nearest Rank-Deficient Matrix Polynomial
Deadbeat Response Is L2 0Ptimal
TP Perturbation of TN Matrices and Totally Positive Directions
The Computation of Matrix Function in Particular the Matrix Expotential
A Local Construction of the Smith Normal Form of a Matrix Polynomial, and Time-Periodic Gravity-Driven Water Waves
A Spectral Approach to Polynomial Matrices Solvents
Top View
Polynomial Bounds for the Oscillation of Solutions of Fuchsian Systems Tome 59, No 7 (2009), P
New Insight Into the Isomorphism of Polynomial Problem IP1S and Its Use in Cryptography
6 the Smith Canonical Form
Matrix Functions and Their Approximation Using Krylov Subspaces Matrixfunktionen Und Ihre Approximation in Krylov-Unterräumen
Arxiv:1811.06592V1 [Math.CA] 15 Nov 2018 E Fprmtr Novd Ti Hna Motn Question Important an Then Is It Involved
Jordan Matrices on the Equivalence of the I(1) Conditions for VAR Systems
A Fast Las Vegas Algorithm for Computing the Smith Normal Form of a Polynomial Matrix
Hyperbolic QR Factorization for J-Spectral Factorization of Polynomial Matrices
The Exact Methods to Compute the Matrix Exponential
Arxiv:1611.07170V1
The Euclidean Distance Degree of an Algebraic Variety
Orthogonal Confluent Hypergeometric Lattice Polynomials
A Particular Block Vandermonde Matrix
Polynomial Matrices with Given Determinant
Polymatrix: Infrastructure for Manipulation Polynomial Matrices
Block Power Method for Computing Solvents and Spectral Factors of Matrix Polynomials
Solving Matrix Polynomial Equations Arising in Queueing Problems Dario A
Normal Forms for General Polynomial Matrices
Symmetric Linearizations for Matrix Polynomials
Multiple Shift Second Order Sequential Best Rotation Algorithm for Polynomial Matrix Evd
Vector Spaces of Linearizations for Matrix Polynomials∗
Polynomial Matrix-Fraction Representations for Linear Time-Varying Systems*
Fast Algorithms for Solving Rfpгlr Circulant Linear Systems
A New Architecture Using Polynomial Matrix Multiplication for Advanced Wireless Communication
Controller Design Using Polynomial Matrix Description
Small Polynomial Matrix Presentations of Nonnegative Matrices
Generalized Matrix Exponential Solutions to the AKNS Hierarchy
Smith Normal Form of Polynomial Matrices“
Total Positivity of Some Polynomial Matrices That Enumerate Labeled Trees and Forests I
587 a NOTE on SPECIAL MATRICES Roselin Antony1 Habtu Alemayehu
Perturbation and Intervals of Totally Nonnegative Matrices and Related Properties of Sign Regular Matrices
ILAS2017: Connections ABSTRACTS
PARALLEL ALGORITHMS for MATRIX POLYNOMIAL DMSION PAOLA FAVATI Istituto Di Elaborazione Dell'lnformazione Del CNR Via S
Detecting Infinite Zeros in Polynomial Matrices
Fast Algorithms for Solving the Inverse Problem of AX B In
Rational and Polynomial Matrix Factorizations Via Recursive Pole-Zero Cancellation
On Invariant Factors of Primary Components of Square Matrices
Symmetries in Phase Portrait
High Performance and Reliable Algebraic Computing Clément Pernet
Block Companion Matrices, Discrete–Time Block Diagonal Stability and Polynomial Matrices
Smith Forms of Circulant Polynomial Matrices
Certain Sets Over Function Fields Are Polynomial Families 207
Circulant Polynomial Matrices
On the Complexity of Polynomial Matrix Computations
Pole Placement by Static Output Feedback for Generic Linear Systems
All You Should Know About Your “Companion” Robert E Hartwig
The Euclidean Distance Degree of an Algebraic Variety
Matrices That Commute with Their Derivative. on a Letter from Schur to Wielandt
Block Toeplitz Algorithms for Polynomial Matrix Null-Space Computation
Straight-Line Computation of the Polynomial Matrix Inverse Claude-Pierre Jeannerod, Gilles Villard
The Eigenstructure of an Arbitrary Polynomial Matrix: Cdmputational Aspects
An Algorithm for Polynomial Matrix SVD Based on Generalised
A Particular Block Vandermonde Matrix
ILAS Conference Pure and Applied Linear Algebra
On Idempotent Polynomial Matrices
Eigenvalues of Matrices and Graphs
Kinetic Euclidean Distance Matrices Puoya Tabaghi, Ivan Dokmanic,´ Martin Vetterli
Christoffel Transformations for Matrix Orthogonal Polynomials in the Real Line and the Non-Abelian 2D Toda Lattice Hierarchy
Relation Between Bernoulli Polynomial Matrix and K-Fibonacci Matrix
Matrix Polynomials with Completely Prescribed Eigenstructure ∗
A Deterministic Algorithm for Inverting a Polynomial Matrix