A New Identity for the Least-square Solution of Overdetermined Set of Linear Equations
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 present a randomized iterative algorithm that exponentially converges in the mean square to the minimum l(2)-norm least squares solution of a given linear system of equations. The expected number of arithmetic operations required to obtain an estimate o ...
Society for Industrial and Applied Mathematics2013
We consider design of sparse controllers for a stochastic linear system with infinite horizon quadratic objective. We formulate the non-sparse optimal solution through a semidefinite program for the second order moments of the states and inputs. Given that ...
We consider the problem of efficiently solving Sylvester and Lyapunov equations of medium and large scale, in case of rank-structured data, i.e., when the coefficient matrices and the right-hand side have low-rank off- diagonal blocks. This comprises probl ...
In this paper, we prove a new identity for the least-square solution of an over-determined set of linear equation Ax=b, where A is an m×n full-rank matrix, b is a column-vector of dimension m, and m (the number of equations) is larger tha ...
The focus of this thesis is on developing efficient algorithms for two important problems arising in model reduction, estimation of the smallest eigenvalue for a parameter-dependent Hermitian matrix and solving large-scale linear matrix equations, by extra ...
Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate functions based on random sampling according to a given probability measure. Recent work has shown that ...
This work is concerned with the numerical solution of large-scale linear matrix equations A1XB1T++AKXBKT=C. The most straightforward approach computes XRmxn from the solution of an mn x mn linear system, typically limiting the feasible values of m,n to a f ...
We consider the optimization of a quadratic objective function whose gradients are only accessible through a stochastic oracle that returns the gradient at any given point plus a zero-mean finite variance random error. We present the first algorithm that a ...
Motivated by the numerical treatment of parametric and stochastic PDEs, we analyze the least-squares method for polynomial approximation of multivariate func- tions based on random sampling according to a given probability measure. Recent work has shown th ...
We evaluated a laser-based noncontacting method to measure the elastic anisotropy of horizontal shale cores. Whereas conventional transducer data contained an ambiguity between phase and group velocity measurements, small laser source and receiver footprin ...
