Przemyslaw Wojtaszczyk

Applied Mathematics · 2000–2019

A researcher in the Science corpus: 6 papers; trusts 6 researchers and is trusted by 25 researchers here, as inferred from the citation graph.

Subfields

• Applied Mathematics — 16 citations into it; #980 of 7,620 by trust here, #3,794 by citations
• Mathematical Physics — 15 citations into it; #1,146 of 8,562 by trust here, #3,664 by citations
• Computational Mechanics — 13 citations into it; #5,708 of 10,001 by trust here, #6,582 by citations
• Numerical Analysis — 8 citations into it; #2,880 of 3,586 by trust here, #2,832 by citations
• Computational Theory and Mathematics — 5 citations into it; #10,450 of 12,182 by trust here, #2,761 by citations
• Mechanics of Materials — 5 citations into it

Whom Przemyslaw Wojtaszczyk trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Yvon Maday
2. Fernando Albiac

Who trusts Przemyslaw Wojtaszczyk overall

1. Vladimir N. Temlyakov
2. Fernando Albiac
3. Rémi Gribonval
4. Gustavo Garrigós
5. José L. Ansorena
6. Morten Nielsen
7. Pablo M. Berná
8. Stephen J. Dilworth
9. Eugenio Hernández
10. Ronald A. DeVore

Papers from Przemyslaw Wojtaszczyk's perspective

Ordered by how strongly the researchers Przemyslaw Wojtaszczyk trusts endorse each paper. Same corpus, a different order for every researcher.

1. Greedy Algorithm for General Biorthogonal Systems
2. Lebesgue-Type Inequalities for Quasi-greedy Bases
3. A Posteriori Error Bounds for Reduced-Basis Approximation of Parametrized Noncoercive and Nonlinear Elliptic Partial Differential Equations
4. Stable signal recovery from incomplete and inaccurate measurements
5. On the existence of almost greedy bases in Banach spaces
6. Lebesgue inequalities for the greedy algorithm in general bases
7. Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
8. Global a priori convergence theory for reduced-basis approximations of single-parameter symmetric coercive elliptic partial differential equations
9. Compressed sensing and best k-term approximation
10. Convergence rates for sparse chaos approximations of elliptic problems with stochastic coefficients

Their papers

• Convergence Rates for Greedy Algorithms in Reduced Basis Methods (2010) — 484 citations
• Greedy Algorithms for Reduced Bases in Banach Spaces (2012) — 191 citations
• Greedy Algorithm for General Biorthogonal Systems (2000) — 213 citations
• On the structure of Lipschitz-free spaces (2015) — 85 citations
• Greedy approximation for biorthogonal systems in quasi-Banach spaces (2019) — 71 citations
• Approximation of Functions of Few Variables in High Dimensions (2011) — 74 citations