Algorithms for Computing Sparse Solutions
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F11%3APU92289" target="_blank" >RIV/00216305:26220/11:PU92289 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Algorithms for Computing Sparse Solutions
Original language description
The article deals with algorithms for computing the so-called sparse solutions of linear equations. This is a relatively novel approach to signal representation and it is very attractive, because it brings a wide spectrum of new applications (compressedsensing, fast MRI, radar etc.). However, in typical cases, the number of equations counts hundreds of thousands, and therefore, we need specialized algorithms for computing the sparse solutions. In this paper, such algorithms are divided into classes andtheir basic principles are described. The algorithms are compared from different viewpoints.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JA - Electronics and optoelectronics
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 17th Conference STUDENT EEICT 2011 Volume 3
ISBN
978-80-214-4273-3
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
—
Publisher name
NOVPRESS s.r.o.
Place of publication
Brno
Event location
Brno
Event date
Apr 28, 2011
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—