The CUNY Data Science and Applied Topology Reading Group is joint between the Mathematics and Computer Science programmes. We meet Fridays 11.45 -- 12.45 in GC 4419. You can contact us at email@example.com.
Our plan is to primarily read and discuss seminal papers in data science, in applied topology and in topological data analysis. Each seminar one participant takes the responsibility to present a paper and prepare items for discussion. We expect occasionally to be able to invite external speakers.
Current schedule can be found here.
We will be sending out announcements through a mailing list; you can subscribe here.
- Mikael Vejdemo-Johansson, Computer Science Programme, CUNY Graduate Center; Department of Mathematics, CUNY College of Staten Island
- Azita Mayeli, Mathematics Programme, CUNY Graduate Center; Department of Mathematics, CUNY Queensborough Community College
We have compiled a list of papers that might be interesting to present.
Multiplierless iteration for the resolution of semidefinite linear systems
Algorithms of numerical analysis assume by default that all numbers manipulated by the computer are real numbers. We introduce for the first time in this talk a numerical method that accommodates the internal coarse binary operations of a computer to increase the efficiency of the algorithm. We show that a linear system of equations with a matrix that is symmetric and positive semidefinite can be iteratively solved with an algorithm where every multiplication is reduced to a scaling by a power of 2, which simply amounts to bit shifts in binary.
We will then see how this multiplierless algorithm can be used in various problems, such as least squares, l1-regularized least squares and the minimal-norm resolution of any consistent linear system. A particular application of focus will be the minimal-norm reconstruction of a bandlimited signal from generalized nonuniform samples.