Name
Title | ||
|---|---|---|
Algorithms for the theory of restrictions of scalar \(n\) -D systems to proper subspaces of \(\mathbb {R}^n\). |
Abstract | ||
|---|---|---|
In this paper, we study the restrictions of solutions of a scalar system of PDEs to a proper subspace of the domain . The object of study is associated with certain intersection ideals. In the paper, we provide explicit algorithms to calculate these intersection ideals. We next deal with when a given subspace is "free" with respect to the solution set of a system of PDEs-this notion of freeness is related to restrictions and intersection ideals. We again provide algorithms and checkable algebraic criterion to answer the question of freeness of a subspace. Finally, we provide an upper bound to the dimension of free subspaces that can be associated with the solution set of a system of PDEs. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s11045-014-0285-4 | MULTIDIMENSIONAL SYSTEMS AND SIGNAL PROCESSING |
Keywords | DocType | Volume |
Systems of PDEs,Restriction ideals,Computational algorithms | Journal | 26.0 |
Issue | ISSN | Citations |
SP2 | 0923-6082 | 1 |
PageRank | References | Authors |
0.44 | 8 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Debasattam Pal | 1 | 28 | 12.84 |
| Harish K. Pillai | 2 | 90 | 20.79 |