Abeynaya Gnanasekaran

According to our database, Abeynaya Gnanasekaran authored at least 7 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of five.

2024

An efficient quantum algorithm for simulating polynomial dynamical systems.

Amit Surana, Abeynaya Gnanasekaran, Tuhin Sahai

Quantum Inf. Process., March, 2024

2023

Efficient Quantum Algorithms for Nonlinear Stochastic Dynamical Systems.

Abeynaya Gnanasekaran, Amit Surana, Tuhin Sahai

Proceedings of the IEEE International Conference on Quantum Computing and Engineering, 2023

2022

Hierarchical Orthogonal Factorization: Sparse Square Matrices.

Abeynaya Gnanasekaran, Eric Darve

SIAM J. Matrix Anal. Appl., 2022

Hierarchical Orthogonal Factorization: Sparse Least Squares Problems.

Abeynaya Gnanasekaran, Eric Darve

J. Sci. Comput., 2022

Carleman linearization based efficient quantum algorithm for higher order polynomial differential equations.

Amit Surana, Abeynaya Gnanasekaran, Tuhin Sahai

CoRR, 2022

Scalable low-rank factorization using a task-based runtime system with distributed memory.

Abeynaya Gnanasekaran, Eric Darve

Proceedings of the PASC '22: Platform for Advanced Scientific Computing Conference, Basel, Switzerland, June 27, 2022

2021

A fast sparse QR factorization for solving linear least squares problems in graphics.

Abeynaya Gnanasekaran, Eric Darve

Proceedings of the SIGGRAPH 2021: Special Interest Group on Computer Graphics and Interactive Techniques Conference, 2021