Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2008

Highly Cited

2008

There has been continued interest in seeking a theorem describing optimal low-rank approximations to tensors of order 3 or higher… Expand

Highly Cited

2008

Highly Cited

2008

Low-rank matrix approximation is an effective tool in alleviating the memory and computational burdens of kernel methods and… Expand

Highly Cited

2006

Highly Cited

2006

In many applications, the data consist of (or may be naturally formulated as) an $m \times n$ matrix $A$. It is often of interest… Expand

Highly Cited

2004

Highly Cited

2004

We consider the problem of computing low rank approximations of matrices. The novelty of our approach is that the low rank… Expand

Highly Cited

2004

Highly Cited

2004

We consider the problem of approximating a given <i>m</i> × <i>n</i> matrix <b>A</b> by another matrix of specified rank <i>k</i… Expand

Highly Cited

2003

Highly Cited

2003

We study the common problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM… Expand

Highly Cited

2003

Highly Cited

2003

This article deals with the solution of integral equations using collocation methods with almost linear complexity. Methods such… Expand

Highly Cited

2003

Highly Cited

2003

This paper concerns the construction of a structured low rank matrix that is nearest to a given matrix. The notion of structured… Expand

Highly Cited

2001

Highly Cited

2001

The singular value decomposition (SVD) has been extensively used in engineering and statistical applications. This method was… Expand

Highly Cited

2000

Highly Cited

2000

Summary. This article considers the problem of approximating a general asymptotically smooth function in two variables, typically… Expand