Displaying similar documents to “From Eckart and Young approximation to Moreau envelopes and vice versa”

On an algorithm to decide whether a free group is a free factor of another

Pedro V. Silva, Pascal Weil (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

We revisit the problem of deciding whether a finitely generated subgroup is a free factor of a given free group . Known algorithms solve this problem in time polynomial in the sum of the lengths of the generators of and exponential in the rank of . We show that the latter dependency can be made exponential in the rank difference rank - rank, which often makes a significant change.

An approximation theorem for sequences of linear strains and its applications

Kewei Zhang (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

We establish an approximation theorem for a sequence of linear elastic strains approaching a compact set in by the sequence of linear strains of mapping bounded in Sobolev space . We apply this result to establish equalities for semiconvex envelopes for functions defined on linear strains a construction of quasiconvex functions with linear growth.

Possible numbers ofx’s in an {x,y}-matrix with a given rank

Chao Ma (2017)

Open Mathematics

Similarity:

Let x, y be two distinct real numbers. An {x, y}-matrix is a matrix whose entries are either x or y. We determine the possible numbers of x’s in an {x, y}-matrix with a given rank. Our proof is constructive.

Census algorithms for chinese remainder pseudorank

David Laing, Bruce Litow (2007)

RAIRO - Theoretical Informatics and Applications

Similarity:

We investigate the density and distribution behaviors of the chinese remainder representation pseudorank. We give a very strong approximation to density, and derive two efficient algorithms to carry out an exact count (census) of the bad pseudorank integers. One of these algorithms has been implemented, giving results in excellent agreement with our density analysis out to -bit integers.

Latent Semantic Indexing using eigenvalue analysis for efficient information retrieval

Cherukuri Kumar, Suripeddi Srinivas (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

Text retrieval using Latent Semantic Indexing (LSI) with truncated Singular Value Decomposition (SVD) has been intensively studied in recent years. However, the expensive complexity involved in computing truncated SVD constitutes a major drawback of the LSI method. In this paper, we demonstrate how matrix rank approximation can influence the effectiveness of information retrieval systems. Besides, we present an implementation of the LSI method based on an eigenvalue analysis for rank...

-convergence and absolute minimizers for supremal functionals

Thierry Champion, Luigi De Pascale, Francesca Prinari (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

In this paper, we prove that the approximants naturally associated to a supremal functional -converge to it. This yields a lower semicontinuity result for supremal functionals whose supremand satisfy weak coercivity assumptions as well as a generalized Jensen inequality. The existence of minimizers for variational problems involving such functionals (together with a Dirichlet condition) then easily follows. In the scalar case we show the existence of at least one absolute minimizer...

A new rank formula for idempotent matrices with applications

Yong Ge Tian, George P. H. Styan (2002)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

It is shown that rank ( P * A Q ) = rank ( P * A ) + rank ( A Q ) - rank ( A ) , where A is idempotent, [ P , Q ] has full row rank and P * Q = 0 . Some applications of the rank formula to generalized inverses of matrices are also presented.