scispace - formally typeset
Search or ask a question

Answers from top 13 papers

More filters
Papers (13)Insight
The present authors note that the original paper appears to have a key error in the permutation matrix specification of the first method.
This analysis suggests that Origen did produce a list of books in the mid-third century that closely – though not exactly – resembled the list of New Testament books published by Athanasius in 367.
Since the original matrix need not be stored in memory, the use of memory is also efficient, and the number of computations is as small as any known to the writer.
The resulting approximation is not only consistent, but also closest to the original matrix, i. e., deviates least from an expert's original judgments.
As everyone in business ethics knows, Adam Smith wrote two books, not one, although this fact seems to come as a surprise to many avid Smith supporters.
It is a straightforward extension of the solutions for ordinary vector linear systems studied in the past several decades and will play an important role in the design of matrix linear systems using original system matrices.
Open accessProceedings ArticleDOI
11 Jan 2015
145 Citations
Specifically, we show that uniform sampling yields a matrix that, in some sense, well approximates a large fraction of the original.
336--368], which shows that the decoupling of the regular part can be done already with the help of the Wong sequences of the original matrix pencil.
We argue that many of the old results can be carried over to this new setting and that the original claims about the deformed matrix model are essentially correct.
It is demonstrated that using a gradient-based iterative algorithm for solving the mentioned coupled linear matrix equations is equivalent to extending the well-known Richardson method for solving the normal equations corresponding to the original coupled linear matrix equations.
Open accessProceedings ArticleDOI
Biao Lu, Dong Wei, Brian L. Evans, Alan C. Bovik 
01 Nov 1998
24 Citations
We demonstrate that two of the proposed methods significantly outperform both the original matrix pencil method and the modified Kumaresan-Tufts (1982) method, especially at low signal-to-noise ratio.
Thus, we provide a new matrix pencil that preserves both the symmetric structure and the structural invariants, of the original 2-D polynomial matrix.
Moreover, we show how to exploit the structure of the proposed matrix pencils in Krylov-type methods, so that in this case we only have to deal with linear system solves of matrices of the original matrix polynomial dimension.