Zobrazeno 1 - 10
of 151
pro vyhledávání: '"Joglekar, A. S"'
Autor:
Joglekar, Archis S.
Partial-differential-equation (PDE)-constrained optimization is a well-worn technique for acquiring optimal parameters of systems governed by PDEs. However, this approach is limited to providing a single set of optimal parameters per optimization. Gi
Externí odkaz:
http://arxiv.org/abs/2410.12683
Autor:
Arvind, Vikraman, Joglekar, Pushkar S
We study the noncommutative rank problem, ncRANK, of computing the rank of matrices with linear entries in $n$ noncommuting variables and the problem of noncommutative Rational Identity Testing, RIT, which is to decide if a given rational formula in
Externí odkaz:
http://arxiv.org/abs/2404.16382
Autor:
Joglekar, Shreyas S., Baumgaertl, Korbinian, Mucchietto, Andrea, Berger, Francis, Grundler, Dirk
Spin waves (magnons) can enable wave-based neuromorphic computing by which one aims at overcoming limitations inherent to conventional electronics and the von Neumann architecture. In this study, we explore the storage of magnon signals and the magne
Externí odkaz:
http://arxiv.org/abs/2312.09177
Solving fluid dynamics equations often requires the use of closure relations that account for missing microphysics. For example, when solving equations related to fluid dynamics for systems with a large Reynolds number, sub-grid effects become import
Externí odkaz:
http://arxiv.org/abs/2306.10709
Autor:
Arvind, V., Joglekar, Pushkar S.
Based on a theorem of Bergman we show that multivariate noncommutative polynomial factorization is deterministic polynomial-time reducible to the factorization of bivariate noncommutative polynomials. More precisely, we show the following: (1) In the
Externí odkaz:
http://arxiv.org/abs/2303.06001
Plasma supports collective modes and particle-wave interactions that leads to complex behavior in inertial fusion energy applications. While plasma can sometimes be modeled as a charged fluid, a kinetic description is useful towards the study of nonl
Externí odkaz:
http://arxiv.org/abs/2206.01637
Autor:
Arvind, V., Joglekar, Pushkar S.
In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose entries $M_{i
Externí odkaz:
http://arxiv.org/abs/2203.16978
Autor:
Arvind, V., Joglekar, Pushkar S.
In this paper we study the problem of efficiently factorizing polynomials in the free noncommutative ring F of polynomials in noncommuting variables x_1,x_2,..., x_n over the field F. We obtain the following result: Given a noncommut
Externí odkaz:
http://arxiv.org/abs/2202.09883
Autor:
Arvind, V., Joglekar, Pushkar S.
Publikováno v:
In Information and Computation December 2024 301 Part A
One of the major problems writers and poets face is the writer's block. It is a condition in which an author loses the ability to produce new work or experiences a creative slowdown. The problem is more difficult in the context of poetry than prose,
Externí odkaz:
http://arxiv.org/abs/2107.14587