Approximate Matrix Multiplication with Application to Linear Embeddings
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
We consider the following problem: minx∈Rnmin∥E∥≤η∥(A+E)x−b∥, where A is an m×n real matrix and b is an n-dimensional real column vector when it has multiple global minima. This problem is an errors-in-variables ...
This article addresses 2-dimensional layout of high-dimensional biomedical datasets, which is useful for browsing them efficiently We employ the isomap technique, which is based on classical MDS (multi-dimensional scaling) but seeks to preserve the intrins ...
Invariant subspaces of structured matrices are sometimes better conditioned with respect to structured perturbations than with respect to general perturbations. Sometimes they are not. This paper proposes an appropriate condition number c(S), for invariant ...
Society for Industrial and Applied Mathematics2006
This article addresses 2-dimensional layout of high-dimensional biomedical datasets, which is useful for browsing them efficiently. We employ the Isomap technique, which is based on classical MDS (multi-dimensional scaling) but seeks to preserve the intrin ...
Institute of Electrical and Electronics Engineers Computer Society2003
This article addresses 2-dimensional layout of high-dimensional biomedical datasets, which is useful for browsing them efficiently We employ the isomap technique, which is based on classical MDS (multi-dimensional scaling) but seeks to preserve the intrins ...
This paper provides a detailed analysis that shows how to stabilize the generalized Schur algorithm, which is a fast procedure for the Cholesky factorization of positive-definite structured matrices R that satisfy displacement equations of the form $R - FR ...
Society for Industrial and Applied Mathematics1996
We derive a stable and fast solver for nonsymmetric linear systems of equations with shift structured coefficient matrices (e.g., Toeplitz, quasi-Toeplitz, and product of two Toeplitz matrices). The algorithm is based on a modified fast QR factorization of ...
Society for Industrial and Applied Mathematics1998
The mechanism of neurite penetration of three-dimensional fibrin matrices was investigated by culturing embryonic chick dorsal root ganglia (DRGs) within fibrin gels, upon fibrin gels, and upon laminin. The length of neurites within three-dimensional matri ...
Let A be a rational n × n square matrix and b be a rational n-vector for some positive integer n. The linear complementarity problem (abbreviated by LCP) is to find a vector (x, y) in R^(2n) satisfying y = Ax + b (x, y) >= 0 and the complementarity conditi ...
In this small note, we observe some extremal behaviors of Murty's least index method for solving linear complementarity problems. In particular, we show that the expected number of steps for solving Murty's exponential example with a random permutation of ...
