617 search results - page 51 / 124 » On properties of cell matrices |
MOC
1998
13 years 7 months ago
1998
We consider solutions of a system of refinement equations written in the form φ = α∈Z a(α)φ(2 · −α), where the vector of functions φ = (φ1, . . . , φr)T is in (Lp(R))...
FOCM
2010
13 years 6 months ago
2010
One of the most widely used methods for eigenvalue computation is the QR iteration with Wilkinson’s shift: here the shift s is the eigenvalue of the bottom 2 × 2 principal mino...
TIT
2010
13 years 2 months ago
2010
The joint-sparse recovery problem aims to recover, from sets of compressed measurements, unknown sparse matrices with nonzero entries restricted to a subset of rows. This is an ex...
SIAMNUM
2011
12 years 10 months ago
2011
Abstract. When studying the ε-pseudospectrum of a matrix, one is often interested in computing the extremal points having maximum real part or modulus. This is a crucial step, for...
ACRI
2008
Springer
14 years 2 months ago
2008
Springer
In several cases, the DNA sequences of an organism are available in different stages of its evolution and it is desirable to reconstruct the DNA sequence in a previous evolution st...