COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > High Dimensional Approximation via Sparse Occupancy Trees

## High Dimensional Approximation via Sparse Occupancy TreesAdd to your list(s) Download to your calendar using vCal - Peter Binev (University of South Carolina)
- Monday 17 June 2019, 14:20-15:10
- Seminar Room 1, Newton Institute.
If you have a question about this talk, please contact INI IT. ASCW03 - Approximation, sampling, and compression in high dimensional problems Adaptive domain decomposition is often used in finite elements methods for solving partial differential equations in low space dimensions. The adaptive decisions are usually described by a tree. Assuming that can find the (approximate) error for approximating a function on each element of the partition, we have shown that a particular coarse-to-fine method provides a near-best approximation. This result can be extended to approximating point clouds any space dimension provided that we have relevant information about the errors and can organize properly the data. Of course, this is subject to the curse of dimensionality and nothing can be done in the general case. In case the intrinsic dimensionality of the data is much smaller than the space dimension, one can define algorithms that defy the curse. This is usually done by assuming that the data domain is close to a low dimensional manifold and first approximating this manifold and then the function defined by it. A few years ago, together with Philipp Lamby, Wolfgang Dahmen, and Ron DeVore, we proposed a direct method (without specifically identifying any low dimensional set) that we called “sparse occupancy trees”. The method defines a piecewise constant or linear approximation on general simplicial partitions. This talk considers an extension of this method to find a similar approximation on conforming simplicial partitions following an idea from a recent result together with Francesca Fierro and Andreas Veeser about near-best approximation on conforming triangulations. This talk is part of the Isaac Newton Institute Seminar Series series. ## This talk is included in these lists:- All CMS events
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
- bld31
Note that ex-directory lists are not shown. |
## Other listsMolecular, Structural & Cellular Microbiology Polar Museum public events Cambridge Climate Lecture Series 2018 (#CCLS2018)## Other talksCan you handle it? Using 3D prints to improve museum access Quantitative immersability of Riemann metrics and the infinite hierarchy of prestrained shell models Level-set topology optimization for robust design of structures under internal porosity constraints Annual General Meeting The structure of the proton and the exploration of the high-energy frontier Insect conservation: conserving the little things that run the world. |