Irregular matrix

Known as: Ragged matrix, Regular matrix 
An irregular matrix, or ragged matrix, can be described as a matrix that has a different number of elements in each row. Ragged matrices are not used… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Suppose that an n-by-n regular matrix pencil A − λB has n distinct eigenvalues. Then determining a defective pencil E−λF which is… (More)
  • figure 5.1
  • table 5.1
  • table 5.2
  • table 5.3
Is this relevant?
Highly Cited
2015
Highly Cited
2015
Sparse matrix-vector multiplication (SpMV) is a fundamental building block for numerous applications. In this paper, we propose… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2015
2015
and Applied Analysis 3 2. The Double Difference Sequence Spaces In this section, we define some new paranormed double difference… (More)
Is this relevant?
2014
2014
In this paper we study the dynamics of multibody systems with the base not permanently fixed to the inertial frame, or more… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
A standard way of dealing with a matrix polynomial P (λ) is to convert it into an equivalent matrix pencil – a process known as… (More)
Is this relevant?
2009
2009
Alternating matrix polynomials, that is, polynomials whose coefficients alternate between symmetric and skew-symmetric matrices… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Regular linear matrix pencils A − E∂ ∈ K[∂], where K = Q, R or C, and the associated differential algebraic equation (DAE) E… (More)
Is this relevant?
2006
2006
The QZ algorithm reduces a regular matrix pair to generalized Schur form, which can be used to address the generalized eigenvalue… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We discuss two inverse free, highly parallel, spectral divide and conquer algorithms: one for computing an invariant subspace of… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
1992
Highly Cited
1992
The dense nonsymmetric eigenproblem is one of the hardest linear algebra problems to solve e ectively on massively parallel… (More)
Is this relevant?